{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:36:54Z","timestamp":1725568614238},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161834"},{"type":"electronic","value":"9783642161841"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16184-1_14","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:40:58Z","timestamp":1288690858000},"page":"189-204","source":"Crossref","is-referenced-by-count":8,"title":["Bridging Conjunctive and Disjunctive Search Spaces for Mining a New Concise and Exact Representation of Correlated Patterns"],"prefix":"10.1007","author":[{"given":"Nassima Ben","family":"Younes","sequence":"first","affiliation":[]},{"given":"Tarek","family":"Hamrouni","sequence":"additional","affiliation":[]},{"given":"Sadok Ben","family":"Yahia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on VLDB 1994, Santiago, Chile, pp. 487\u2013499 (1994)"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1147234.1147248","volume":"8","author":"S. Ben Yahia","year":"2006","unstructured":"Ben Yahia, S., Hamrouni, T., Mephu Nguifo, E.: Frequent closed itemset based algorithms: A thorough structural and analytical survey. ACM-SIGKDD Explorations\u00a08(1), 93\u2013104 (2006)","journal-title":"ACM-SIGKDD Explorations"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. In: Proceedings of the ACM SIGMOD International Conference on SIGMOD 1997, Tucson, Arizona, USA, pp. 265\u2013276 (1997)","DOI":"10.1145\/253260.253327"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Essential patterns: A perfect cover of frequent patterns. In: Proceedings of the 7th International Conference on DaWaK, Copenhagen, Denmark, pp. 428\u2013437 (2005)","DOI":"10.1007\/11546849_42"},{"key":"14_CR5","volume-title":"Bonferroni-type inequalities with applications","author":"J. Galambos","year":"2000","unstructured":"Galambos, J., Simonelli, I.: Bonferroni-type inequalities with applications. Springer, Heidelberg (2000)"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)"},{"key":"14_CR7","unstructured":"Hamrouni, T.: Mining concise representations of frequent patterns through conjunctive and disjunctive search spaces. Ph.D. Thesis, University of Tunis El Manar (Tunisia) and University of Artois (France) (2009), \n                  \n                    http:\/\/tel.archives-ouvertes.fr\/tel-00465733"},{"issue":"10","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1016\/j.datak.2009.05.001","volume":"68","author":"T. Hamrouni","year":"2009","unstructured":"Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets. Data & Knowledge Engineering\u00a068(10), 1091\u20131111 (2009)","journal-title":"Data & Knowledge Engineering"},{"key":"14_CR9","first-page":"422","volume-title":"Proceedings of the 23rd International Florida Artificial Intelligence Research Society Conference (FLAIRS 2010)","author":"T. Hamrouni","year":"2010","unstructured":"Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Optimized mining of a concise representation for frequent patterns based on disjunctions rather than conjunctions. In: Proceedings of the 23rd International Florida Artificial Intelligence Research Society Conference (FLAIRS 2010), pp. 422\u2013427. AAAI Press, Daytona Beach, Florida, USA (2010)"},{"key":"14_CR10","first-page":"223","volume":"44","author":"P. Jaccard","year":"1908","unstructured":"Jaccard, P.: Nouvelles recherches sur la distribution florale. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles\u00a044, 223\u2013270 (1908)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Ke, Y., Cheng, J., Yu, J.X.: Efficient discovery of frequent correlated subgraph pairs. In: Proceedings of the 9th IEEE International Conference on Data Mining, Miami, Florida, USA, pp. 239\u2013248 (2009)","DOI":"10.1109\/ICDM.2009.54"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Kim, W.Y., Lee, Y.K., Han, J.: CCMine: Efficient mining of confidence-closed correlated patterns. In: Proceedings of the 8th International Pacific-Asia Conference on KDD, Sydney, Australia, pp. 569\u2013579 (2004)","DOI":"10.1007\/978-3-540-24775-3_68"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-04394-9_43","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2009","author":"M. Kryszkiewicz","year":"2009","unstructured":"Kryszkiewicz, M.: Compressed disjunction-free pattern representation versus essential pattern representation. In: Corchado, E., Yin, H. (eds.) IDEAL 2009. LNCS, vol.\u00a05788, pp. 350\u2013358. Springer, Heidelberg (2009)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-1-4419-1280-0_4","volume":"8","author":"Y. Le Bras","year":"2010","unstructured":"Le Bras, Y., Lenca, P., Lallich, S.: Mining interesting rules without support requirement: a general universal existential upward closure property. Annals of Information Systems\u00a08, 75\u201398 (2010)","journal-title":"Annals of Information Systems"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Lee, Y.K., Kim, W.Y., Cai, Y.D., Han, J.: CoMine: Efficient mining of correlated patterns. In: Proceedings of the 3rd IEEE International Conference on Data Mining, Melbourne, Florida, USA, pp. 581\u2013584 (2003)","DOI":"10.1109\/ICDM.2003.1250982"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-44918-8_3","volume-title":"Quality Measures in Data Mining, Studies in Computational Intelligence","author":"P. Lenca","year":"2007","unstructured":"Lenca, P., Vaillant, B., Meyer, P., Lallich, S.: Association rule interestingness measures: Experimental and theoretical studies. In: Quality Measures in Data Mining, Studies in Computational Intelligence, vol.\u00a043, pp. 51\u201376. Springer, Heidelberg (2007)"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"E.R. Omiecinski","year":"2003","unstructured":"Omiecinski, E.R.: Alternative interest measures for mining associations in databases. IEEE Transactions on Knowledge and Data Engineering\u00a015(1), 57\u201369 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. Journal of Intelligent Information Systems\u00a024(1), 25\u201360 (2005)","journal-title":"Journal of Intelligent Information Systems"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s10618-008-0111-4","volume":"17","author":"A. Soulet","year":"2008","unstructured":"Soulet, A., Cr\u00e9milleux, B.: Adequate condensed representations of patterns. Data Mining and Knowledge Discovery\u00a017(1), 94\u2013110 (2008)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Proceedings of the 8th ACM SIGKDD International Conference on KDD, Edmonton, Alberta, Canada, pp. 32\u201341 (2002)","DOI":"10.1145\/775047.775053"},{"key":"14_CR22","unstructured":"Tanimoto, T.T.: An elementary mathematical theory of classification and prediction. Technical Report, I.B.M. Corporation Report (1958)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Wu, T., Chen, Y., Han, J.: Re-examination of interestingness measures in pattern mining: a unified framework. Data Mining and Knowledge Discovery (2010) doi: 10.1007\/s10618-009-0161-2","DOI":"10.1007\/s10618-009-0161-2"},{"issue":"2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H. Xiong","year":"2006","unstructured":"Xiong, H., Tan, P.N., Kumar, V.: Hyperclique pattern discovery. Data Mining and Knowledge Discovery\u00a013(2), 219\u2013242 (2006)","journal-title":"Data Mining and Knowledge Discovery"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16184-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:59:36Z","timestamp":1553201976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16184-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161834","9783642161841"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16184-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}