Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8519)
- Computer Sciences (8502)
- Databases and Information Systems (3446)
- Software Engineering (2153)
- Artificial Intelligence and Robotics (1686)
-
- Information Security (1056)
- Numerical Analysis and Scientific Computing (1023)
- Engineering (955)
- Graphics and Human Computer Interfaces (926)
- Social and Behavioral Sciences (734)
- Business (685)
- Computer Engineering (511)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (183)
- Education (178)
- Management Information Systems (177)
- Data Storage Systems (175)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (110)
- Keyword
-
- Deep learning (124)
- Machine learning (124)
- Social media (80)
- Artificial intelligence (71)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (53)
- Singapore (52)
- Visualization (52)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Task analysis (48)
- Anomaly detection (47)
- Collaboration (45)
- Feature extraction (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 6901 - 6930 of 8692
Full-Text Articles in Entire DC Network
Link Type Based Pre-Cluster Pair Model For Coreference Resolution, Yang Song, Houfeng Wang, Jing Jiang
Link Type Based Pre-Cluster Pair Model For Coreference Resolution, Yang Song, Houfeng Wang, Jing Jiang
Research Collection School Of Computing and Information Systems
This paper presents our participation in the CoNLL-2011 shared task, Modeling Unrestricted Coreference in OntoNotes. Coreference resolution, as a difficult and challenging problem in NLP, has attracted a lot of attention in the research community for a long time. Its objective is to determine whether two mentions in a piece of text refer to the same entity. In our system, we implement mention detection and coreference resolution seperately. For mention detection, a simple classification based method combined with several effective features is developed. For coreference resolution, we propose a link type based pre-cluster pair model. In this model, pre-clustering of …
Guest Editorial: Special Issue On Game Theory In Communication Networks, Tansu Alpcan, Rachid El-Azouzi, Nahum Shimkin, Laura Wynter
Guest Editorial: Special Issue On Game Theory In Communication Networks, Tansu Alpcan, Rachid El-Azouzi, Nahum Shimkin, Laura Wynter
Research Collection School Of Computing and Information Systems
The distributed nature of wireline and wireless communication networks gives rise to many challenges in their analysis, control, and management. Development of decentralized control mechanisms that achieve fair allocation of system resources despite the selfish nature of the users is among the major issues in networks research. Consequently, game theoretic methods and approaches have been increasingly utilized to gain a deeper analytical understanding of these complex problems and systems.
Preserving Transparency And Accountability In Optimistic Fair Exchange Of Digital Signatures, Xinyi Huang, Yi Mu, Willy Susilo, Jianying Zhou, Robert H. Deng
Preserving Transparency And Accountability In Optimistic Fair Exchange Of Digital Signatures, Xinyi Huang, Yi Mu, Willy Susilo, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
Optimistic fair exchange (OFE) protocols are useful tools for two participants to fairly exchange items with the aid of a third party who is only involved if needed. A widely accepted requirement is that the third party's involvement in the exchange must be transparent, to protect privacy and avoid bad publicity. At the same time, a dishonest third party would compromise the fairness of the exchange and the third party thus must be responsible for its behaviors. This is achieved in OFE protocols with another property called accountability. It is unfortunate that the accountability has never been formally studied in …
Regret Minimizing Audits: A Learning-Theoretic Basis For Privacy Protection, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha
Regret Minimizing Audits: A Learning-Theoretic Basis For Privacy Protection, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha
Research Collection School Of Computing and Information Systems
Audit mechanisms are essential for privacy protection in permissive access control regimes, such as in hospitals where denying legitimate access requests can adversely affect patient care. Recognizing this need, we develop the first principled learning-theoretic foundation for audits. Our first contribution is a game-theoretic model that captures the interaction between the defender (e.g., hospital auditors) and the adversary (e.g., hospital employees). The model takes pragmatic considerations into account, in particular, the periodic nature of audits, a budget that constrains the number of actions that the defender can inspect, and a loss function that captures the economic impact of detected and …
Query Weighting For Ranking Model Adaptation, Peng Cai, Wei Gao, Aoying Zhou, Kam-Fai Wong
Query Weighting For Ranking Model Adaptation, Peng Cai, Wei Gao, Aoying Zhou, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
We propose to directly measure the importance of queries in the source domain to the target domain where no rank labels of documents are available, which is referred to as query weighting. Query weighting is a key step in ranking model adaptation. As the learning object of ranking algorithms is divided by query instances, we argue that it’s more reasonable to conduct importance weighting at query level than document level. We present two query weighting schemes. The first compresses the query into a query feature vector, which aggregates all document instances in the same query, and then conducts query weighting …
Getting To Know Social Media Analytics, Tin Seong Kam
Getting To Know Social Media Analytics, Tin Seong Kam
Research Collection School Of Computing and Information Systems
Over the last five years, the unprecedented development and use of social mediating technologies such as blog, wiki, Facebook, and Tweeter have engendered radically new ways of working, playing, and creating meaning, leaving an indelible mark on nearly every domain imaginable. Despite the growing ubiquity of social mediating technologies, their potential has hardly been tapped. Effectively using data collected from social mediating technologies by the business community is far from trivial. This is mainly due to the general lack of awareness on Social Network Analysis (SNA) techniques and technologies among the business analysts and practitioners. This presentation aims to provide …
Adaptive Decision Support For Structured Organizations: A Case For Orgpomdps, Pradeep Reddy Varakantham, Nathan Schurr, Alan Carlin, Christopher Amato
Adaptive Decision Support For Structured Organizations: A Case For Orgpomdps, Pradeep Reddy Varakantham, Nathan Schurr, Alan Carlin, Christopher Amato
Research Collection School Of Computing and Information Systems
In today's world, organizations are faced with increasingly large and complex problems that require decision-making under uncertainty. Current methods for optimizing such decisions fall short of handling the problem scale and time constraints. We argue that this is due to existing methods not exploiting the inherent structure of the organizations which solve these problems. We propose a new model called the OrgPOMDP (Organizational POMDP), which is based on the partially observable Markov decision process (POMDP). This new model combines two powerful representations for modeling large scale problems: hierarchical modeling and factored representations. In this paper we make three key contributions: …
Message-Passing Algorithms For Large Structured Decentralized Pomdps, Akshat Kumar, Shlomo Zilberstein
Message-Passing Algorithms For Large Structured Decentralized Pomdps, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide a rigorous framework for multi-agent decision-theoretic planning. However, their high complexity has limited scalability. In this work, we present a promising new class of algorithms based on probabilistic inference for infinite-horizon ND-POMDPs---a restricted Dec-POMDP model. We first transform the policy optimization problem to that of likelihood maximization in a mixture of dynamic Bayes nets (DBNs). We then develop the Expectation-Maximization (EM) algorithm for maximizing the likelihood in this representation. The EM algorithm for ND-POMDPs lends itself naturally to a simple message-passing paradigm guided by the agent interaction graph. It is thus highly scalable w.r.t. the number of …
Second International Workshop On Web 2.0 For Software Engineering (Web2se 2011), Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black
Second International Workshop On Web 2.0 For Software Engineering (Web2se 2011), Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black
Research Collection School Of Computing and Information Systems
Social software is built around an "architecture of participation" where user data is aggregated as a side-effect of using Web 2.0 applications. Web 2.0 implies that processes and tools are socially open, and that content can be used in several different contexts. Web 2.0 tools and technologies support interactive information sharing, data interoperability and user centered design. For instance, wikis, blogs, tags and feeds help us organize, manage and categorize content in an informal and collaborative way. Some of these technologies have made their way into collaborative software development processes and development platforms. These processes and environments are just scratching …
Fragile Online Relationship: A First Look At Unfollow Dynamics In Twitter, Haewoon Kwak, Hyunwoo Chun, Sue. Moon
Fragile Online Relationship: A First Look At Unfollow Dynamics In Twitter, Haewoon Kwak, Hyunwoo Chun, Sue. Moon
Research Collection School Of Computing and Information Systems
We analyze the dynamics of the behavior known as 'unfollow' in Twitter. We collected daily snapshots of the online relationships of 1.2 million Korean-speaking users for 51 days as well as all of their tweets. We found that Twitter users frequently unfollow. We then discover the major factors, including the reciprocity of the relationships, the duration of a relationship, the followees' informativeness, and the overlap of the relationships, which affect the decision to unfollow. We conduct interview with 22 Korean respondents to supplement the quantitative results.They unfollowed those who left many tweets within a short time, created tweets about uninteresting …
Design And Performance Analysis Of Mac Schemes For Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah
Design And Performance Analysis Of Mac Schemes For Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah
Research Collection School Of Computing and Information Systems
Energy consumption is a perennial issue in the design of wireless sensor networks (WSNs) which typically rely on portable sources like batteries for power. Recent advances in ambient energy harvesting technology have made it a potential and promising alternative source of energy for powering WSNs. By using energy harvesters with supercapacitors, WSNs are able to operate perpetually until hardware failure and in places where batteries are hard or impossible to replace. In this paper, we study the performance of different medium access control (MAC) schemes based on CSMA and polling techniques for WSNs which are solely powered by ambient energy …
Configuring Global Software Teams: A Multi-Company Analysis Of Productivity, Quality, And Profits, Narayanasamy Ramasubbu, Marcelo Cataldo, Rajesh Krishna Balan, James Herbsleb
Configuring Global Software Teams: A Multi-Company Analysis Of Productivity, Quality, And Profits, Narayanasamy Ramasubbu, Marcelo Cataldo, Rajesh Krishna Balan, James Herbsleb
Research Collection School Of Computing and Information Systems
In this paper, we examined the impact of project-level configurational choices of globally distributed software teams on project productivity, quality, and profits. Our analysis used data from 362 projects of four different firms. These projects spanned a wide range of programming languages, application domain, process choices, and development sites spread over 15 countries and 5 continents. Our analysis revealed fundamental tradeoffs in choosing configurational choices that are optimized for productivity, quality, and/or profits. In particular, achieving higher levels of productivity and quality require diametrically opposed configurational choices. In addition, creating imbalances in the expertise and personnel distribution of project teams …
Continuous Nearest Neighbor Search In The Presence Of Obstacles, Yunjun Gao, Baihua Zheng, Gang Chen, Chun Chen, Qing Li
Continuous Nearest Neighbor Search In The Presence Of Obstacles, Yunjun Gao, Baihua Zheng, Gang Chen, Chun Chen, Qing Li
Research Collection School Of Computing and Information Systems
Despite the ubiquity of physical obstacles (e.g., buildings, hills, and blindages, etc.) in the real world, most of spatial queries ignore the obstacles. In this article, we study a novel form of continuous nearest-neighbor queries in the presence of obstacles, namely continuous obstructed nearest-neighbor (CONN) search, which considers the impact of obstacles on the distance between objects. Given a data setP, an obstacle set O, and a query line segment q, in a two-dimensional space, a CONN query retrieves the nearest neighbor p ∈ P of each point p′ on q according to the obstructed distance, the shortest path between …
Prototyping Video Games With Animation, Richard C. Davis
Prototyping Video Games With Animation, Richard C. Davis
Research Collection School Of Computing and Information Systems
This paper outlines a proposed design for StorySketch, a new video game storyboarding system. StorySketch borrows ideas from the K-Sketch animation sketching system, which allows short animations to be created in minutes or seconds. We build on K-Sketch in four ways. key frame animation capabilities, a branching timeline view, microphone and web-cam support, and hooks to connect to online game design documents.
Distributed Model Shaping For Scaling To Decentralized Pomdps With Hundreds Of Agents, Prasanna Velagapudi, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Distributed Model Shaping For Scaling To Decentralized Pomdps With Hundreds Of Agents, Prasanna Velagapudi, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Research Collection School Of Computing and Information Systems
The use of distributed POMDPs for cooperative teams has been severely limited by the incredibly large joint policy- space that results from combining the policy-spaces of the individual agents. However, much of the computational cost of exploring the entire joint policy space can be avoided by observing that in many domains important interactions between agents occur in a relatively small set of scenarios, previously defined as coordination locales (CLs) [11]. Moreover, even when numerous interactions might occur, given a set of individual policies there are relatively few actual interactions. Exploiting this observation and building on an existing model shaping algorithm, …
Decentralized Decision Support For An Agent Population In Dynamic And Uncertain Domains, Pradeep Reddy Varakantham, Shih-Fen Cheng, Thi Duong Nguyen
Decentralized Decision Support For An Agent Population In Dynamic And Uncertain Domains, Pradeep Reddy Varakantham, Shih-Fen Cheng, Thi Duong Nguyen
Research Collection School Of Computing and Information Systems
This research is motivated by problems in urban transportation and labor mobility, where the agent flow is dynamic, non-deterministic and on a large scale. In such domains, even though the individual agents do not have an identity of their own and do not explicitly impact other agents, they have implicit interactions with other agents. While there has been much research in handling such implicit effects, it has primarily assumed controlled movements of agents in static environments. We address the issue of decision support for individual agents having involuntary movements in dynamic environments . For instance, in a taxi fleet serving …
Sandcanvas: A Multi-Touch Art Medium Inspired By Sand Animation, Rubaiat Habib Kazi, Kien-Chuan Chua, Shengdong Zhao, Richard Christopher Davis, Kok-Lim Low
Sandcanvas: A Multi-Touch Art Medium Inspired By Sand Animation, Rubaiat Habib Kazi, Kien-Chuan Chua, Shengdong Zhao, Richard Christopher Davis, Kok-Lim Low
Research Collection School Of Computing and Information Systems
Sand animation is a performance art technique in which an artist tells stories by creating animated images with sand. Inspired by this medium, we have developed a new multitouch digital artistic medium named SandCanvas that simplifies the creation of sand animations. SandCanvas also goes beyond traditional sand animation with tools for mixing sand animation with video and replicating recorded free-form hand gestures. In this paper, we analyze common sand animation hand gestures, present SandCanvas’s intuitive UI, and describe implementation challenges we encountered. We also present an evaluation with professional and novice artists that shows the importance and unique affordances of …
Leveraging Complex Event Processing For Smart Hospitals Using Rfid, Wen Yao, Chao-Hsien Chu, Zang Li
Leveraging Complex Event Processing For Smart Hospitals Using Rfid, Wen Yao, Chao-Hsien Chu, Zang Li
Research Collection School Of Computing and Information Systems
RFID technology has been examined in healthcare to support a variety of applications such as patient identification and monitoring, asset tracking, and patient–drug compliance. However, managing the large volume of RFID data and understanding them in the medical context present new challenges. One effective solution for dealing with these challenges is complex event processing (CEP), which can extract meaningful events for context-aware applications. In this paper, we propose a CEP framework to model surgical events and critical situations in an RFID-enabled hospital. We have implemented a prototype system with the proposed approach for surgical management and conducted performance evaluations to …
A Simple Curious Agent To Help People Be Curious, Han Yu, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan
A Simple Curious Agent To Help People Be Curious, Han Yu, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Curiosity is an innately rewarding state of mind that, over the millennia, has driven the human race to explore and discover. Many researches in pedagogical science have confirmed the importance of being curious to the students' cognitive development. However, in the newly popular virtual world-based learning environments (VLEs), there is currently a lack of attention being paid to enhancing the learning experience by stimulating the learners' curiosity. In this paper, we propose a simple model for curious agents (CAs) which can be used to stimulate learners' curiosity in VLEs. Potential future research directions will be discussed.
Sandcanvas: New Possibilities In Sand Animation, Rubaiat Habib Kazi, Kien-Chuan Chua, Shengdong Zhao, Richard Christopher Davis, Kok-Lim Low
Sandcanvas: New Possibilities In Sand Animation, Rubaiat Habib Kazi, Kien-Chuan Chua, Shengdong Zhao, Richard Christopher Davis, Kok-Lim Low
Research Collection School Of Computing and Information Systems
Sand animation is a performance art technique in which an artist tells stories by creating animated images with sand. This video demonstrates the creative possibilities of SandCanvas, a new multi-touch digital artistic medium inspired by sand animation that simplifies the creation of sand animations. SandCanvas’s color and texture features enable faster, more dramatic transitions, while its mixed media and gesture recording features make it possible to create entirely new experiences. Session recording and frame capture complement these capabilities by simplifying postproduction of sand animation performances.
How Do Programmers Ask And Answer Questions On The Web? (Nier Track), Christoph Treude, Ohad Barzilay, Margaret-Anne Storey
How Do Programmers Ask And Answer Questions On The Web? (Nier Track), Christoph Treude, Ohad Barzilay, Margaret-Anne Storey
Research Collection School Of Computing and Information Systems
Question and Answer (Q&A) websites, such as Stack Overflow, use social media to facilitate knowledge exchange between programmers and fill archives with millions of entries that contribute to the body of knowledge in software development. Understanding the role of Q&A websites in the documentation landscape will enable us to make recommendations on how individuals and companies can leverage this knowledge effectively. In this paper, we analyze data from Stack Overflow to categorize the kinds of questions that are asked, and to explore which questions are answered well and which ones remain unanswered. Our preliminary findings indicate that Q&A websites are …
Measuring Api Documentation On The Web, Chris Parnin, Christoph Treude
Measuring Api Documentation On The Web, Chris Parnin, Christoph Treude
Research Collection School Of Computing and Information Systems
Software development blogs, developer forums and Q&A websites are changing the way software is documented. With these tools, developers can create and communicate knowledge and experiences without relying on a central authority to provide official documentation. Instead, any content created by a developer is just a web search away. To understand whether documentation via social media can replace or augment more traditional forms of documentation, we study the extent to which the methods of one particular API — jQuery — are documented on the Web. We analyze 1,730 search results and show that software development blogs in particular cover 87.9% …
Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig
Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig
Research Collection School Of Computing and Information Systems
Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-space ADOPT and any-space BnB-ADOPT to find cost-minimal solutions for all DCOPs in the sequence faster than by solving each DCOP individually. This procedure allows those agents that are guaranteed to remain unaffected by a change to reuse their lower and upper …
Beespace Navigator: Exploratory Analysis Of Gene Function Using Semantic Indexing Of Biological Literature, Moushumi Sen Sarma, David Arcoleo, Radhika S. Khetani, Brant Chee, Xu Ling, Xin He, Jing Jiang, Qiaozhu Mei, Chengxiang Zhai, Bruce Schatz
Beespace Navigator: Exploratory Analysis Of Gene Function Using Semantic Indexing Of Biological Literature, Moushumi Sen Sarma, David Arcoleo, Radhika S. Khetani, Brant Chee, Xu Ling, Xin He, Jing Jiang, Qiaozhu Mei, Chengxiang Zhai, Bruce Schatz
Research Collection School Of Computing and Information Systems
With the rapid decrease in cost of genome sequencing, the classification of gene function is becoming a primary problem. Such classification has been performed by human curators who read biological literature to extract evidence. BeeSpace Navigator is a prototype software for exploratory analysis of gene function using biological literature. The software supports an automatic analogue of the curator process to extract functions, with a simple interface intended for all biologists. Since extraction is done on selected collections that are semantically indexed into conceptual spaces, the curation can be task specific. Biological literature containing references to gene lists from expression experiments …
Double Updating Online Learning, Peilin Zhao, Steven C. H. Hoi, Rong Jin
Double Updating Online Learning, Peilin Zhao, Steven C. H. Hoi, Rong Jin
Research Collection School Of Computing and Information Systems
In most kernel based online learning algorithms, when an incoming instance is misclassified, it will be added into the pool of support vectors and assigned with a weight, which often remains unchanged during the rest of the learning process. This is clearly insufficient since when a new support vector is added, we generally expect the weights of the other existing support vectors to be updated in order to reflect the influence of the added support vector. In this paper, we propose a new online learning method, termed Double Updating Online Learning, or DUOL for short, that explicitly addresses this problem. …
Interactivity-Constrained Server Provisioning In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Thang Nguyen, Suiping Zhou, Xueyan Tang, Wentong Cai, Rassul Ayani
Interactivity-Constrained Server Provisioning In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Thang Nguyen, Suiping Zhou, Xueyan Tang, Wentong Cai, Rassul Ayani
Research Collection School Of Computing and Information Systems
Maintaining interactivity is one of the key challenges in distributed virtual environments (DVE), e.g., online games, distributed simulations, etc., due to the large, heterogeneous Internet latencies; and the fact that clients in a DVE are usually geographically separated. In this paper, we consider a new problem, termed the interactivity-constrained server provisioning problem, whose goal is to minimize the number of distributed servers needed to achieve a pre-determined level of interactivity. We identify and formulate two variants of this new problem and show that they are both NP-hard via reductions to the set covering problem. We then propose several computationally efficient …
A Family Of Simple Non-Parametric Kernel Learning Algorithms From Pairwise Constraints, Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
A Family Of Simple Non-Parametric Kernel Learning Algorithms From Pairwise Constraints, Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Previous studies of Non-Parametric Kernel Learning (NPKL) usually formulate the learning task as a Semi-Definite Programming (SDP) problem that is often solved by some general purpose SDP solvers. However, for N data examples, the time complexity of NPKL using a standard interior-point SDP solver could be as high as O(N6.5), which prohibits NPKL methods applicable to real applications, even for data sets of moderate size. In this paper, we present a family of efficient NPKL algorithms, termed "SimpleNPKL", which can learn non-parametric kernels from a large set of pairwise constraints efficiently. In particular, we propose two efficient SimpleNPKL algorithms. One …
Ir-Tree: An Efficient Index For Geographic Document Search, Zhisheng Li, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee, Xufa Wang
Ir-Tree: An Efficient Index For Geographic Document Search, Zhisheng Li, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee, Dik Lun Lee, Xufa Wang
Research Collection School Of Computing and Information Systems
Given a geographic query that is composed of query keywords and a location, a geographic search engine retrieves documents that are the most textually and spatially relevant to the query keywords and the location, respectively, and ranks the retrieved documents according to their joint textual and spatial relevances to the query. The lack of an efficient index that can simultaneously handle both the textual and spatial aspects of the documents makes existing geographic search engines inefficient in answering geographic queries. In this paper, we propose an efficient index, called IR-tree, that together with a top-k document search algorithm facilitates four …
Comparing Twitter And Traditional Media Using Topic Models, Wayne Xin Zhao, Jing Jiang, Jianshu Weng, Jing He, Ee Peng Lim, Hongfei Yan, Xiaoming Li
Comparing Twitter And Traditional Media Using Topic Models, Wayne Xin Zhao, Jing Jiang, Jianshu Weng, Jing He, Ee Peng Lim, Hongfei Yan, Xiaoming Li
Research Collection School Of Computing and Information Systems
Twitter as a new form of social media can potentially contain much useful information, but content analysis on Twitter has not been well studied. In particular, it is not clear whether as an information source Twitter can be simply regarded as a faster news feed that covers mostly the same information as traditional news media. In This paper we empirically compare the content of Twitter with a traditional news medium, New York Times, using unsupervised topic modeling. We use a Twitter-LDA model to discover topics from a representative sample of the entire Twitter. We then use text mining techniques to …
Predicting Item Adoption Using Social Correlation, Freddy Chong-Tat Chua, Hady W. Lauw, Ee Peng Lim
Predicting Item Adoption Using Social Correlation, Freddy Chong-Tat Chua, Hady W. Lauw, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Users face a dazzling array of choices on the Web when it comes to choosing which product to buy, which video to watch, etc. The trend of social information processing means users increasingly rely not only on their own preferences, but also on friends when making various adoption decisions. In this paper, we investigate the effects of social correlation on users’ adoption of items. Given a user-user social graph and an item-user adoption graph, we seek to answer the following questions: 1) whether the items adopted by a user correlate to items adopted by her friends, and 2) how to …