乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:39:11Z","timestamp":1725838751655},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662485767"},{"type":"electronic","value":"9783662485774"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48577-4_3","type":"book-chapter","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T10:06:05Z","timestamp":1448359565000},"page":"34-49","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Density-Based Subspace Clustering in High Dimensions"],"prefix":"10.1007","author":[{"given":"Ira","family":"Assent","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,25]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: SIGMOD, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1002\/widm.1062","volume":"2","author":"I Assent","year":"2012","unstructured":"Assent, I.: Clustering high dimensional data. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 2(4), 340\u2013350 (2012)","journal-title":"Wiley Interdisc. Rev. Data Min. Knowl. Discov."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Assent, I., Krieger, R., M\u00fcller, E., Seidl, T.: DUSC: dimensionality unbiased subspace clustering. In: ICDM, pp. 409\u2013414 (2007)","DOI":"10.1109\/ICDM.2007.49"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Assent, I., Krieger, R., M\u00fcller, E., Seidl, T.: EDSC: efficient density-based subspace clustering. In: CIKM, pp. 1093\u20131102 (2008)","DOI":"10.1145\/1458082.1458227"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Assent, I., Krieger, R., M\u00fcller, E., Seidl, T.: INSCY: indexing subspace clusters with in-process-removal of redundancy. In: ICDM, pp. 719\u2013724 (2008)","DOI":"10.1109\/ICDM.2008.46"},{"key":"3_CR6","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbor meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"3_CR8","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases. In: KDD, pp. 226\u2013231 (1996)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H.-P., Kr\u00f6ger, P.: Density-connected subspace clustering for high-dimensional data. In: SDM, pp. 246\u2013257 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/widm.30","volume":"1","author":"H-P Kriegel","year":"2011","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Sander, J., Zimek, A.: Density-based clustering. Wiley Interdisc. Rev. Data Min. Knowl. Disc. 1(3), 231\u2013240 (2011)","journal-title":"Wiley Interdisc. Rev. Data Min. Knowl. Disc."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H-P Kriegel","year":"2009","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Zimek, A.: Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans. Knowl. Discov. Data 3(1), 1:1\u20131:58 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Moise, G., Sander, J.: Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In: KDD, pp. 533\u2013541 (2008)","DOI":"10.1145\/1401890.1401956"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10115-009-0226-y","volume":"21","author":"G Moise","year":"2009","unstructured":"Moise, G., Zimek, A., Kr\u00f6ger, P., Kriegel, H.-P., Sander, J.: Subspace and projected clustering: experimental evaluation and analysis. Knowl. Inf. Syst. 21, 299\u2013326 (2009). doi:\n 10.1007\/s10115-009-0226-y","journal-title":"Knowl. Inf. Syst."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"M\u00fcller, E., Assent, I., G\u00fcnnemann, S., Krieger, R., Seidl, T.: Relevant subspace clustering: mining the most interesting non-redundant concepts in high dimensional data. In: ICDM, pp. 377\u2013386 (2009)","DOI":"10.1109\/ICDM.2009.10"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"M\u00fcller, E., Assent, I., G\u00fcnnemann, S., Seidl, T.: Scalable density-based subspace clustering. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 1077\u20131086. ACM (2011)","DOI":"10.1145\/2063576.2063733"},{"issue":"1","key":"3_CR17","first-page":"1270","volume":"2","author":"E M\u00fcller","year":"2009","unstructured":"M\u00fcller, E., G\u00fcnnemann, S., Assent, I., Seidl, T.: Evaluating clustering in subspace projections of high dimensional data. PVLDB 2(1), 1270\u20131281 (2009)","journal-title":"PVLDB"},{"issue":"1","key":"3_CR18","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.: Subspace clustering for high dimensional data: a review. SIGKDD Explor. 6(1), 90\u2013105 (2004)","journal-title":"SIGKDD Explor."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s10618-012-0258-x","volume":"26","author":"K Sim","year":"2012","unstructured":"Sim, K., Gopalkrishnan, V., Zimek, A., Cong, G.: A survey on enhanced subspace clustering. Data Min. Knowl. Discov. 26, 332\u2013397 (2012). online first","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Clustering High--Dimensional Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48577-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T13:25:13Z","timestamp":1559309113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48577-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662485767","9783662485774"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48577-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}