Skip to main content
Top

2017 | OriginalPaper | Chapter

Query-oriented Graph Clustering

Authors : Li-Yen Kuo, Chung-Kuang Chou, Ming-Syan Chen

Published in: Advances in Knowledge Discovery and Data Mining

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

There are many tasks including diversified ranking and social circle discovery focusing on the relationship between data as well as the relevance to the query. These applications are actually related to query-oriented clustering. In this paper, we firstly formulate the problem, query-oriented clustering, in a general form and propose the two measures, query-oriented normalized cut (QNCut) and cluster balance to evaluate the results for query-oriented clustering. We develop a model, query-oriented graph clustering (QGC), that combines QNCut and the balance constraint based on cluster balance in a quadratic form. In the experiments, we show that QGC achieves promising results on improvement in query-oriented clustering and social circle discovery.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
1.
go back to reference Carbonell, J., Goldstein, J.: The use of MMR, diversity-based reranking for reordering documents and producing summaries. In: SIGIR, pp. 335–336 (1988) Carbonell, J., Goldstein, J.: The use of MMR, diversity-based reranking for reordering documents and producing summaries. In: SIGIR, pp. 335–336 (1988)
2.
go back to reference Küçüktunç, O., Saule, E., Kaya, K., Çatalyürek, Ü.V.: Diversified recommendation on graphs: pitfalls, measures, and algorithms. In: WWW (2013) Küçüktunç, O., Saule, E., Kaya, K., Çatalyürek, Ü.V.: Diversified recommendation on graphs: pitfalls, measures, and algorithms. In: WWW (2013)
3.
go back to reference Mei, Q., Guo, J., Radev, D.: DivRank: the interplay of prestige and diversity in information networks. In: KDD (2010) Mei, Q., Guo, J., Radev, D.: DivRank: the interplay of prestige and diversity in information networks. In: KDD (2010)
4.
go back to reference Mcauley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS (2012) Mcauley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS (2012)
5.
go back to reference Kuo, L.Y., Chen, M.S.: Diversified ranking on graphs from the influence maximization viewpoint. In: DSAA (2014) Kuo, L.Y., Chen, M.S.: Diversified ranking on graphs from the influence maximization viewpoint. In: DSAA (2014)
6.
go back to reference Belkin, M., Niyogi, P., Sindhwani, V.: Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. JMLR 7, 2399–2434 (2006)MathSciNetMATH Belkin, M., Niyogi, P., Sindhwani, V.: Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. JMLR 7, 2399–2434 (2006)MathSciNetMATH
7.
go back to reference Park, G., Baek, Y., Lee, H.K.: Re-ranking algorithm using post-retrieval clustering for content-based image retrieval. Inf. Process. Manage. 41(2), 177–194 (2005)CrossRefMATH Park, G., Baek, Y., Lee, H.K.: Re-ranking algorithm using post-retrieval clustering for content-based image retrieval. Inf. Process. Manage. 41(2), 177–194 (2005)CrossRefMATH
8.
go back to reference Crabtree, D., Andreae, P., Gao, X.: Query directed web page clustering. In: Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence (2006) Crabtree, D., Andreae, P., Gao, X.: Query directed web page clustering. In: Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence (2006)
9.
go back to reference Schwander, O., Nielsen, F.: Reranking with contextual dissimilarity measures from representational Bregman k-Means. In: VISAPP (1) (2010) Schwander, O., Nielsen, F.: Reranking with contextual dissimilarity measures from representational Bregman k-Means. In: VISAPP (1) (2010)
10.
go back to reference Shi, J., Malik, J.: Normalized cuts and image segmentation. TPAMI 22(8), 888–905 (2000)CrossRef Shi, J., Malik, J.: Normalized cuts and image segmentation. TPAMI 22(8), 888–905 (2000)CrossRef
11.
go back to reference Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. United States Government Press Office, Washington, DC (1950)MATH Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. United States Government Press Office, Washington, DC (1950)MATH
12.
go back to reference Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: NIPS (2004) Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: NIPS (2004)
14.
go back to reference Haveliwala, T.H.: Topic-sensitive PageRank. In: WWW (2002) Haveliwala, T.H.: Topic-sensitive PageRank. In: WWW (2002)
15.
go back to reference Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD (2014) Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD (2014)
16.
go back to reference Lamprier, S., Amghar, T., Saubion, F., Levrat, B.: Query-oriented clustering: a multi-objective approach. In: Proceedings of the 2010 ACM Symposium on Applied Computing (2010) Lamprier, S., Amghar, T., Saubion, F., Levrat, B.: Query-oriented clustering: a multi-objective approach. In: Proceedings of the 2010 ACM Symposium on Applied Computing (2010)
17.
go back to reference Hu, Y., Yang, B.: Enhanced link clustering with observations on ground truth to discover social circles. Knowl.-Based Syst. 73, 227–235 (2015)CrossRef Hu, Y., Yang, B.: Enhanced link clustering with observations on ground truth to discover social circles. Knowl.-Based Syst. 73, 227–235 (2015)CrossRef
18.
go back to reference Chatterjee, M., Sajal, D.K., Damla, T.: WCA: a weighted clustering algorithm for mobile ad hoc networks. Cluster Comput. 5(2), 193–204 (2002)CrossRef Chatterjee, M., Sajal, D.K., Damla, T.: WCA: a weighted clustering algorithm for mobile ad hoc networks. Cluster Comput. 5(2), 193–204 (2002)CrossRef
19.
go back to reference Long, B., Zhang, Z.M., Wu, X., Yu, P.S.: Spectral clustering for multi-type relational data. In: ICML (2006) Long, B., Zhang, Z.M., Wu, X., Yu, P.S.: Spectral clustering for multi-type relational data. In: ICML (2006)
20.
go back to reference Tseng, G.C.: Penalized and weighted k-means for clustering with scattered objects and prior information in high-throughput biological data. Bioinformatics 23, 2247–2255 (2007)CrossRef Tseng, G.C.: Penalized and weighted k-means for clustering with scattered objects and prior information in high-throughput biological data. Bioinformatics 23, 2247–2255 (2007)CrossRef
21.
go back to reference Ackerman, M., David, S.B., Branzei, S., Loker, D.: Weighted clustering. In: AAAI (2012) Ackerman, M., David, S.B., Branzei, S., Loker, D.: Weighted clustering. In: AAAI (2012)
23.
go back to reference Cao, L., Jin, X., Yin, Z., Del Pozo, A., Luo, J., Han, J., Huang, T.S.: RankCompete: simultaneous ranking and clustering of information networks. Neurocomputing 95, 98–104 (2012)CrossRef Cao, L., Jin, X., Yin, Z., Del Pozo, A., Luo, J., Han, J., Huang, T.S.: RankCompete: simultaneous ranking and clustering of information networks. Neurocomputing 95, 98–104 (2012)CrossRef
Metadata
Title
Query-oriented Graph Clustering
Authors
Li-Yen Kuo
Chung-Kuang Chou
Ming-Syan Chen
Copyright Year
2017
DOI
https://doi.org/10.1007/978-3-319-57529-2_58

Premium Partner