{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:52:47Z","timestamp":1725587567272},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215629"},{"type":"electronic","value":"9783642215636"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21563-6_8","type":"book-chapter","created":{"date-parts":[[2011,6,22]],"date-time":"2011-06-22T10:52:30Z","timestamp":1308739950000},"page":"139-158","source":"Crossref","is-referenced-by-count":3,"title":["Tolerance Rough Set Theory Based Data Summarization for Clustering Large Datasets"],"prefix":"10.1007","author":[{"given":"Bidyut Kr.","family":"Patra","sequence":"first","affiliation":[]},{"given":"Sukumar","family":"Nandi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","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 Comput. Surv.\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"key":"8_CR2","unstructured":"MacQueen, J.B.: Some Methods for Classification and Analysis of MultiVariate Observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"8_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data:an Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data:an Introduction to Cluster Analysis. John Wiley & Sons, USA (1990)"},{"key":"8_CR4","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd ACM SIGKDD, SIGKDD 1996, pp. 226\u2013231 (1996)"},{"key":"8_CR5","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. John Wiley & Sons, Inc., New York (1975)"},{"key":"8_CR6","volume-title":"Cluster Analysis Algorithms for Data Reduction and Classification of Objects","author":"H. Spath","year":"1980","unstructured":"Spath, H.: Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwood, UK (1980)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/int.10016","volume":"17","author":"T.B. Ho","year":"2002","unstructured":"Ho, T.B., Nguyen, N.B.: Nonhierarchical document clustering based on a tolerance rough set model. Int. J. Intell. Syst.\u00a017, 199\u2013212 (2002)","journal-title":"Int. J. Intell. Syst."},{"key":"8_CR8","volume-title":"Discreate Mathematical Structures with Applications to Computer Science","author":"J.P. Tremblay","year":"1997","unstructured":"Tremblay, J.P., Manohar, R.: Discreate Mathematical Structures with Applications to Computer Science. Tata McGraw-Hill Publishing Company Limited, New Delhi (1997)"},{"key":"8_CR9","volume-title":"Numerical Taxonomy","author":"A. Sneath","year":"1973","unstructured":"Sneath, A., Sokal, P.H.: Numerical Taxonomy. Freeman, London (1973)"},{"issue":"317","key":"8_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1080\/01621459.1967.10482890","volume":"62","author":"B. King","year":"1967","unstructured":"King, B.: Step-Wise Clustering Procedures. Journal of the American Statistical Association\u00a062(317), 86\u2013101 (1967)","journal-title":"Journal of the American Statistical Association"},{"key":"8_CR11","first-page":"101","volume":"1","author":"F. Murtagh","year":"1984","unstructured":"Murtagh, F.: Complexities of hierarchic clustering algorithms: state of the art. Computational Statistics Quarterly\u00a01, 101\u2013113 (1984)","journal-title":"Computational Statistics Quarterly"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M. Ankerst","year":"1999","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: Ordering points to identify the clustering structure. SIGMOD Rec.\u00a028, 49\u201360 (1999)","journal-title":"SIGMOD Rec."},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.fss.2004.03.010","volume":"148","author":"S.K. De","year":"2004","unstructured":"De, S.K., Krishna, P.R.: Clustering web transactions using rough approximation. Fuzzy Sets and Systems\u00a0148(1), 131\u2013138 (2004)","journal-title":"Fuzzy Sets and Systems"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.datak.2007.01.003","volume":"63","author":"P. Kumar","year":"2007","unstructured":"Kumar, P., Krishna, P.R., Bapi, R.S., De, S.K.: Rough clustering of sequential data. Data Knowl. Eng.\u00a063, 183\u2013199 (2007)","journal-title":"Data Knowl. Eng."},{"key":"8_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-45372-5_51","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S. Kawasaki","year":"2000","unstructured":"Kawasaki, S., Nguyen, N.B., Ho, T.B.: Hierarchical document clustering based on tolerance rough set model. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 458\u2013463. Springer, Heidelberg (2000)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: Proceedings of the ACM SIGMOD Conference, SIGMOD 1996, pp. 103\u2013114 (1996)","DOI":"10.1145\/233269.233324"},{"key":"8_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-45372-5_23","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"M.M. Breunig","year":"2000","unstructured":"Breunig, M.M., Kriegel, H.P., Sander, J.: Fast hierarchical clustering based on compressed data and optics. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 232\u2013242. Springer, Heidelberg (2000)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., peter Kriegel, H., Kr\u00f6ger, P., Sander, J.: Data bubbles: Quality preserving performance boosting for hierarchical clustering. In: Proceedings of the ACM SIGMOD Conference, SIGMOD 2001, pp. 79\u201390 (2001)","DOI":"10.1145\/375663.375672"},{"key":"8_CR19","unstructured":"Bradley, P.S., Fayyad, U.M., Reina, C.: Scaling clustering algorithms to large databases. In: Proceedings of the KDD, KDD 1998, pp. 9\u201315 (1998)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, J., Sander, J.: Data bubbles for non-vector data: speeding-up hierarchical clustering in arbitrary metric spaces. In: Proceedings of VLDB 2003, pp. 452\u2013463 (2003)","DOI":"10.1016\/B978-012722442-8\/50047-1"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-10646-0_50","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"B.K. Patra","year":"2009","unstructured":"Patra, B.K., Nandi, S.: A fast single link clustering method based on tolerance rough set model. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., \u015al\u0119zak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS, vol.\u00a05908, pp. 414\u2013422. Springer, Heidelberg (2009)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. of Computer and Information Sc.\u00a011, 341\u2013356 (1982)","journal-title":"Int.J. of Computer and Information Sc."},{"volume-title":"Rough Sets and Data Mining: Analysis of Imprecise Data","year":"1996","key":"8_CR23","unstructured":"Lin, T.Y., Cercone, N. (eds.): Rough Sets and Data Mining: Analysis of Imprecise Data. Kluwer Academic Publishers, Norwell (1996)"},{"key":"8_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1996-272311","volume":"27","author":"A. Skowron","year":"1996","unstructured":"Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae\u00a027, 245\u2013253 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/69.842271","volume":"12","author":"R. Slowinski","year":"2000","unstructured":"Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. on Knowl. and Data Eng.\u00a012, 331\u2013336 (2000)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"issue":"1-4","key":"8_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0255(98)10019-1","volume":"112","author":"M. Kryszkiewicz","year":"1998","unstructured":"Kryszkiewicz, M.: Rough set approach to incomplete information systems. Information Sciences\u00a0112(1-4), 39\u201349 (1998)","journal-title":"Information Sciences"},{"key":"8_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-540-72530-5_52","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"D. \u015alezak","year":"2007","unstructured":"\u015alezak, D., Wasilewski, P.: Granular sets \u2014 foundations and case study of tolerance spaces. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol.\u00a04482, pp. 435\u2013442. Springer, Heidelberg (2007)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-10646-0_23","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"P. Bedi","year":"2009","unstructured":"Bedi, P., Chawla, S.: Use of fuzzy rough set attribute reduction in high scent web page recommendations. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., \u015al\u0119zak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS, vol.\u00a05908, pp. 192\u2013200. Springer, Heidelberg (2009)"},{"key":"8_CR29","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: Proceedings of the Twentieth International Conference on Machine Learning, ICML 2003, pp. 147\u2013153 (2003)"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Nassar, S., Sander, J., Cheng, C.: Incremental and effective data summarization for dynamic hierarchical clustering. In: Proceedings of SIGMOD Conference, SIGMOD 2004, pp. 467\u2013478 (2004)","DOI":"10.1145\/1007568.1007621"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-13529-3_8","volume-title":"Rough Sets and Current Trends in Computing","author":"M. Kryszkiewicz","year":"2010","unstructured":"Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: Clustering with DBSCAN by means of the\u00a0triangle inequality. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol.\u00a06086, pp. 60\u201369. Springer, Heidelberg (2010)"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-13529-3_7","volume-title":"Rough Sets and Current Trends in Computing","author":"B.K.. Patra","year":"2010","unstructured":"Patra, B.K., Hubballi, N., Biswas, S., Nandi, S.: Distance based fast hierarchical clustering method for large datasets. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol.\u00a06086, pp. 50\u201359. Springer, Heidelberg (2010)"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W.M. Rand","year":"1971","unstructured":"Rand, W.M.: Objective Criteria for Evaluation of Clustering Methods. J. of American Statistical Association\u00a066, 846\u2013850 (1971)","journal-title":"J. of American Statistical Association"},{"key":"8_CR34","unstructured":"Zhao, Y., Karypis, G.: Criterion functions for document clustering: Experiments and analysis. Technical report, University of Minnesota (2002)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21563-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T14:19:52Z","timestamp":1592662792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21563-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215629","9783642215636"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21563-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}