Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Mining divergent opinion trust networks through latent dirichlet allocation
KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.ORCID-id: 0000-0002-4722-0823
2012 (engelsk)Inngår i: 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, IEEE , 2012, s. 879-886Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

While the focus of trust research has been mainly on defining and modeling various notions of social trust, less attention has been given to modeling opinion trust. When speaking of social trust mainly homophily (similarity) has been the most successful metric for learning trustworthy links, specially in social web applications such as collaborative filtering recommendation systems. While pure homophily such as Pearson coefficient correlation and its variations, have been favorable to finding taste distances between individuals based on their rated items, they are not necessarily useful in finding opinion distances between individuals discussing a trending topic, e. g. Arab spring. At the same time text mining techniques, such as vector-based techniques, are not capable of capturing important factors such as saliency or polarity which are possible with topical models for detecting, analyzing and suggesting aspects of people mentioning those tags or topics. Thus, in this paper we are proposing to model opinion distances using probabilistic information divergence as a metric for measuring the distances between people's opinion contributing to a discussion in a social network. To acquire feature sets from topics discussed in a discussion we use a very successful topic modeling technique, namely Latent Dirichlet Allocation (LDA). We use the distributions resulting to model topics for generating social networks of group and individual users. Using a Twitter dataset we show that learned graphs exhibit properties of real-world like networks.

sted, utgiver, år, opplag, sider
IEEE , 2012. s. 879-886
Emneord [en]
Computational modeling, Analytical models, Twitter, Measurement, Probabilistic logic, Biological system modeling, twitter, trust network, topic models, LDA, opinion mining
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-118484DOI: 10.1109/ASONAM.2012.158ISI: 000320443500142Scopus ID: 2-s2.0-84874276274ISBN: 978-1-4673-2497-7 (tryckt)OAI: oai:DiVA.org:kth-118484DiVA, id: diva2:606481
Konferanse
2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012; Istanbul; Turkey; 26 August 2012 through 29 August 2012
Merknad

QC 20130220

Tilgjengelig fra: 2013-02-19 Laget: 2013-02-19 Sist oppdatert: 2018-01-11bibliografisk kontrollert
Inngår i avhandling
1. Trust-Based User Profiling
Åpne denne publikasjonen i ny fane eller vindu >>Trust-Based User Profiling
2013 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

We have introduced the notion of user profiling with trust, as a solution to theproblem of uncertainty and unmanageable exposure of personal data duringaccess, retrieval and consumption by web applications. Our solution sug-gests explicit modeling of trust and embedding trust metrics and mechanismswithin very fabric of user profiles. This has in turn allowed information sys-tems to consume and understand this extra knowledge in order to improveinteraction and collaboration among individuals and system. When formaliz-ing such profiles, another challenge is to realize increasingly important notionof privacy preferences of users. Thus, the profiles are designed in a way toincorporate preferences of users allowing target systems to understand pri-vacy concerns of users during their interaction. A majority of contributionsof this work had impact on profiling and recommendation in digital librariescontext, and was implemented in the framework of EU FP7 Smartmuseumproject. Highlighted results start from modeling of adaptive user profilesincorporating users taste, trust and privacy preferences. This in turn led toproposal of several ontologies for user and content characteristics modeling forimproving indexing and retrieval of user content and profiles across the plat-form. Sparsity and uncertainty of profiles were studied through frameworksof data mining and machine learning of profile data taken from on-line so-cial networks. Results of mining and population of data from social networksalong with profile data increased the accuracy of intelligent suggestions madeby system to improving navigation of users in on-line and off-line museum in-terfaces. We also introduced several trust-based recommendation techniquesand frameworks capable of mining implicit and explicit trust across ratingsnetworks taken from social and opinion web. Resulting recommendation al-gorithms have shown to increase accuracy of profiles, through incorporationof knowledge of items and users and diffusing them along the trust networks.At the same time focusing on automated distributed management of profiles,we showed that coverage of system can be increased effectively, surpassingcomparable state of art techniques. We have clearly shown that trust clearlyelevates accuracy of suggestions predicted by system. To assure overall pri-vacy of such value-laden systems, privacy was given a direct focus when archi-tectures and metrics were proposed and shown that a joint optimal setting foraccuracy and perturbation techniques can maintain accurate output. Finally,focusing on hybrid models of web data and recommendations motivated usto study impact of trust in the context of topic-driven recommendation insocial and opinion media, which in turn helped us to show that leveragingcontent-driven and tie-strength networks can improve systems accuracy forseveral important web computing tasks.

sted, utgiver, år, opplag, sider
Stockholm: KTH Royal Institute of Technology, 2013. s. xi, 48
Serie
TRITA-ICT-ECS AVH, ISSN 1653-6363 ; 13:10
Emneord
trust, userprofiling, userprofiles, privacy, interest, socialnetwork, recommendersystems
HSV kategori
Identifikatorer
urn:nbn:se:kth:diva-118488 (URN)978-91-7501-651-1 (ISBN)
Disputas
2013-03-08, C1 Sal, Electrum, ICT/KTH, Isafjordsgatan 20, Kista, 13:00 (engelsk)
Opponent
Veileder
Merknad

QC 20130219

Tilgjengelig fra: 2013-02-19 Laget: 2013-02-19 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Matskin, Mihhail

Søk i DiVA

Av forfatter/redaktør
Dokoohaki, NimaMatskin, Mihhail
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 184 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf