{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:24:41Z","timestamp":1725474281836},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496670"},{"type":"electronic","value":"9783540496687"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940098_10","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:12:55Z","timestamp":1164633175000},"page":"97-108","source":"Crossref","is-referenced-by-count":9,"title":["Clique Percolation Method for Finding Naturally Cohesive and Overlapping Document Clusters"],"prefix":"10.1007","author":[{"given":"Wei","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kam-Fai","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunqing","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruifeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Baker, L., McCallum, A.: Distributional clustering of words for text classification. In: Proc. of ACM SIGIR, pp. 96\u2013103 (1998)","DOI":"10.1145\/290941.290970"},{"key":"10_CR2","unstructured":"Bezdek, J.C.: Pattern recognition with fuzzy objective function algorithms. Plenum Press, New York"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1971","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Communications of the ACM\u00a016, 575\u2013577 (1971)","journal-title":"Communications of the ACM"},{"key":"10_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. McGraw-Hill, New York"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cutting, D., Karger, D., Pedersen, J., Tukey, J.W.: Scatter\/Gather: A cluster-based approach to browsing large document collections. In: Proc. of the 15th ACM SIGIR Conference, pp. 318\u2013329 (1992)","DOI":"10.1145\/133160.133214"},{"key":"10_CR6","first-page":"160","volume":"95","author":"I. Derenyi","year":"2005","unstructured":"Derenyi, I., Palla, G., Vicsek, T.: Clique percolation in random networks. Physics Review Letters\u00a095, 160\u2013202 (2005)","journal-title":"Physics Review Letters"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proc. of the 7th ACM-KDD, pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X.F., Zha, H.Y., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proc. of IEEE ICDM, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"10_CR9","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Oxford Press, New York"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys\u00a031, 264\u2013323 (1999)","journal-title":"ACM Computing Surveys"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.2307\/2282912","volume":"69","author":"B. King","year":"1967","unstructured":"King, B.: Step-wise clustering procedures. Journal of the American Statistical Association\u00a069, 86\u2013101 (1967)","journal-title":"Journal of the American Statistical Association"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/91.940971","volume":"9","author":"R. Krishnapuram","year":"2001","unstructured":"Krishnapuram, R., Joshi, A., Nasraoui, O., Yi, L.Y.: Low-complexity fuzzy relational clustering algorithms for web mining. IEEE Transactions on Fuzzy Systems\u00a09, 595\u2013607 (2001)","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Liu, X., Gong, Y.: Document clustering with clustering refinement and model selection capabilitities. In: Proc. of ACM SIGIR, pp. 191\u2013198 (2002)","DOI":"10.1145\/564410.564411"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435, 814\u2013818 (2005)","journal-title":"Nature"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1109\/TPAMI.1981.4767125","volume":"3","author":"V.V. Raghavan","year":"1981","unstructured":"Raghavan, V.V., Yu, C.T.: A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a03, 393\u2013402 (1981)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10_CR16","unstructured":"Sneath, P.H.A., Sokal, R.R.: Numerical taxonomy: the principles and practice of numerical classification. Freeman, London"},{"key":"10_CR17","unstructured":"Steinbach, M., Karypis, G., Kumar, V.: A comparison of doucment clustering techniques. In: Proc. of KDD 2000 Workshop on Text Mining (2000)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Journal on Computing\u00a06, 505\u2013517 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR19","unstructured":"Zhao, Y., Karypis, G.: Criterion functions for document clustering. Technical Report #01-40, Department of Computer Science, University of Minnesota"}],"container-title":["Lecture Notes in Computer Science","Computer Processing of Oriental Languages. Beyond the Orient: The Research Challenges Ahead"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940098_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:18Z","timestamp":1619509758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940098_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496670","9783540496687"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11940098_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}