{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:59:19Z","timestamp":1725512359903},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681243"},{"type":"electronic","value":"9783540681250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68125-0_7","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T07:40:05Z","timestamp":1210405205000},"page":"53-63","source":"Crossref","is-referenced-by-count":0,"title":["Mining Quality-Aware Subspace Clusters"],"prefix":"10.1007","author":[{"given":"Ying-Ju","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yi-Hong","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Ming-Syan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is Nearest Neighbor Meaningful? In: Proc. of ICDT Conference (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Cheng, C.H., Fu, A.W., Zhang, Y.: Entropy-Based Subspace Clustering for Mining Numerical Data. ACM SIGKDD (1999)","DOI":"10.1145\/312129.312199"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H.-P., Kroger, P.: Density-Connected Subspace Clustering for High-Dimensional Data. In: SDM (2004)","DOI":"10.1137\/1.9781611972740.23"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Kroger, P., Renz, M., Wurst, S.: A generic framework for efficient subspace clustering of high-dimensional data. In: IEEE ICDM (2005)","DOI":"10.1109\/ICDM.2005.5"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Nagesh, H., Goil, S., Choudhary, A.: Adaptive grids for clustering massive data sets. In: Proc. of the SIAM Intern\u2019l Conference on Data Mining (SDM) (2001)","DOI":"10.1137\/1.9781611972719.7"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Parsons, L., Haque, E., Liu, H.: Subspace Clustering for High Dimensional Data: A Review. ACM SIGKDD Explorations Newsletter (2004)","DOI":"10.1145\/1007730.1007731"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Sequeira, K., Zaki, M.: Schism: A new approach for interesting subspace mining. In: Proc. of the IEEE 4th Intern\u2019l Conf. on Data Mining (ICDM) (2004)","DOI":"10.1109\/ICDM.2004.10099"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Yip, K.Y., Cheung, D.W., Ng, M.K.: Harp: A practical projected clustering algorithm. IEEE Trans. Knowl. Data Eng.\u00a016(11) (2004)","DOI":"10.1109\/TKDE.2004.74"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68125-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:36:59Z","timestamp":1620016619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_7","relation":{},"subject":[]}}