{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T21:49:23Z","timestamp":1673041763099},"reference-count":17,"publisher":"Information Processing Society of Japan","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Information Processing"],"published-print":{"date-parts":[[2012]]},"DOI":"10.2197\/ipsjjip.20.806","type":"journal-article","created":{"date-parts":[[2012,10,14]],"date-time":"2012-10-14T23:22:34Z","timestamp":1350256954000},"page":"806-813","source":"Crossref","is-referenced-by-count":2,"title":["Clustering Large Attributed Graph"],"prefix":"10.2197","volume":"20","author":[{"given":"Hong","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"1012","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Cover, T.M. and Thomas, J.A.: <i>Elements of information theory<\/i>, Wiley-Interscience (1991).","DOI":"10.1002\/0471200611"},{"key":"2","unstructured":"[2] Henderson, K., Eliassi-Rad, T., Papadimitriou, S. and Faloutsos, C.: HCDF: A Hybrid Community Discovery Framework, <i>SDM<\/i>, pp.754-765 (2010)."},{"key":"3","unstructured":"[3] Hinneburg, A. and Keim, D.A.: An Efficient Approach to Clustering in Large Multimedia Databases with Noise, <i>Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining<\/i> (<i>KDD'98<\/i>), New York, NY, pp.58-65 (1998)."},{"key":"4","unstructured":"[4] Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm, <i>SODA<\/i>, pp.21-30 (1993)."},{"key":"5","unstructured":"[5] Kaufman, L. and Rousseeuw, P.J.: Clustering by means of medoids, <i>Statistical Data Analysis based on the L1 Norm<\/i>, pp.405-416 (1987)."},{"key":"6","unstructured":"[6] Neville, J., Adler, M. and Jensen, D.: Clustering Relational Data Using Attribute and Link Information, <i>Text Mining and Link Analysis Workshop, IJCAI<\/i>, pp.689-698 (2003)."},{"key":"7","unstructured":"[7] Newman, M.E.J. and Girvan, M.: Finding and evaluating community structure in networks, <i>Phys. Rev. E<\/i>, Vol.69, 026113 (2004)."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Pearl, J.: <i>Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference<\/i>, Morgan Kaufmann Publishers (1988).","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"9","unstructured":"[9] Satuluri, V. and Parthasarathy, S.: Scalable graph clustering using stochastic flows: Applications to community discovery, <i>Proc. 2009 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining<\/i> (<i>KDD'09<\/i>), Paris, France, pp.737-745 (2009)."},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"11","unstructured":"[11] Stein, B. and Niggemann, O.: On the nature of structure and its identification, <i>25th Workshop on Graph Theory, Lecture Notes in Computer Science<\/i>, Springer-Verlag (1999)."},{"key":"12","unstructured":"[12] Steinhaeuser, K. and Chawla, N.V.: Community Detection in a Large Real-World Social Network, <i>Social Computing, Behavioral Modeling, and Prediction<\/i>, pp.168-175 (2008)."},{"key":"13","unstructured":"[13] Tian, Y., Hankins, R.A. and Patel, J.M.: Efficient aggregation for graph summarization, <i>Proc. 2008 ACM-SIGMOD Int. Conf. Management of Data<\/i> (<i>SIGMOD'08<\/i>), Vancouver, Canada, pp.567-580 (2008)."},{"key":"14","unstructured":"[14] Xu, X., Yuruk, N., Feng, Z. and Schweiger, T.A.J.: SCAN: A structural clustering algorithm for networks, <i>Proc. 2007 Int. Conf. Knowledge Discovery and Data Mining<\/i> (<i>KDD'07<\/i>), San Jose, CA, pp.824-833 (2007)."},{"key":"15","unstructured":"[15] Xu, Z., Ke, Y., Wang, Y., Cheng, H. and Cheng, J.: A model-based approach to attributed graph clustering, <i>SIGMOD<\/i>, pp.505-516 (2012)."},{"key":"16","unstructured":"[17] Zhou, Y., Cheng, H. and Yu, J.X.: Graph clustering based on structural\/attribute similarities, <i>VLDB<\/i>, pp.718-729 (2009)."},{"key":"17","unstructured":"[18] Zhou, Y., Cheng, H. and Yu, J.X.: Clustering Large Attributed Graphs: An Efficient Incremental Approach, <i>ICDM<\/i>, pp.689-698 (2010)."}],"container-title":["Journal of Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/20\/4\/20_806\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T01:00:32Z","timestamp":1638320432000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/20\/4\/20_806\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012]]}},"URL":"https:\/\/doi.org\/10.2197\/ipsjjip.20.806","relation":{},"ISSN":["1882-6652"],"issn-type":[{"value":"1882-6652","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}