Jun-Ming Chen, Ying-Ying Chen, Yeali S. Sun, Meng Chang Chen
{"title":"A Novel Approach for Developing Automatic Knowledge Construction and Diagnostic System for Tag-Based Learning Environment","authors":"Jun-Ming Chen, Ying-Ying Chen, Yeali S. Sun, Meng Chang Chen","doi":"10.1109/ASONAM.2011.31","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.31","url":null,"abstract":"With the advent of Web 2.0 technology, researchers have attempted to use Web 2.0 tools to develop adaptive and cooperative learning environments. However, in building learning and teaching diagnostic system, one of the major difficulties is the lack of prior knowledge to help learners read and understand what they read in articles. Moreover, because of the lack of a mechanism to assist teachers in monitoring the running activities and student progress, such that constructive suggestions can be given to the students and tutoring strategies can be improved accordingly. Therefore, this paper presents a framework for calculating semantically meaningful prior knowledge and generating spreading energy for discovering student¡¦s reading status in semantic networks using a modified version of Semantic Analysis and Social Network techniques. An application to the development of a Tag-based Collaborative reading learning system is very useful for teachers and students.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"249 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115861941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluating Cooperation in Communities with the k-Core Structure","authors":"C. Giatsidis, D. Thilikos, M. Vazirgiannis","doi":"10.1109/ASONAM.2011.65","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.65","url":null,"abstract":"Community sub graphs are characterized by dense connections or interactions among its nodes. Community detection and evaluation is an important task in graph mining. A variety of measures have been proposed to evaluate the quality of such communities. In this paper, we evaluate communities based on the k-core concept, as means of evaluating their collaborative nature - a property not captured by the single node metrics or by the established community evaluation metrics. Based on the k-core, which essentially measures the robustness of a community under degeneracy, we extend it to weighted graphs, devising a novel concept of k-cores on weighted graphs. We applied the k-core approach on large real world graphs -- such as DBLP and report interesting results.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130453605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extracting Social Networks to Understand Interaction","authors":"M. Forestier, Julien Velcin, D. Zighed","doi":"10.1109/ASONAM.2011.64","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.64","url":null,"abstract":"Web forums are a huge data source. They allow people to interact with unknown individuals. Studying forums shows that the interaction is not obvious only through the structure but also through the content of the post. Taking into account this observation, we extract a social network with different kinds of relationships i.e. the structural relation, the name and the text quotations relation. We present here the promising results we obtain, and the difficulties we face while extracting the quotations in this kind of textual content. These results are obtained from real data (from two information websites) which make the validation difficult. So, we create a validation protocol composed of two steps and based on human raters. Finally, we will see the objective of this work which is understanding interactions in order to extract the social roles of individuals.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131560776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Recommendation Method for Online Dating Networks Based on Social Relations and Demographic Information","authors":"Lin Chen, R. Nayak, Yue Xu","doi":"10.1109/ASONAM.2011.66","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.66","url":null,"abstract":"A new relationship type of social networks - online dating - are gaining popularity. With a large member base, users of a dating network are overloaded with choices about their ideal partners. Recommendation methods can be utilized to overcome this problem. However, traditional recommendation methods do not work effectively for online dating networks where the dataset is sparse and large, and a two-way matching is required. This paper applies social networking concepts to solve the problem of developing a recommendation method for online dating networks. We propose a method by using clustering, SimRank and adapted SimRank algorithms to recommend matching candidates. Empirical results show that the proposed method can achieve nearly double the performance of the traditional collaborative filtering and common neighbor methods of recommendation.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131131244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Aarthi, S. Bharanidharan, M. Saravanan, V. Anand
{"title":"Predicting Customer Demographics in a Mobile Social Network","authors":"S. Aarthi, S. Bharanidharan, M. Saravanan, V. Anand","doi":"10.1109/ASONAM.2011.13","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.13","url":null,"abstract":"A network made of individuals connected based on their communication behaviour using mobile phones can be called as a Mobile Social Network. Mapping and measuring of interactions and flows between people across mobile social networks are being performed extensively in an attempt to understand the intriguing patterns of human behaviour. Such analyses can help in arriving at useful inferences for improving the accuracy of 'Targeted Advertisements'.This paper makes one such attempt to extract the demographics (i.e. age, gender and economic status) of a person based on his/her connectivity in his/her respective social network(s) and mobile phone usage over a period of time. The need for prediction arises from the fact that, for prepaid users, the demographics are either unavailable or inaccurate. The results produced are evaluated and standardized based on proven statistics pertaining to the nation considered. We use candlestick charts to compare the experimental results.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132930179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Matthias Broecheler, Andrea Pugliese, V. S. Subrahmanian
{"title":"Probabilistic Subgraph Matching on Huge Social Networks","authors":"Matthias Broecheler, Andrea Pugliese, V. S. Subrahmanian","doi":"10.1109/ASONAM.2011.78","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.78","url":null,"abstract":"Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the data. In this paper, we propose \"probabilistic subgraph\" (PS) queries over a graph/network database, which afford users great flexibility in specifying \"approximately\" what they are looking for. We formally define the probability that a substitution satisfies a PS-query with respect to a graph database. We then present the PMATCH algorithm to answer such queries and prove its correctness. Our experimental evaluation demonstrates that PMATCH is efficient and scales to massive social networks with over a billion edges.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127798063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Geo-Friends Recommendation in GPS-based Cyber-physical Social Network","authors":"Xiao Yu, Ang Pan, L. Tang, Z. Li, Jiawei Han","doi":"10.1109/ASONAM.2011.118","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.118","url":null,"abstract":"The popularization of GPS-enabled mobile devices provides social network researchers a taste of cyber-physical social network in advance. Traditional link prediction methods are designed to find friends solely relying on social network information. With location and trajectory data available, we can generate more accurate and geographically related results, and help web-based social service users find more friends in the real world. Aiming to recommend geographically related friends in social network, a three-step statistical recommendation approach is proposed for GPS-enabled cyber-physical social network. By combining GPS information and social network structures, we build a pattern-based heterogeneous information network. Links inside this network reflect both people's geographical information, and their social relationships. Our approach estimates link relevance and finds promising geo-friends by employing a random walk process on the heterogeneous information network. Empirical studies from both synthetic datasets and real-life dataset demonstrate the power of merging GPS data and social graph structure, and suggest our method outperforms other methods for friends recommendation in GPS-based cyber-physical social network.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115782157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Anna Zygmunt, Piotr Bródka, Przemyslaw Kazienko, J. Kozlak
{"title":"Different Approaches to Groups and Key Person Identification in Blogosphere","authors":"Anna Zygmunt, Piotr Bródka, Przemyslaw Kazienko, J. Kozlak","doi":"10.1109/ASONAM.2011.71","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.71","url":null,"abstract":"Two approaches for identifying key persons in the blogosphere-based social network are analysed in the paper: discovery of the most important individuals either in persistent or in global social communities existing on web blogs. A new method for the separation of stable groups fulfilling given conditions is presented. Additionally, a new concept for extraction of user roles and key persons in such groups is proposed. It has been compared to the general clustering method and structural node position measure applied to rank users in the time-aggregated data. Experimental, comparative studies have been conducted on real blogosphere data gathered over one year.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124248566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards Social Recommendation System Based on the Data from Microblogs","authors":"Pei-Shan Chang, I. Ting, Shyue-Liang Wang","doi":"10.1109/ASONAM.2011.101","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.101","url":null,"abstract":"With the rapid growth of Internet and social networking websites, there are various services that provided in these platforms. For instance, Face book focuses on social activities, Twitter and Plurk are both focus on the interaction of users through short messages (which are so-called microblogs). Therefore, there are more than millions of users registered in these websites and become places where full of marketing possibilities. Thus, it is an important issue to assist companies to understand the users in the social networking websites in order to enhance the accuracy and efficiency of target marketing. In this paper, we have proposed the architecture of a social recommendation system based on the data from microblogs. The social recommendation system is conducted according to the messages and social structure of target users. The similarity of the discovered features of users and products will then be calculated as the essence of the recommendation engine. A case study will be included to present how the recommendation system works based on real data that collected from Plurk.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116885714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SNAP: Towards a Validation of the Social Network Assembly Pipeline","authors":"Michael Farrugia, N. Hurley, A. Quigley","doi":"10.1109/ASONAM.2011.88","DOIUrl":"https://doi.org/10.1109/ASONAM.2011.88","url":null,"abstract":"A key problem for social network analysis is the lack of ground-truth data upon which to validate an analysis. Consider for example community-finding algorithms. The ``communities'' identified by such algorithms are typically justified on the basis of their structural properties, rather than on their ability to recover communities which can be independently verified. A ground truth of actual community data isn't always available and at best only partial ground-truth community information is. However, this problem isn't unique to community-finding algorithms. In previous publications, we introduced an automated Social Network Assembly Pipeline we refer to as SNAP. This is intended for the large scale actor identification, tie interference and strength measurement of social networks from non-relational data sets. In this paper we describe a validation study of SNAP through an intensive user-study of a portion of the individuals in the network. Individuals are asked to validate the network relationships uncovered by SNAP and where misclassified relationships are found, the individuals are interviewed in order to determine the underlying cause of the misclassification. The findings provide feedback on the rules through which relationships are inferred. For instance, it becomes clear that an error in actor identification can result in a propagation of this error though the network relations leading to follow-on relationship misclassifications. Also, we observe how outliers lead to a propagation of error in the inferred network. The results help us validate and invalidate different hypotheses we have about SNAP and suggests domain specific rule-sets for SNAP.","PeriodicalId":416479,"journal":{"name":"2011 International Conference on Advances in Social Networks Analysis and Mining","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124756923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}