{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:09:30Z","timestamp":1725563370838},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152450"},{"type":"electronic","value":"9783642152467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15246-7_20","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T02:28:27Z","timestamp":1282616907000},"page":"194-205","source":"Crossref","is-referenced-by-count":3,"title":["A Statistical Interestingness Measures for XML Based Association Rules"],"prefix":"10.1007","author":[{"given":"Izwan Nizal Mohd","family":"Shaharanee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fedja","family":"Hadzic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tharam S.","family":"Dillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Data mining: concepts and techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data mining: concepts and techniques. Morgan Kaufmann, San Francisco (2001)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Zhang, J., Ling, T.W., Bruckner, R.M., Tjoa, A.M., Liu, H.: On Efficient and Effective Association Rule Mining from XML Data. In: Proceedings of the 15th Int. Conf. Database and Expert Systems Applications, Zaragoza, Spain, pp. 497\u2013507 (2004)","DOI":"10.1007\/978-3-540-30075-5_48"},{"key":"20_CR3","first-page":"61","volume":"661","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent Subtree Mining - An Overview. Fundamenta Informaticae\u00a0661, 61\u2013198 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imieliski, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec.\u00a022, 207\u2013216 (1993)","journal-title":"ACM SIGMOD Rec."},{"key":"20_CR5","first-page":"18","volume-title":"Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"C.C. Aggarwal","year":"1998","unstructured":"Aggarwal, C.C., Yu, P.S.: A new framework for itemset generation. In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 18\u201324. ACM, Washington (1998)"},{"key":"20_CR6","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the 20th Int. Conf. on Very Large Data Bases, Santiago, Chile (1994)"},{"key":"20_CR7","unstructured":"Toivonen, H.: Sampling Large Databases for Association Rules. In: Proceedings of the 20th Int. Conf. on Very Large Data Bases, Mumbai, India, pp. 134\u2013145 (1996)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1009895914772","volume":"4","author":"R. Bayardo","year":"2000","unstructured":"Bayardo, R., Agrawal, R., Gunopulos, D.: Constraint-Based Rule Mining in Large, Dense Databases. J. Data Mining and Knowledge Discovery\u00a04, 217\u2013240 (2000)","journal-title":"J. Data Mining and Knowledge Discovery"},{"key":"20_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48751-4_17","volume-title":"Inductive Logic Programming","author":"N. Lavra\u010d","year":"1999","unstructured":"Lavra\u010d, N., Flach, P., Zupan, B.: Rule Evaluation Measures: A Unifying View. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 174\u2013185. Springer, Heidelberg (1999)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.ejor.2006.10.059","volume":"184","author":"P. Lenca","year":"2008","unstructured":"Lenca, P., Meyer, P., Vaillant, B., Lallich, S.: On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid. European Journal of Operational Research\u00a0184, 610\u2013626 (2008)","journal-title":"European Journal of Operational Research"},{"key":"20_CR11","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-10439-8_43","volume-title":"AI 2009: Advances in Artificial Intelligence","author":"I.N.M. Shaharanee","year":"2009","unstructured":"Shaharanee, I.N.M., Hadzic, F., Dillon, T.: Interestingness of Assocaition Rules Using Symmetrical Tau and Logistic Regression. In: Nicholson, A., Li, X. (eds.) AI 2009. LNCS (LNAI), vol.\u00a05866, pp. 422\u2013431. Springer, Heidelberg (2009)"},{"key":"20_CR12","first-page":"32","volume-title":"Proceedings of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"P.N. Tan","year":"2002","unstructured":"Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Proceedings of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 32\u201341. ACM, Alberta (2002)"},{"key":"20_CR13","first-page":"1","volume-title":"Machine Learning","author":"G.I. Webb","year":"2007","unstructured":"Webb, G.I.: Discovering Significant Patterns. In: Machine Learning, pp. 1\u201333. Springer, Heidelberg (2007)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0164-1212(02)00128-0","volume":"67","author":"H. Yun","year":"2003","unstructured":"Yun, H., Ha, D., Hwang, B., Ho Ryu, K.: Mining association rules on significant rare data using relative support. J. Systems and Software\u00a067, 181\u2013191 (2003)","journal-title":"J. Systems and Software"},{"key":"20_CR15","unstructured":"Tan, H., Hadzic, F., Dillon, T.S., Chang, E.: State of the art of data mining of tree structured information. Int. Journal of Computer Systems Science and Engineering\u00a023 (2008)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient Substructure Discovery from Large Semi-structured Data. In: Proc. of the 2nd SIAM Int. Conf. on Data Mining (SIAM 2002), pp. 158\u2013174 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Feng, L., Dillon, T., Weigand, H., Chang, E.: An XML-Enabled Association Rule Framework. Database and Expert Systems Applications, 88\u201397 (2003)","DOI":"10.1007\/978-3-540-45227-0_10"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1376815.1376818","volume":"2","author":"H. Tan","year":"2008","unstructured":"Tan, H., Hadzic, F., Dillon, T.S., Chang, E., Feng, L.: Tree model guided candidate generation for mining frequent subtrees from XML documents. ACM Trans. Knowl. Discov. Data\u00a02, 1\u201343 (2008)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/sam.10000","volume":"1","author":"A. Goodman","year":"2008","unstructured":"Goodman, A., Kamath, C., Kumar, V.: Data Analysis in the 21st Century. Stat. Anal. Data Mining\u00a01, 1\u20133 (2008)","journal-title":"Stat. Anal. Data Mining"},{"key":"20_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/0470114754","volume-title":"An Intro. to Categorical Data Analysis","author":"A. Agresti","year":"2007","unstructured":"Agresti, A.: An Intro. to Categorical Data Analysis. Wiley Interscience, New Jersey (2007)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Tan, H., Dillon, T., Hadzic, F., Chang, E., Feng, L.: IMB3-Miner: Mining Induced\/Embedded Subtrees by Constraining the Level of Embedding. In: Proceedings of the 8th Pacific-Asia Conference on Knowl. Discovery and Data Mining, pp. 450\u2013461 (2006)","DOI":"10.1007\/11731139_52"},{"key":"20_CR22","volume-title":"Proceedings of the 41st Annual Hawai Int. Conf. on System Sciences","author":"H. Fedja","year":"2008","unstructured":"Fedja, H., Tharam, S.D., Elizabeth, C.: Knowledge Analysis with Tree Patterns. In: Proceedings of the 41st Annual Hawai Int. Conf. on System Sciences. IEEE, Los Alamitos (2008)"},{"key":"20_CR23","unstructured":"Fedja, H., Henry, T., Tharam, S.D.: U3 - Mning Unordered Embedded Subtrees Using TMG Candidate Generation. In: The 1st ACM Int. Conf. on Web Search and Data Mining, California, USA (2008)"},{"key":"20_CR24","unstructured":"Tan, H., Dillon, T., Hadzic, F., Chang, E., Feng, L.: MB3-Miner: efficiently mining eMBedded subTREEs using Tree Model Guided candidate generation. In: Proceedings of the 1st Int. Workshop on Mining Complex Data 2005, Texas, USA (2005)"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications. IEEE Transactions on Knowledge and Data Engineering\u00a017, 1021\u20131035 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1022812808206","volume":"20","author":"Y. Aumann","year":"2003","unstructured":"Aumann, Y., Lindell, Y.: A Statistical Theory for Quantitative Association Rules. J. Intell. Inf. Syst.\u00a020, 255\u2013283 (2003)","journal-title":"J. Intell. Inf. Syst."},{"key":"20_CR27","unstructured":"Meggido, N., Srikant, R.: Discovering Predictive Association Rules. In: 4th International Conference on Knowledge Discovery in Databases and Data Mining, pp. 274\u2013278 (1998)"},{"key":"20_CR28","unstructured":"Webb, G.I.: Preliminary investigations into statistically valid exploratory rule discovery. In: Simoff, S.J., Williams, G.J., Hegland, M. (eds.) AusDM 2003, Sydney, pp. 1\u20139 (2003)"},{"key":"20_CR29","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-642-00399-8_7","volume-title":"New Frontiers in Applied Data Mining: PAKDD 2008 Int. Workshops, Japan, Revised Selected Papers","author":"T. Ozaki","year":"2009","unstructured":"Ozaki, T., Ohkawa, T.: Mining Mutually Dependent Ordered Subtrees in Tree Databases. In: New Frontiers in Applied Data Mining: PAKDD 2008 Int. Workshops, Japan, Revised Selected Papers, pp. 75\u201386. Springer, Heidelberg (2009)"},{"key":"20_CR30","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"X. Hui","year":"2006","unstructured":"Hui, X., Pang-Ning, T., Vipin, K.: Hyperclique pattern discovery. Data Min. Knowl. Discov.\u00a013, 219\u2013242 (2006)","journal-title":"Data Min. Knowl. Discov."},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Bathoorn, R., Koopman, A., Siebes, A.: Reducing the Frequent Pattern Set. In: Proceedings of the 6th IEEE International Conference on Data Mining \u2013 Workshops, pp. 55\u201359 (2006)","DOI":"10.1109\/ICDMW.2006.140"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Siebes, A., Vreeken, J., Leeuwen, M.V.: Item Sets That Compress. In: Proceedings of the SIAM Conference on Data Mining, Maryland, USA, pp. 393\u2013404 (2006)","DOI":"10.1137\/1.9781611972764.35"},{"key":"20_CR33","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1007\/11430919_101","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A. Nakamura","year":"2005","unstructured":"Nakamura, A., Kudo, M.: Mining Frequent Trees with Node-Inclusion Constraints. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 850\u2013860. Springer, Heidelberg (2005)"},{"key":"20_CR34","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining Association Rules with Item Constraints. In: 3rd Int. Conf. on Knowledge Discovery in Databases and Data Mining, Newport Beach, California, pp. 67\u201373 (1997)"},{"key":"20_CR35","unstructured":"Knijf, J.D., Feelders, A.J.: Monotone Constraints in Frequent Tree Mining. In: Poel, M., Nijholt, A. (eds.) BENELEARN, Enschede, The Netherlands, pp. 13\u201320 (2005)"},{"key":"20_CR36","series-title":"Lecture Notes in Artificial Intelligence","first-page":"272","volume-title":"Discovery Science","author":"H. Fedja","year":"2008","unstructured":"Fedja, H., Henry, T., Tharam, D.: Mining Unordered Distance-Constrained Embedded Subtrees. In: Boulicaut, J.-F., Berthold, M.R., Horv\u00e1th, T. (eds.) DS 2008. LNCS (LNAI), vol.\u00a05255, pp. 272\u2013283. Springer, Heidelberg (2008)"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Rusu, L.I., Rahayu, W., Taniar, D.: Extracting Variable Knowledge from Multiversioned XML Documents. In: 6th IEEE International Conference on Data Mining - Workshops (ICDMW 2006), pp. 70\u201374 (2006)","DOI":"10.1109\/ICDMW.2006.78"},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: SIGMOD Conference, Canada, pp. 433\u2013444 (2008)","DOI":"10.1145\/1376616.1376662"},{"key":"20_CR39","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1093\/bioinformatics\/btn293","volume":"24","author":"K. Hashimoto","year":"2008","unstructured":"Hashimoto, K., Takigawa, I., Shiga, M., Kanehisa, M., Mamitsuka, H.: Mining significant tree patterns in carbohydrate sugar chains. Bioinformatics\u00a024, 167\u2013173 (2008)","journal-title":"Bioinformatics"},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Aggarwal, C.C.: XRules: an effective structural classifier for XML data. In: SIGKDD 2003, Washington, DC (2003)","DOI":"10.1145\/956750.956787"},{"key":"20_CR41","volume-title":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"X. Wu","year":"2003","unstructured":"Wu, X., Barbar, D., Ye, Y.: Screening and interpreting multi-item associations based on log-linear modeling. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, Washington (2003)"},{"key":"20_CR42","unstructured":"Fedja, H., Tharam, S.D., Amandeep, S.S., Elizabeth, C., Henry, T.: Mining Substructures in Protein Data. In: Proceedings of the 6th IEEE Int. Conf. on Data Mining-Workshops (2006)"},{"key":"20_CR43","doi-asserted-by":"crossref","unstructured":"Zhou, X.J., Dillon, T.S.: A statistical-heuristic feature selection criterion for decision tree induction. IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)","DOI":"10.1109\/34.85676"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2010: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15246-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:03:28Z","timestamp":1606187008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15246-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152450","9783642152467"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15246-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}