Asia
Effective and Efficient Microprocessor Design Space Exploration Using Unlabeled Design Configurations
Guo, Qi (Institute of Computing Technology, Chinese Academy of Sciences) | Chen, Tianshi (Institute of Computing Technology, Chinese Academy of Sciences) | Chen, Yunji (Institute of Computing Technology, Chinese Academy of Sciences) | Zhou, Zhi-Hua (Nanjing University) | Hu, Weiwu (Institute of Computing Technology, Chinese Academy of Sciences) | Xu, Zhiwei (Institute of Computing Technology, Chinese Academy of Sciences)
During the design of a microprocessor, Design Space Exploration (DSE) is a critical step which determines the appropriate design configuration of the microprocessor. In the computer architecture community, supervised learning techniques have been applied to DSE to build models for predicting the qualities of design configurations. For supervised learning, however, considerable simulation costs are required for attaining the labeled design configurations. Given limited resources, it is difficult to achieve high accuracy. In this paper, inspired by recent advances in semi-supervised learning, we propose the COMT approach which can exploit unlabeled design configurations to improve the models. In addition to an improved predictive accuracy, COMT is able to guide the design of microprocessors, owing to the use of comprehensible model trees. Empirical study demonstrates that COMT significantly outperforms state-of-the-art DSE technique through reducing mean squared error by 30% to 84%, and thus, promising architectures can be attained more efficiently.
Constraint Optimization Approach to Context Based Word Selection
Matsuno, Jun (Kyoto University) | Ishida, Toru (Kyoto University)
Consistent word selection in machine translation is currently realized by resolving word sense ambiguity through the context of a single sentence or neighboring sentences. However, consistent word selection over the whole article has yet to be achieved. Consistency over the whole article is extremely important when applying machine translation to collectively developed documents like Wikipedia. In this paper, we propose to consider constraints between words in the whole article based on their semantic relatedness and contextual distance. The proposed method is successfully implemented in both statistical and rule-based translators. We evaluate those systems by translating 100 articles in the English Wikipedia into Japanese. The results show that the ratio of appropriate word selection for common nouns increased to around 75% with our method, while it was around 55% without our method.
Online Planning for Ad Hoc Autonomous Agent Teams
Wu, Feng (University of Science and Technology of China) | Zilberstein, Shlomo (University of Massachusetts Amherst) | Chen, Xiaoping (University of Science and Technology of China)
We propose a novel online planning algorithm for ad hoc team settings — challenging situations in which an agent must collaborate with unknown teammates without prior coordination. Our approach is based on constructing and solving a series of stage games, and then using biased adaptive play to choose actions. The utility function in each stage game is estimated via Monte-Carlo tree search using the UCT algorithm. We establish analytically the convergence of the algorithm and show that it performs well in a variety of ad hoc team domains.
Efficient Searching Top-k Semantic Similar Words
Yang, Zhenglu (The University of Tokyo) | Kitsuregawa, Masaru (The University of Tokyo)
Measuring the semantic meaning between words is an important issue because it is the basis for many applications, such as word sense disambiguation, document summarization, and so forth. Although it has been explored for several decades, most of the studies focus on improving the effectiveness of the problem, i.e., precision and recall. In this paper, we propose to address the efficiency issue, that given a collection of words, how to efficiently discover the top-k most semantic similar words to the query. This issue is very important for real applications yet the existing state-of-the-art strategies cannot satisfy users with reasonable performance. Efficient strategies on searching top-k semantic similar words are proposed. We provide an extensive comparative experimental evaluation demonstrating the advantages of the introduced strategies over the state-of-the-art approaches.
An Ontology-driven Framework for Supporting Complex Decision Process
The study proposes a framework of ONTOlogy-based Group Decision Support System (ONTOGDSS) for decision process which exhibits the complex structure of decision-problem and decision-group. It is capable of reducing the complexity of problem structure and group relations. The system allows decision makers to participate in group decision-making through the web environment, via the ontology relation. It facilitates the management of decision process as a whole, from criteria generation, alternative evaluation, and opinion interaction to decision aggregation. The embedded ontology structure in ONTOGDSS provides the important formal description features to facilitate decision analysis and verification. It examines the software architecture, the selection methods, the decision path, etc. Finally, the ontology application of this system is illustrated with specific real case to demonstrate its potentials towards decision-making development.
Exploring Millions of Footprints in Location Sharing Services
Cheng, Zhiyuan (Texas A&M University) | Caverlee, James (Texas A&M University) | Lee, Kyumin (Texas A&M University) | Sui, Daniel Z. (Ohio State University)
Location sharing services (LSS) like Foursquare, Gowalla, and Facebook Places support hundreds of millions of user-driven footprints (i.e., "checkins"). Those global-scale footprints provide a unique opportunity to study the social and temporal characteristics of how people use these services and to model patterns of human mobility, which are significant factors for the design of future mobile+location-based services, traffic forecasting, urban planning, as well as epidemiological models of disease spread. In this paper, we investigate 22 million checkins across 220,000 users and report a quantitative assessment of human mobility patterns by analyzing the spatial, temporal, social, and textual aspects associated with these footprints. We find that: (i) LSS users follow the “Levy Flight” mobility pattern and adopt periodic behaviors; (ii) While geographic and economic constraints affect mobility patterns, so does individual social status; and (iii) Content and sentiment-based analysis of posts associated with checkins can provide a rich source of context for better understanding how users engage with these services.
Exploiting User Interest on Social Media for Aggregating Diverse Data and Predicting Interest
Nori, Nozomi (The University of Tokyo) | Bollegala, Danushka (The University of Tokyo) | Ishizuka, Mitsuru (The University of Tokyo)
More and more users have been taking various actions to diverse resources referred to by URLs such as news, web pages, images, products, movies as a result of the growth of social media. They are annotating, tweeting in Twitter, reblogging in Tumblr, and Liking in Facebook, etc. Analyses about these diverse actions will be useful for aggregating or integrating diverse resources. In this paper, we view users’ actions to resources as expressing their some interests, and by investigating how their interests are expressed in social media, we get suggestions for aggregations. Our results show that a certain kind of action (such as tagging on Delicious) can be used to make predictions on a different kind of action (such as favorite on Twitter). These analyses will be useful for aggregating or integrating diverse contents on multiple sources. In addition to some experimental analyses, we propose a novel method to predict users’ interests in social media, using time-evolving, multinomial relational data. Our experimental results show that the proposed method significantly outperforms standard tensor analysis and an existing state-of-the-art method (LDA) in prediction tasks.
Culture Matters: A Survey Study of Social Q&A Behavior
Yang, Jiang (University of Michigan) | Morris, Meredith Ringel (Microsoft Research) | Teevan, Jaime (Microsoft Research) | Adamic, Lada A. (University of Michigan) | Ackerman, Mark S. (University of Michigan)
Online social networking tools are used around the world by people to ask questions of their friends, because friends provide direct, reliable, contextualized, and interactive responses. However, although the tools used in different cultures for question asking are often very similar, the way they are used can be very different, reflecting unique inherent cultural characteristics. We present the results of a survey designed to elicit cultural differences in people’s social question asking behaviors across the United States, the United Kingdom, China, and India. The survey received responses from 933 people distributed across the four countries who held similar job roles and were employed by a single organization. Responses included information about the questions they ask via social networking tools, and their motivations for asking and answering questions online. The results reveal culture as a consistently significant factor in predicting people’s social question and answer behavior. The prominent cultural differences we observe might be traced to people’s inherent cultural characteristics (e.g., their cognitive patterns and social orientation), and should be comprehensively considered in designing social search systems.
Modelling Action Cascades in Social Networks
Dave, Kushal Shailesh (International Institute of Information Technology) | Bhatt, Rushi (Yahoo!) | Varma, Vasudeva (International Institute of Information Technology)
The central idea in designing various marketing strategies for online social networks is to identify the influencers in the network. The influential individuals induce ``word-of-mouth" effects in the network. These individuals are responsible for triggering long cascades of influence that convince their peers to perform a similar action (buying a product, for instance). Targeting these influentials usually leads to a vast spread of the information across the network. Hence it is important to identify such individuals in a network. One way to measure an individual's influencing capability on its peers is by its reach for a certain action. We formulate identifying the influencers in a network as a problem of predicting the average depth of cascades an individual can trigger. We first empirically identify factors that play crucial role in triggering long cascades. Based on the analysis, we build a model for predicting the cascades triggered by a user for an action. The model uses features like influencing capabilities of the user and their friends, influencing capabilities of the particular action and other user and network characteristics. Experiments show that the model effectively improves the predictions over several baselines.
Participation Maximization Based on Social Influence in Online Discussion Forums
Sun, Tao (Peking University and Microsoft Research Asia) | Chen, Wei (Microsoft Research Asia) | Liu, Zhenming (Harvard School of Engineering and Applied Sciences and Microsoft Research Asia) | Wang, Yajun (Microsoft Research Asia) | Sun, Xiaorui (Shanghai Jiaotong University and Microsoft Research Asia) | Zhang, Ming (Peking University) | Lin, Chin-Yew (Microsoft Research Asia)
In online discussion forums, users are more motivated to take part in discussions when observing other users’ participation—the effect of social influence among forum users. In this paper, we study how to utilize social influence for increasing the overall forum participation. To this end, we propose a mechanism to maximize user influence and boost participation by displaying forum threads to users. We formally define the participation maximization problem, and show that it is a special instance of the social welfare maximization problem with submodular utility functions and it is NP-hard. However, generic approximation algorithms is impracticable for real-world forums due to time complexity. Thus we design a heuristic algorithm, named Thread Allocation Based on Influence (TABI), to tackle the problem. Through extensive experiments using a dataset from a real-world online forum, we demonstrate that TABI consistently outperforms all other algorithms in maximizing participation. The results of this work demonstrates that current recommender systems can be made more effective by considering future influence propagations. The problem of participation maximization based on influence also opens a new direction in the study of social influence.