{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T12:04:43Z","timestamp":1707825883858},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,6,24]],"date-time":"2012-06-24T00:00:00Z","timestamp":1340496000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10115-012-0510-0","type":"journal-article","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T12:43:29Z","timestamp":1340455409000},"page":"525-552","source":"Crossref","is-referenced-by-count":2,"title":["Adapting ADtrees for improved performance on large datasets with high-arity features"],"prefix":"10.1007","volume":"35","author":[{"given":"Robert","family":"Van Dam","sequence":"first","affiliation":[]},{"given":"Irene","family":"Langkilde-Geary","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,24]]},"reference":[{"key":"510_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal D, Agrawal R, Khanna R, Kota N (2010) Estimating rates of rare events with multiple hierarchies through scalable log-linear models. In: Proceedings of the 16th ACM SIGKDD conference on knowledge discovery and data mining, pp 213\u2013222","DOI":"10.1145\/1835804.1835834"},{"key":"510_CR2","unstructured":"Anderson B, Moore A (1998) Adtrees for fast counting and for fast learning of association rules. In: Proceedings of the 4th international conference on knowledge discovery in data mining. AAAI Press, pp 134\u2013138"},{"issue":"9","key":"510_CR3","first-page":"509","volume":"18","author":"J Bentley","year":"1975","unstructured":"Bentley J (1975) Multidimensional binary search trees used for associative searching. Commun Assoc Comput Mach 18(9): 509\u2013517","journal-title":"Commun Assoc Comput Mach"},{"issue":"2","key":"510_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10115-010-0303-2","volume":"27","author":"H Chen","year":"2011","unstructured":"Chen H, Liu J, Furuse K, Yu JX, Ohbo N (2011) Indexing expensive functions for efficient multi-dimensional similarity search. Knowl Inf Syst 27(2): 165\u2013192","journal-title":"Knowl Inf Syst"},{"key":"510_CR5","doi-asserted-by":"crossref","unstructured":"Fuchs H, Kedem Z, Naylor B (1980) On visible surface generation by a priori tree structures. In: International conference on computer graphics and interactive techniques, pp 124\u2013133","DOI":"10.1145\/800250.807481"},{"issue":"2","key":"510_CR6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, Gunther O (1998) Multidimensional access methods. Assoc Comput Mach Comput Surv 30(2): 170\u2013231","journal-title":"Assoc Comput Mach Comput Surv"},{"issue":"2","key":"510_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10115-008-0185-8","volume":"22","author":"Z Huang","year":"2010","unstructured":"Huang Z, Sun S, Wang W (2010) Efficient mining of skyline objects in subspaces over data streams. Knowl Inf Syst 22(2): 159\u2013183","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"510_CR8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10115-010-0322-z","volume":"28","author":"Y Kim","year":"2011","unstructured":"Kim Y, Chung C-W, Lee S-L, Kim D-H (2011) Distance approximation techniques to reduce the dimensionality for multimedia databases. Knowl Inf Syst 28(1): 227\u2013248","journal-title":"Knowl Inf Syst"},{"key":"510_CR9","unstructured":"Komarek P, Moore A (2000) A dynamic adaptation of ad-trees for efficient machine learning on large data sets. In: Proceedings of the international conference on machine learning (ICML), pp 495\u2013502"},{"issue":"3","key":"510_CR10","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s10115-010-0343-7","volume":"29","author":"A Koufakou","year":"2011","unstructured":"Koufakou A, Secretan J, Georgiopoulos M (2011) Non-derivable itemsets for fast outlier detection in large high-dimensional categorical data. Knowl Inf Syst 29(3): 697\u2013725","journal-title":"Knowl Inf Syst"},{"key":"510_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.453","volume":"8","author":"A Moore","year":"1998","unstructured":"Moore A, Lee MS (1998) Cached sufficient statistics for efficient machine learning with large datasets. J Artif Intell Res 8: 67\u201391","journal-title":"J Artif Intell Res"},{"key":"510_CR12","doi-asserted-by":"crossref","unstructured":"Roure J, Moore A (2006) Sequential update of adtrees. In: Proceedings of the 23rd international conference on machine learning, pp 769\u2013776","DOI":"10.1145\/1143844.1143941"},{"key":"510_CR13","doi-asserted-by":"crossref","unstructured":"Rymon R (1993) An se-tree based characterization of the induction problem. In: International conference on machine learning, pp 268\u2013275","DOI":"10.1016\/B978-1-55860-307-3.50041-1"},{"key":"510_CR14","doi-asserted-by":"crossref","unstructured":"Toutanova K, Manning C (2000) Enriching the knowledge sources used in a maximum entropy part-of-speech tagger. In: Proceedings of the joint conference on empirical methods in natural language processing and very large corpora, pp 63\u201370","DOI":"10.3115\/1117794.1117802"},{"key":"510_CR15","unstructured":"University of Pennsylvania Linguistic Data Consortium (n.d.) http:\/\/www.ldc.upenn.edu\/"},{"key":"510_CR16","unstructured":"Van Dam R, Langkilde-Geary I, Ventura D (2008) Adapting adtrees for high arity features. In: Proceedings of the association for the advancement of artificial intelligence, pp 708\u2013713"},{"key":"510_CR17","unstructured":"Van Dam R, Ventura D (2007) Adtrees for sequential data and n-gram counting. In: Proceedings of the IEEE conference on systems, man, and cybernetics, pp 492\u2013497"},{"key":"510_CR18","doi-asserted-by":"crossref","unstructured":"Yu H-F, Hsieh C-J, Chang K-W, Lin C-J (2010) Large linear classification when data cannot fit in memory. In: Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 833\u2013842","DOI":"10.1145\/1835804.1835910"},{"issue":"1","key":"510_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10115-008-0190-y","volume":"22","author":"M Zhang","year":"2010","unstructured":"Zhang M, Alhajj R (2010) Effectiveness of naq-tree as index structure for similarity search in high-dimensional metric space. Knowl Inf Syst 22(1): 159\u2013183","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0510-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0510-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0510-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T07:10:42Z","timestamp":1561878642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0510-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,24]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["510"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0510-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,24]]}}}