{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:59:42Z","timestamp":1725512382528},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_82","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T03:40:05Z","timestamp":1210390805000},"page":"839-848","source":"Crossref","is-referenced-by-count":1,"title":["A Creditable Subspace Labeling Method Based on D-S Evidence Theory"],"prefix":"10.1007","author":[{"given":"Yu","family":"Zong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian-Chao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Chu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"82_CR1","unstructured":"Berkhin, P.: Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, California (2002)"},{"key":"82_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"J.A. Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: A k-means clustering algorithm. Applied Statistics\u00a0(28), 100\u2013108 (1979)","journal-title":"Applied Statistics"},{"key":"82_CR3","unstructured":"Ng, R.T., Han, J.: Efficient and Effective Clustering Method for Spatial Data Mining. In: Proceeding of the 20th VLDB Conference, pp. 144\u2013155 (1994)"},{"issue":"5","key":"82_CR4","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","volume":"14","author":"R. Ng","year":"2002","unstructured":"Ng, R., Han, J.: CLARANS: A method for clustering objects for spatial data mining. IEEE Trans. on Knowl., Data Eng.\u00a014(5), 1003\u20131016 (2002)","journal-title":"IEEE Trans. on Knowl., Data Eng."},{"key":"82_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishna, R., Livny, M.: BIRCH: A New Data Clustering Algorithm and its Applications. Journal of Data Mining and Knowledge Discovery, 141\u2013182 (1997)","DOI":"10.1023\/A:1009783824328"},{"key":"82_CR6","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithm for large database. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pp. 73\u201384 (1998)","DOI":"10.1145\/276304.276312"},{"key":"82_CR7","unstructured":"Ester, M., Kriegel, H.P., Sander, J., et al.: A density-based algorithm for discovering clusters in large spatial database. In: Proc.1996 Int. Conf.Knowledge Discovery and Data Mining (KDD 1996), Portland, OR, August 1996, pp. 226\u2013231 (1996)"},{"key":"82_CR8","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., et al.: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. In: Proc.1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1998), Seattle, WA, June 1998, pp. 94\u2013105 (1998)","DOI":"10.1145\/276304.276314"},{"key":"82_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/312129.312199","volume-title":"Proceedings of the 5th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"C.-H. Cheng","year":"1999","unstructured":"Cheng, C.-H., Fu, A.W., Zhang, Y.: Entropy-based subspace clustering for mining numerical data. In: Proceedings of the 5th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 84\u201393. ACM press, New York (1999)"},{"key":"82_CR10","unstructured":"Goil, S., Nagesh, H., Choudhary, A.: MAFIA: Efficient and scalable subspace clustering for very large data sets. Technical Report CPDC-TR-9906-010, Northwestern University, 2145 Sheridan Road, Evanston IL 60208 (June 1999)"},{"key":"82_CR11","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H., Kroger, P.: Density-connected Subspace Clustering for High-dimensional Data. In: Proc. 4th SIAM Int. Conf. on Data Mining, Lake Buena Vista, FL, pp. 246\u2013257 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"issue":"2","key":"82_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1214\/aoms\/1177698950","volume":"38","author":"A. Dempster","year":"1967","unstructured":"Dempster, A.: Upper and Lower Probabilities induced by multivalued mapping. Annals of Mathematical Statistics\u00a038(2), 325\u2013339 (1967)","journal-title":"Annals of Mathematical Statistics"},{"issue":"1-2","key":"82_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0004-3702(90)90103-7","volume":"44","author":"P. Orponen","year":"1990","unstructured":"Orponen, P.: Dempsster\u2019s rule of combination is #P- complete. Artificial Intelligence\u00a044(1-2), 245\u2013253 (1990)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"82_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1360\/jos170463","volume":"17","author":"Z. Jian-Wei","year":"2006","unstructured":"Jian-Wei, Z., Da-Wei, W., Yu, C., et al.: A Network Anomaly Detector Based on the D-S Evidence Theory. Journal of Software\u00a017(3), 463\u2013471 (2006)","journal-title":"Journal of Software"},{"issue":"5","key":"82_CR15","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1360\/crad20060510","volume":"43","author":"Z. Xiaoyun","year":"2006","unstructured":"Xiaoyun, Z., Zhihui, S., Baili, Z., et al.: An Efficient Discovering and Maintenance Algorithm of Subspace Clustering over High Dimensional Data Streams. Journal of Computer Research and Development\u00a043(5), 834\u2013840 (2006)","journal-title":"Journal of Computer Research and Development"}],"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_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:37:07Z","timestamp":1620002227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_82","relation":{},"subject":[]}}