{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:39:50Z","timestamp":1648975190531},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,12,25]],"date-time":"2014-12-25T00:00:00Z","timestamp":1419465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10489-014-0624-z","type":"journal-article","created":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T23:18:38Z","timestamp":1419376718000},"page":"777-789","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing contingency tables from sparse ADtrees"],"prefix":"10.1007","volume":"42","author":[{"given":"Fei","family":"Ding","sequence":"first","affiliation":[]},{"given":"Yi","family":"Zhuang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,25]]},"reference":[{"key":"624_CR1","unstructured":"Anderson B, Moore A (1998) ADtrees for fast counting and for fast learning of association rules. In: Proceedings of the Fourth International Conference on Knowledge Discovery in Data Mining. AAAI Press, pp 134\u2013138"},{"issue":"4","key":"624_CR2","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/s10489-012-0383-7","volume":"38","author":"S Benferhat","year":"2013","unstructured":"Benferhat S, Boudjelida A, Tabia K, Drias H (2013) An intrusion detection and alert correlation approach based on revising probabilistic classifiers using expert knowledge. Appl Intell 38(4):520\u2013540","journal-title":"Appl Intell"},{"issue":"01","key":"624_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1017\/S0269888910000378","volume":"26","author":"F Coenen","year":"2011","unstructured":"Coenen F (2011) Data mining: past, present and future. Knowl Eng Rev 26 (01):25\u201329. doi: 10.1017\/S0269888910000378","journal-title":"Knowl Eng Rev"},{"issue":"02","key":"624_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1017\/S0269888910000251","volume":"26","author":"R Daly","year":"2011","unstructured":"Daly R, Shen Q, Aitken S (2011) Learning bayesian networks: approaches and issues. Knowl Eng Rev 26 (02):99\u2013157. doi: 10.1017\/S0269888910000251","journal-title":"Knowl Eng Rev"},{"key":"624_CR5","unstructured":"Dam RV, Langkilde-Geary I, Ventura D (2008) Adapting ADtrees for high arity features. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence, pp 708\u2013713"},{"issue":"3","key":"624_CR6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10115-012-0510-0","volume":"35","author":"RV Dam","year":"2013","unstructured":"Dam RV, Langkilde-Geary I, Ventura D (2013) Adapting ADtrees for improved performance on large datasets with high-arity features. Knowl Inf Syst 35(3):525\u2013552. doi: 10.1007\/s10115-012-0510-0","journal-title":"Knowl Inf Syst"},{"key":"624_CR7","unstructured":"Dam RV, Ventura D (2007) ADtrees for sequential data and n-gram counting. In: IEEE International Conference on Systems Man and Cybernetics. IEEE, pp 492\u2013497"},{"key":"624_CR8","unstructured":"Darwiche A (2002) A logical approach to factoring belief networks. In: Proceedings of the Eight International Conference on Principles of Knowledge Representation and Reasoning, vol 2. Morgan Kaufmann, pp 409\u2013420"},{"issue":"4","key":"624_CR9","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1016\/j.future.2012.05.026","volume":"29","author":"K Ericson","year":"2013","unstructured":"Ericson K, Pallickara S (2013) On the performance of high dimensional data clustering and classification algorithms. Futur Gener Comput Syst 29(4):1024\u20131034. doi: 10.1016\/j.future.2012.05.026","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"624_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"RA Fisher","year":"1936","unstructured":"Fisher RA (1936) The use of multiple measurements in taxonomic problems. Ann of eugenics 7(2):179\u2013188","journal-title":"Ann of eugenics"},{"key":"624_CR11","doi-asserted-by":"crossref","unstructured":"Gao Y, Guan F (2008) Explore a new way to convert a recursion algorithm into a non-recursion algorithm. In: Computer And Computing Technologies In Agriculture, vol 1. Springer, pp 187\u2013193","DOI":"10.1007\/978-0-387-77251-6_21"},{"key":"624_CR12","doi-asserted-by":"crossref","unstructured":"Goldenberg A, Moore A (2004) Tractable learning of large bayes net structures from sparse data. In: Proceedings of the twenty-first international conference on Machine learning, ACM, ACM Press, New York, p 44. doi: 10.1145\/1015330.1015406","DOI":"10.1145\/1015330.1015406"},{"key":"624_CR13","unstructured":"Kdd cup 1999 (2014) Computer network intrusion detection .URL www.sigkdd.org\/kdd-cup-1999-computer-network-intrusiondetection . Accessed: 2014-10-05"},{"key":"624_CR14","unstructured":"Komarek P, Moore A (2000) A dynamic adaptation of AD-trees for efficient machine learning on large data sets. In: International Conference on Machine Learning"},{"issue":"1","key":"624_CR15","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(1):67\u201391","journal-title":"J Artif Intell Res"},{"key":"624_CR16","doi-asserted-by":"crossref","unstructured":"Moraleda J, Miller T (2003) AD+tree: A compact adaptation of dynamic AD-trees for efficient machine learning on large data sets. Data Eng Autom Learn pp. 313\u2013320","DOI":"10.1007\/978-3-540-45080-1_41"},{"key":"624_CR17","doi-asserted-by":"crossref","unstructured":"Roure J, Moore AW (2006) Sequential update of ADtrees. ACM Press, New York","DOI":"10.1145\/1143844.1143941"},{"key":"624_CR18","unstructured":"Stumbleupon evergreen classification challenge (2013) URL http:\/\/www.kaggle.com\/c\/stumbleupon . Accessed: 2014-10-05"},{"issue":"4","key":"624_CR19","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1162\/neco.2009.02-08-702","volume":"22","author":"JA Ting","year":"2010","unstructured":"Ting JA, D\u2019Souza A, Vijayakumar S, Schaal S (2010) Efficient learning and feature selection in high-dimensional regression. Neural Comput 22(4):831\u201386. doi: 10.1162\/neco.2009.02-08-702","journal-title":"Neural Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0624-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0624-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0624-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T19:49:36Z","timestamp":1566157776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0624-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,25]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["624"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0624-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,25]]}}}