{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:19:01Z","timestamp":1758709141466,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evolving Systems"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12530-019-09308-2","type":"journal-article","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T08:49:10Z","timestamp":1572511750000},"page":"489-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient hybrid algorithms for density based subspace clustering to deal with density divergence for improved quality and conciseness"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6824-4026","authenticated-orcid":false,"given":"B. Jaya","family":"Lakshmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. B.","family":"Madhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Shashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,30]]},"reference":[{"issue":"2","key":"9308_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/335191.335383","volume":"29","author":"CC Aggarwal","year":"2000","unstructured":"Aggarwal CC, Philip SYu (2000) Finding generalized projected clusters in high dimensional spaces. ACM SIGMOD 29(2):70\u201381","journal-title":"ACM SIGMOD"},{"key":"9308_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, pp\u00a094\u2013105","DOI":"10.1145\/276305.276314"},{"key":"9308_CR3","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, M\u00fcller E, Seidl T (2007) DUSC: dimensionality unbiased subspace clustering. In: Proceedings international conference on data mining, pp 409\u2013414","DOI":"10.1109\/ICDM.2007.49"},{"key":"9308_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Kailing K, Kriegel H-P, Kr\u00f6ger P (2004) Density connected clustering with local subspace preferences. In: Proceedings of the fourth IEEE international conference on data mining (ICDM\u201904), pp\u00a027\u201334","DOI":"10.1109\/ICDM.2004.10087"},{"issue":"5","key":"9308_CR5","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00500-010-0552-8","volume":"15","author":"G Chen","year":"2011","unstructured":"Chen G, Ma X, Yang D, Tang S (2011) Efficientapproachesforsummarizingsubspaceclusters into k representatives. Soft Comput 15(5):845\u2013853","journal-title":"Soft Comput"},{"key":"9308_CR6","doi-asserted-by":"crossref","unstructured":"Cheng CH, Fu AW, Zhang Y (1999) Entropy-based subspace clustering for mining numerical data. In: International conference on knowledge discovery and data mining, pp\u00a084\u201393","DOI":"10.1145\/312129.312199"},{"issue":"1","key":"9308_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TKDE.2008.224","volume":"22","author":"Yi-Hong Chu","year":"2010","unstructured":"Chu Yi-Hong, Huang Jen-Wei, Chuang Kun-Ta (2010) Density conscious subspace clustering for high-dimensional data. IEEE Trans Knowl Data Eng 22(1):16\u201330","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9308_CR8","unstructured":"Ester M, Kriegel H, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In; International conference on knowledge discovery and data mining, pp\u00a0169\u2013194"},{"key":"9308_CR9","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2010) Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: ICDM, pp\u00a0845\u2013850","DOI":"10.1109\/ICDM.2010.95"},{"key":"9308_CR10","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, Boden B, Seidl T (2011) DB-CSC: a density-based approach for subspace clustering in graphs with feature vectors. In: Proceedings of the 2011 European conference on machine learning and knowledge discovery in databases, pp\u00a0565\u2013580","DOI":"10.1007\/978-3-642-23780-5_46"},{"key":"9308_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-012-0272-z","volume":"25","author":"Stephan G\u00fcnnemann","year":"2012","unstructured":"G\u00fcnnemann Stephan, Boden Brigitte, Seidl Thomas (2012) Finding density-based subspace clusters in graphs with feature vectors. Data Min Knowl Disc 25:243\u2013269","journal-title":"Data Min Knowl Disc"},{"issue":"8","key":"9308_CR12","doi-asserted-by":"publisher","first-page":"1542","DOI":"10.1109\/TPAMI.2014.2377740","volume":"37","author":"H Hu","year":"2015","unstructured":"Hu H, Feng J, Zhou J (2015) Exploiting unsupervised and supervised constraints for subspace clustering. IEEE Trans Pattern Anal Mach Intell 37(8):1542\u20131557","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9308_CR13","doi-asserted-by":"crossref","unstructured":"Huang W, Chen L, Jiang Q (2010) A novel subspace clustering algorithm with dimensional density. In: 2nd international conference on future computer and communication, pp\u00a0V3-71\u2013V3-75","DOI":"10.1109\/ICFCC.2010.5497687"},{"key":"9308_CR14","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel H, Kroger P (2004) Density connected subspace clustering for high\u2014dimensional data. In: International conference on data mining, pp\u00a0246\u2013256","DOI":"10.1137\/1.9781611972740.23"},{"key":"9308_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1186\/s40537-015-0027-y","volume":"2","author":"A Kaur","year":"2015","unstructured":"Kaur A, Datta A (2015) A novel algorithm for fast and scalable subspace clustering of high-dimensional data. J Big Data 2:17","journal-title":"J Big Data"},{"issue":"2","key":"9308_CR16","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s10618-012-0258-x","volume":"26","author":"S Kelvin","year":"2013","unstructured":"Kelvin S, Gopalkrishnan V, Zimek A, Cong G (2013) A survey on enhanced subspace clustering. Data Min Knowl Disc 26(2):332\u2013397","journal-title":"Data Min Knowl Disc"},{"key":"9308_CR17","unstructured":"Lakshmi BJ, Shashi M, Madhuri KB (2017) A rough set based subspace clustering technique for high dimensional data. J King Saud Univ Comput Inf Sci (in press)"},{"issue":"4","key":"9308_CR18","first-page":"27","volume":"6","author":"BJ Lakshmi","year":"2017","unstructured":"Lakshmi BJ, Madhuri KB, Shashi M (2017b) An efficient algorithm for density based subspace clustering with dynamic parameter setting. Int J Inf Technol Comput Sci 6(4):27\u201333","journal-title":"Int J Inf Technol Comput Sci"},{"issue":"3","key":"9308_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1504\/IJDS.2018.094504","volume":"3","author":"BJ Lakshmi","year":"2018","unstructured":"Lakshmi BJ, Shashi M, Madhuri KB (2018) Summarization of subspace clusters based on similarity connectedness. Int J Data Sci 3(3):255\u2013265","journal-title":"Int J Data Sci"},{"key":"9308_CR31","unstructured":"Lichman (2007) UCI Machine Learning Repository, available at http:\/\/archive.ics.uci.edu\/ml"},{"key":"9308_CR20","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/s10618-013-0317-y","volume":"28","author":"Brian McWilliams","year":"2014","unstructured":"McWilliams Brian, Montana Giovanni (2014) Subspace clustering of high-dimensional data: a predictive approach. Data Min Knowl Disc 28:736\u2013772","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"9308_CR21","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newsl 6(1):90\u2013105","journal-title":"ACM SIGKDD Explor Newsl"},{"issue":"7","key":"9308_CR22","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TKDE.2006.106","volume":"18","author":"A Patrikainen","year":"2006","unstructured":"Patrikainen A, Meila M (2006) Comparing Subspace Clusterings. IEEE Trans Knowl Data Eng 18(7):902\u2013916","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9308_CR23","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Comput Inform Sci 11:341\u2013356","journal-title":"Int J Comput Inform Sci"},{"key":"9308_CR24","doi-asserted-by":"crossref","unstructured":"Peng X, Zhang L, Yi Z (2013) Scalable sparse subspace clustering. In: Computer vision and pattern recognition (CVPR), pp\u00a0430\u2013437","DOI":"10.1109\/CVPR.2013.62"},{"key":"9308_CR25","doi-asserted-by":"crossref","unstructured":"Procopiuc CM, Jones M, Agarwal PK, Murali TM (2002) A monte carlo algorithm for fast projective clustering. In: Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp\u00a0418\u2013427","DOI":"10.1145\/564691.564739"},{"key":"9308_CR26","doi-asserted-by":"crossref","unstructured":"Sequeira K, Zaki M (2004) SCHISM: a new approach for interesting subspace mining. In: Proceedings of the fourth IEEE conference on data mining, pp\u00a0186\u2013193","DOI":"10.1109\/ICDM.2004.10099"},{"key":"9308_CR27","doi-asserted-by":"crossref","unstructured":"Sirisha GNVG, Shashi M (2015) Mining closed interesting subspaces to discover conducive living environment of migratory animals. In: Proceedings of the 4th international conference on frontiers in intelligent computing: theory and applications, pp\u00a0153\u2013166","DOI":"10.1007\/978-81-322-2695-6_14"},{"issue":"1","key":"9308_CR28","first-page":"143","volume":"11","author":"GNVG Sirisha","year":"2016","unstructured":"Sirisha GNVG, Shashi M (2016) Spatiotemporal data modeling for grid based subspace clustering. Int J Appl Eng Res 11(1):143\u2013147","journal-title":"Int J Appl Eng Res"},{"issue":"6","key":"9308_CR29","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0167-8655(02)00196-4","volume":"24","author":"Roman W Swiniarski","year":"2003","unstructured":"Swiniarski Roman W, Skowron Andrzej (2003) Rough set methods in feature selection and recognition. Pattern Recogn Lett 24(6):833\u2013849","journal-title":"Pattern Recogn Lett"},{"key":"9308_CR30","volume-title":"Introduction to data mining","author":"Pang-Ning Tan","year":"2005","unstructured":"Tan Pang-Ning, Steinbach Michael, Kumar Vipin (2005) Introduction to data mining, 1st edn. Addison-Wesley Longman Publishing Co.,Inc., Boston","edition":"1"}],"container-title":["Evolving Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-019-09308-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12530-019-09308-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-019-09308-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T04:21:40Z","timestamp":1621570900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12530-019-09308-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,30]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["9308"],"URL":"https:\/\/doi.org\/10.1007\/s12530-019-09308-2","relation":{},"ISSN":["1868-6478","1868-6486"],"issn-type":[{"type":"print","value":"1868-6478"},{"type":"electronic","value":"1868-6486"}],"subject":[],"published":{"date-parts":[[2019,10,30]]},"assertion":[{"value":"7 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}