{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:47Z","timestamp":1725566147140},"publisher-location":"New York, NY","reference-count":51,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781441965141"},{"type":"electronic","value":"9781441965158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-4419-6515-8_1","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T16:56:10Z","timestamp":1284569770000},"page":"3-44","source":"Crossref","is-referenced-by-count":0,"title":["Machine Learning Approaches to Link-Based Clustering"],"prefix":"10.1007","author":[{"given":"Zhongfei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianbing","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,13]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"A. Banerjee, I. S. Dhillon, J. Ghosh, S. Merugu, and D. S. Modha. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. In KDD, pages 509\u2013514, 2004.","DOI":"10.1145\/1014052.1014111"},{"key":"1_CR2","first-page":"1705","volume":"6","author":"A. Banerjee","year":"2005","unstructured":"A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh. Clustering with bregman divergences. Journal of Machine Learning Research, 6:1705\u20131749, 2005.","journal-title":"Journal of Machine Learning Research"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"S. Basu, M. Bilenko, and R. J. Mooney. A probabilistic framework for semi-supervised clustering. In Proceedings ACM KDD04, pages 59\u201368, Seattle, WA, August 2004.","DOI":"10.1145\/1014052.1014062"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"M. J. Beal, Z. Ghahramani, and C. E. Rasmussen. The infinite hidden markov model. In NIPS 14, 2002.","DOI":"10.7551\/mitpress\/1120.003.0079"},{"key":"1_CR5","unstructured":"D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. Journal of Machine Learning Research, 993\u20131022, 2003."},{"key":"1_CR6","unstructured":"T. N. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In PPSC, pages 445\u2013452, 1993."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"M. Catral, L. Han, M. Neumann, and R. J. Plemmons. On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices. Linear Algebra and Its Application, 2004.","DOI":"10.1016\/j.laa.2003.11.024"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"P. K. Chan, M. D. F. Schlag, and J. Y. Zien. Spectral k-way ratio-cut partitioning and clustering. In DAC\u201993, pages 749\u2013754, 1993.","DOI":"10.1145\/157485.165117"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng. Evolutionary spectral clustering by incorporating temporal smoothness. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 153\u2013162, 2007.","DOI":"10.1145\/1281192.1281212"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"H. Cho, I. Dhillon, Y. Guan, and S. Sra. Minimum sum squared residue co-clustering of gene expression data. In SDM, 2004.","DOI":"10.1137\/1.9781611972740.11"},{"key":"1_CR11","unstructured":"D. Cohn and H. Chang. Learning to probabilistically identify authoritative documents. In Proceeding of ICML, pages 167\u2013174, 2000."},{"key":"1_CR12","unstructured":"D. A. Cohn and T. Hofmann. The missing link \u2013 a probabilistic model of document content and hypertext connectivity. In Proceedings of NIPS, pages 430\u2013436, 2000."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D. D. Lee","year":"1999","unstructured":"D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788\u2013791, 1999.","journal-title":"Nature"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In KDD\u201903, pages 89\u201398, 2003.","DOI":"10.1145\/956750.956764"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"I. Dhillon, Y. Guan, and B. Kulis. A unified view of kernel k-means, spectral clustering and graph cuts. Technical Report TR-04-25, University of Texas at Austin, 2004.","DOI":"10.1145\/1014052.1014118"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"I. Dhillon, Y. Guan, and B. Kulis. A fast kernel-based multilevel algorithm for graph clustering. In KDD\u201905, 2005.","DOI":"10.1145\/1081870.1081948"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, pages 269\u2013274, 2001.","DOI":"10.1145\/502512.502550"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"C. Ding, X. He, and H. D. Simon. On the equivalence of nonnegative matrix factorization and spectral clustering. In SDM\u201905, 2005.","DOI":"10.1137\/1.9781611972757.70"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon. A min-max cut algorithm for graph partitioning and data clustering. In Proceedings of ICDM 2001, pages 107\u2013114, 2001.","DOI":"10.1109\/ICDM.2001.989507"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"E. Erosheva and S. E. Fienberg. Bayesian mixed membership models for soft clustering and classification. Classification-The Ubiquitous Challenge, pages 11\u201326, 2005.","DOI":"10.1007\/3-540-28084-7_2"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"E.A. Erosheva, S.E. Fienberg, and J. Lafferty. Mixed membership models of scientific publications. In NAS.","DOI":"10.1073\/pnas.0307760101"},{"key":"1_CR22","first-page":"577","volume":"90","author":"M. D. Escobar","year":"1995","unstructured":"M. D. Escobar and M. West. Bayesian density estimation and inference using mixtures. The Annals of Statistics, 90:577\u2013588, 1995.","journal-title":"The Annals of Statistics"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"B. Gao, T. Y. Liu, X. Zheng, Q. S. Cheng, and W. Y. Ma. Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In KDD\u201905, pages 41\u201350, 2005.","DOI":"10.1145\/1081870.1081879"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Z. Guo, S. Zhu, Y. Chi, Z. Zhang, and Y. Gong. A latent topic model for linked documents. In Proceedings of ACM SIGIR, 2009.","DOI":"10.1145\/1571941.1572095"},{"key":"1_CR25","unstructured":"G. Heinrich. Parameter estimation for text analysis. Technical Report, 2004."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Supercomputing \u201995, page 28, 1995.","DOI":"10.1145\/224170.224228"},{"key":"1_CR27","unstructured":"M. Henzinger, R. Motwani, and C. Silverstein. Challenges in web search engines. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, pages 1573\u20131579, 2003."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"T. Hofmann. Probabilistic latent semantic indexing. In Proceedings SIGIR, pages 50\u201357, 1999.","DOI":"10.1145\/312624.312649"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"G. Karypis. A clustering toolkit, 2002.","DOI":"10.21236\/ADA439508"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359\u2013392, 1998.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"2","key":"1_CR31","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291\u2013307, 1970.","journal-title":"The Bell System Technical Journal"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R. Kumar","year":"1999","unstructured":"R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks, 31(11\u201316), 1999.","journal-title":"Computer Networks"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"K. Lang. News weeder: Learning to filter netnews. In ICML, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"T. Li. A general model for clustering binary data. In KDD\u201905, 2005.","DOI":"10.1145\/1081870.1081894"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"B. Long, Z. Zhang, and P. S. Yu. Relational clustering by symmetric convex coding. In Proceedings of International Conference on Machine Learning, 2007.","DOI":"10.1145\/1273496.1273568"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"B. Long, Z. Zhang, X. Wu, and P. S. Yu. Spectral clustering for multi-type relational data. In Proceedings of ICML, 2006.","DOI":"10.1145\/1143844.1143918"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"B. Long, Z. Zhang, and P. S. Yu. A probabilistic framework for relational clustering. In Proceedings of ACM KDD, 2007.","DOI":"10.1145\/1281192.1281244"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"B. Long, X. Wu, Z. Zhang, and P. S. Yu. Unsupervised learning on k-partite graphs. In KDD-2006, 2006.","DOI":"10.1145\/1150402.1150439"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"B. Long, Z. M. Zhang, and P. S. Yu. Co-clustering by block value decomposition. In KDD\u201905, 2005.","DOI":"10.1145\/1081870.1081949"},{"issue":"2","key":"1_CR40","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"A. McCallum","year":"2000","unstructured":"A. McCallum, K. Nigam, J. Rennie, and K. Seymore. Automating the construction of internet portals with machine learning. Information Retrieval, 3(2):127\u2013163, 2000.","journal-title":"Information Retrieval"},{"key":"1_CR41","unstructured":"A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14, 2001."},{"issue":"8","key":"1_CR42","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis Machine Intelligence, 22(8):888\u2013905, 2000.","journal-title":"IEEE Transactions on Pattern Analysis Machine Intelligence"},{"key":"1_CR43","unstructured":"A. Strehl and J. Ghosh. Cluster ensembles \u2013 a knowledge reuse framework for combining partitionings. In AAAI 2002, pages 93\u201398, 2002."},{"issue":"476","key":"1_CR44","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1198\/016214506000000302","volume":"101","author":"Y. Teh","year":"2007","unstructured":"Y. Teh, M. Beal M. Jordan, and D. Blei. Hierarchical dirichlet processes. Journal of the American Statistical Association, 101(476):1566\u20131581, 2007.","journal-title":"Journal of the American Statistical Association"},{"key":"1_CR45","unstructured":"K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge. In ICML-2001, pages 577\u2013584, 2001."},{"key":"1_CR46","unstructured":"E. P. Xing, A. Y. Ng, M. I. Jorda, and S. Russel. Distance metric learning with applications to clustering with side information. In NIPS\u201903, volume 16, 2003."},{"key":"1_CR47","unstructured":"T. Xu, Z. Zhang, P. S. Yu, and B. Long. Evolutionary clustering by hierarchical dirichlet process with hidden markov state. In Proceedings of IEEE ICDM, 2008."},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"W. Xu, X. Liu, and Y. Gong. Document clustering based on non-negative matrix factorization. In Proceedings of SIGIR, pages 267\u2013273, 2003.","DOI":"10.1145\/860435.860485"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"S. Yu and J. Shi. Multiclass spectral clustering. In ICCV\u201903, 2003.","DOI":"10.1109\/ICCV.2003.1238361"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"H. Zha, C. Ding, M. Gu, X. He, and H. Simon. Bi-partite graph partitioning and data clustering. In ACM CIKM\u201901, 2001.","DOI":"10.1145\/502590.502591"},{"key":"1_CR51","unstructured":"H. Zha, C. Ding, M. Gu, X. He, and H. Simon. Spectral relaxation for k-means clustering. Advances in Neural Information Processing Systems, 14, 2002."}],"container-title":["Link Mining: Models, Algorithms, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-6515-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T13:54:15Z","timestamp":1711806855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4419-6515-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9781441965141","9781441965158"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-6515-8_1","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}