Skip to main content

2010 | OriginalPaper | Buchkapitel

3. Analysis of Social Networks by Tensor Decomposition

verfasst von : Sergej Sizov, Steffen Staab, Thomas Franz

Erschienen in: Handbook of Social Network Technologies and Applications

Verlag: Springer US

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The Social Web fosters novel applications targeting a more efficient and satisfying user guidance in modern social networks, e.g., for identifying thematically focused communities, or finding users with similar interests. Large scale and high diversity of users in social networks poses the challenging question of appropriate relevance/authority ranking, for producing fine-grained and rich descriptions of available partners, e.g., to guide the user along most promising groups of interest. Existing methods for graph-based authority ranking lack support for fine-grained latent coherence between user relations and content (i.e., support for edge semantics in graph-based social network models). We present TweetRank, a novel approach for faceted authority ranking in the context of social networks. TweetRank captures the additional latent semantics of social networks by means of statistical methods in order to produce richer descriptions of user relations. We model the social network by a 3-dimensional tensor that enables the seamless representation of arbitrary semantic relations. For the analysis of that model, we apply the PARAFAC decomposition, which can be seen as a multi-modal counterpart to common Web authority ranking with HITS. The result are groupings of users and terms, characterized by authority and navigational (hub) scores with respect to the identified latent topics. Sample experiments with life data of the Twitter community demonstrate the ability of TweetRank to produce richer and more comprehensive contact recommendations than other existing methods for social authority ranking.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Throughout this chapter we use the common Matlab-notation for addressing entries in tensors and vectors.
 
2
The framework implementation is available as public domain open source package: http://​west.​uni-koblenz.​de/​Research.
 
Literatur
1.
Zurück zum Zitat Boanerges Aleman-Meza, Christian Halaschek-Wiener, Ismailcem B. Arpinar, Cartic Ramakrishnan, and Amit P. Sheth. Ranking complex relationships on the semantic web. IEEE Internet Computing, 9(3):37–44, 2005CrossRef Boanerges Aleman-Meza, Christian Halaschek-Wiener, Ismailcem B. Arpinar, Cartic Ramakrishnan, and Amit P. Sheth. Ranking complex relationships on the semantic web. IEEE Internet Computing, 9(3):37–44, 2005CrossRef
2.
Zurück zum Zitat Claus A. Andersson and Rasmus Bro. The n-way toolbox for matlab. Chemometrics and Intelligent Laboratory Systems, 52(1):1–4, 2000CrossRef Claus A. Andersson and Rasmus Bro. The n-way toolbox for matlab. Chemometrics and Intelligent Laboratory Systems, 52(1):1–4, 2000CrossRef
3.
Zurück zum Zitat Kemafor Anyanwu and Amit P. Sheth. The p operator: Discovering and ranking associations on the semantic web. SIGMOD Record, 31(4):42–47, 2002CrossRef Kemafor Anyanwu and Amit P. Sheth. The p operator: Discovering and ranking associations on the semantic web. SIGMOD Record, 31(4):42–47, 2002CrossRef
4.
Zurück zum Zitat Brett W. Bader and Tamara G. Kolda. Algorithm 862: MATLAB tensor classes for fast algorithm prototyping. ACM Transactions on Mathematical Software, 32(4):635–653, 2006MathSciNetCrossRefMATH Brett W. Bader and Tamara G. Kolda. Algorithm 862: MATLAB tensor classes for fast algorithm prototyping. ACM Transactions on Mathematical Software, 32(4):635–653, 2006MathSciNetCrossRefMATH
5.
Zurück zum Zitat Andrey Balmin, Vagelis Hristidis, and Yannis Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564–575, 2004 Andrey Balmin, Vagelis Hristidis, and Yannis Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564–575, 2004
6.
Zurück zum Zitat Krishna Bharat and Monika Rauch Henzinger. Improved Algorithms for Topic Distillation in a Hyperlinked Environment. In 21st Annual International ACM SIGIR Conference, Melbourne, Australia, pages 104–111, 1998 Krishna Bharat and Monika Rauch Henzinger. Improved Algorithms for Topic Distillation in a Hyperlinked Environment. In 21st Annual International ACM SIGIR Conference, Melbourne, Australia, pages 104–111, 1998
7.
Zurück zum Zitat S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Seventh International World-Wide Web Conference (WWW 1998), 1998 S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Seventh International World-Wide Web Conference (WWW 1998), 1998
8.
Zurück zum Zitat Paul Alexandru Chirita, Stefania Ghita, Wolfgang Nejdl, and Raluca Paiu. Beagle\(++\) : Semantically enhanced searching and ranking on the desktop. In ESWC, 2006 Paul Alexandru Chirita, Stefania Ghita, Wolfgang Nejdl, and Raluca Paiu. Beagle\(++\) : Semantically enhanced searching and ranking on the desktop. In ESWC, 2006
9.
Zurück zum Zitat David A. Cohn and Thomas Hofmann. The missing link – a probabilistic model of document content and hypertext connectivity. In 13th Conference on Advances in Neural Information Processing Systems (NIPS), Denver, USA, pages 430–436, 2000 David A. Cohn and Thomas Hofmann. The missing link – a probabilistic model of document content and hypertext connectivity. In 13th Conference on Advances in Neural Information Processing Systems (NIPS), Denver, USA, pages 430–436, 2000
10.
Zurück zum Zitat Klaas Dellschaft and Steffen Staab. An epistemic dynamic model for tagging systems. In 19th ACM Conference on Hypertext and Hypermedia (Hypertext 2008), Pittsburgh, USA, pages 71–80, 2008 Klaas Dellschaft and Steffen Staab. An epistemic dynamic model for tagging systems. In 19th ACM Conference on Hypertext and Hypermedia (Hypertext 2008), Pittsburgh, USA, pages 71–80, 2008
11.
Zurück zum Zitat Michelangelo Diligenti, Marco Gori, and Marco Maggini. Web Page Scoring Systems for Horizontal and Vertical Search. In 11th International World Wide Web Conference (WWW), Honolulu, USA, pages 508–516, 2002 Michelangelo Diligenti, Marco Gori, and Marco Maggini. Web Page Scoring Systems for Horizontal and Vertical Search. In 11th International World Wide Web Conference (WWW), Honolulu, USA, pages 508–516, 2002
12.
Zurück zum Zitat Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, and Horst D. Simon. PageRank, HITS and a Unified Framework for Link Analysis. In 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Tampere, Finland, pages 353–354, 2002 Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, and Horst D. Simon. PageRank, HITS and a Unified Framework for Link Analysis. In 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Tampere, Finland, pages 353–354, 2002
13.
Zurück zum Zitat Magdalini Eirinaki and Michalis Vazirgiannis. Usage-based pagerank for web personalization. Data Mining, IEEE International Conference on, pages 130–137, 2005 Magdalini Eirinaki and Michalis Vazirgiannis. Usage-based pagerank for web personalization. Data Mining, IEEE International Conference on, pages 130–137, 2005
14.
Zurück zum Zitat Richard A. Harshman and Margaret E. Lundy. Parafac: Parallel factor analysis. Computational Statistics and Data Analysis, 18(1):39–72, 1994CrossRefMATH Richard A. Harshman and Margaret E. Lundy. Parafac: Parallel factor analysis. Computational Statistics and Data Analysis, 18(1):39–72, 1994CrossRefMATH
15.
Zurück zum Zitat Taher H. Haveliwala. Topic-sensitive PageRank. In 11th International World Wide Web Conference (WWW), Honolulu, USA, pages 517–526, 2002 Taher H. Haveliwala. Topic-sensitive PageRank. In 11th International World Wide Web Conference (WWW), Honolulu, USA, pages 517–526, 2002
16.
Zurück zum Zitat Glen Jeh and Jennifer Widom. Scaling Personalized Web Search. In 12th International World Wide Web Conference (WWW), Budapest, Hungary, pages 271–279, 2003 Glen Jeh and Jennifer Widom. Scaling Personalized Web Search. In 12th International World Wide Web Conference (WWW), Budapest, Hungary, pages 271–279, 2003
17.
Zurück zum Zitat Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604–632, 1999 Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604–632, 1999
18.
Zurück zum Zitat Tamara G. Kolda and Brett W. Bader. Tensor decompositions and applications. SIAM Review, 51(3), 2009 (to appear) Tamara G. Kolda and Brett W. Bader. Tensor decompositions and applications. SIAM Review, 51(3), 2009 (to appear)
19.
Zurück zum Zitat Tamara G. Kolda, Brett W. Bader, and Joseph P. Kenny. Higher-Order Web Link Analysis Using Multilinear Algebra. In 5th IEEE International Conference on Data Mining (ICDM), Houston, USA, pages 242–249, 2005 Tamara G. Kolda, Brett W. Bader, and Joseph P. Kenny. Higher-Order Web Link Analysis Using Multilinear Algebra. In 5th IEEE International Conference on Data Mining (ICDM), Houston, USA, pages 242–249, 2005
20.
Zurück zum Zitat Ronny Lempel and Shlomo Moran. SALSA: the Stochastic Approach for Link-Structure Analysis. ACM Transactions on Information Systems (TOIS), 19(2):131–160, 2001CrossRef Ronny Lempel and Shlomo Moran. SALSA: the Stochastic Approach for Link-Structure Analysis. ACM Transactions on Information Systems (TOIS), 19(2):131–160, 2001CrossRef
21.
Zurück zum Zitat Yu-Ting Liu, Bin Gao, Tie-Yan Liu, Ying Zhang, Zhiming Ma, Shuyuan He, and Hang Li. Browserank: letting web users vote for page importance. In SIGIR, pages 451–458, 2008 Yu-Ting Liu, Bin Gao, Tie-Yan Liu, Ying Zhang, Zhiming Ma, Shuyuan He, and Hang Li. Browserank: letting web users vote for page importance. In SIGIR, pages 451–458, 2008
22.
Zurück zum Zitat Davood Rafiei and Alberto O. Mendelzon. What is this Page known for? Computing Web Page Reputations. Computer Networks, 33(1–6):823–835, 2000CrossRef Davood Rafiei and Alberto O. Mendelzon. What is this Page known for? Computing Web Page Reputations. Computer Networks, 33(1–6):823–835, 2000CrossRef
23.
Zurück zum Zitat Cartic Ramakrishnan, William H. Milnor, Matthew Perry, and Amit P. Sheth. Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explor. Newsl., 7(2):56–63, 2005 Cartic Ramakrishnan, William H. Milnor, Matthew Perry, and Amit P. Sheth. Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explor. Newsl., 7(2):56–63, 2005
24.
Zurück zum Zitat Matthew Richardson and Pedro Domingos. The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank. In 14th Conference on Advances in Neural Information Processing Systems (NIPS), Vancouver, Canada, pages 1441–1448, 2001 Matthew Richardson and Pedro Domingos. The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank. In 14th Conference on Advances in Neural Information Processing Systems (NIPS), Vancouver, Canada, pages 1441–1448, 2001
Metadaten
Titel
Analysis of Social Networks by Tensor Decomposition
verfasst von
Sergej Sizov
Steffen Staab
Thomas Franz
Copyright-Jahr
2010
Verlag
Springer US
DOI
https://doi.org/10.1007/978-1-4419-7142-5_3

Premium Partner