Conference Paper

Ontology-Aware Classification and Association Rule Mining for Interest and Link Prediction in Social Networks.

Conference: Social Semantic Web: Where Web 2.0 Meets Web 3.0, Papers from the 2009 AAAI Spring Symposium, Technical Report SS-09-08, Stanford, California, USA, March 23-25, 2009
Source: DBLP

ABSTRACT Previous work on analysis of friendship networks has identi- fied ways in which graph features can be used for prediction of link existence and persistence, and shown that features of user pairs such as shared interests can marginally improve the precision and recall of link prediction. This marginal improvement has, to date, been severely limited by the flat representation used for interest taxonomies. We present an approach towards integration of such graph features with on- tology-enriched numerical and nominal features (based on interest hierarchies) and on itemset size-sensitive associa- tions found using interest data. A test bed previously devel- oped using the social network and weblogging service Live- Journal is extended using this integrative approach. Our re- sults show how this semantically integrative approach to link mining yields a boost in precision and recall of known friendships when applied to this test bed. We conclude with a discussion of link-dependent features and how an integra- tive constructive induction framework can be extended to incorporate temporal fluents for link prediction, interest pre- diction, and annotation in social networks.

  • [Show abstract] [Hide abstract]
    ABSTRACT: As the wide popularization of online social networks, online users are not content only with keeping online friendship with social friends in real life any more. They hope the system designers can help them exploring new friends with common interest. However, the large amount of online users and their diverse and dynamic interests possess great challenges to support such a novel feature in online social networks. In this paper, by leveraging interest-based features, we design a general friend recommendation framework, which can characterize user interest in two dimensions: context (location, time) and content, as well as combining domain knowledge to improve recommending quality. We also design a potential friend recommender system in a real online social network of biology field to show the effectiveness of our proposed framework.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The increasing availability of user-generated content coming from online communities allows the analysis of common user behaviors and trends in social network usage. This paper presents the TweM Tweet Miner framework that entails the discovery of hidden and high level correlations, in the form of generalized association rules, among the content and the contextual features of posts published on Twitter i.e., the tweets. To effectively support knowledge discovery from tweets, the TweM framework performs two main steps: i taxonomy generation over tweet keywords and context data and ii generalized association rule mining, driven by the generated taxonomy, from a sequence of tweet collections. Unlike traditional mining approaches, the generalized rule mining session performed on the current tweet collection also considers the evolution of the extracted patterns across the sequence of the previous mining sessions to prevent the discarding of rare knowledge that frequently occurs in a number of past extractions. Experiments, performed on both real Twitter posts and synthetic datasets, show the effectiveness and the efficiency of the proposed TweM framework in supporting knowledge discovery from Twitter user-generated content.
    Intelligent Data Analysis 01/2013; 17(4-4). DOI:10.3233/IDA-130597 · 0.50 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to the growing interest in social networks, link prediction has received significant attention. Link prediction is mostly based on graph-based features, with some recent approaches focusing on domain semantics. We propose algorithms for link prediction that use a probabilistic ontology to enhance the analysis of the domain and the unavoidable uncertainty in the task (the ontology is specified in the probabilistic description logic cr $\mathcal{ALC }$ ). The scalability of the approach is investigated, through a combination of semantic assumptions and graph-based features. We evaluate empirically our proposal, and compare it with standard solutions in the literature.
    Journal of the Brazilian Computer Society 11/2013; DOI:10.1007/s13173-013-0108-8

Full-text (2 Sources)

Available from
May 27, 2014