{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:42:27Z","timestamp":1725478947270},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540449119"},{"type":"electronic","value":"9783540449188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-44918-8_10","type":"book-chapter","created":{"date-parts":[[2007,1,16]],"date-time":"2007-01-16T17:50:43Z","timestamp":1168969843000},"page":"237-250","source":"Crossref","is-referenced-by-count":2,"title":["Towards a Unifying Probabilistic Implicative Normalized Quality Measure for Association Rules"],"prefix":"10.1007","author":[{"given":"Jean","family":"Diatta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri","family":"Ralambondrainy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Totohasina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1_Ref","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, Proc. of the ACM SIGMOD International Conference on Management of Data, volume 22, pages 207-216, Washington, 1993. ACM press.","DOI":"10.1145\/170035.170072"},{"key":"10_CR2_Ref","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, pages 487-499, 1994."},{"key":"10_CR3_Ref","first-page":"171","volume":"17","author":"J Az\u00e9","year":"2003","unstructured":"J. Az\u00e9. Une nouvelle mesure de qualit\u00e9 pour l\u2019extraction de p\u00e9pites de connaissances. Revue des Sciences et Technologies de l\u2019Information, 17:171-182, 2003.","journal-title":"Revue des Sciences et Technologies de l\u2019Information"},{"key":"10_CR4_Ref","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. of the ACM SIGMOD Conference, pages 85-93, 1998.","DOI":"10.1145\/276304.276313"},{"key":"10_CR5_Ref","unstructured":"J. Blanchard, F. Guillet, H. Brilland, and R. Gras. Assessing rule interestigness with a probabilistic measure of deviation from equilibrium. In Proc. of Applied stochastic Models and Data Analysis, pages 334-344, ENST Bretagne, France, 2005."},{"key":"10_CR6_Ref","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of the ACM SIGMOD Conference, pages 255-264, 1997.","DOI":"10.1145\/253260.253325"},{"key":"10_CR7_Ref","unstructured":"D. Feno, J. Diatta, and A. Totohasina. Normalis\u00e9e d\u2019une mesure probabiliste de qualit\u00e9 des r\u00e8gles d\u2019association: \u00e9tude de cas. In Actes du 2nd Atelier Qualit\u00e9 des Donn\u00e9es et des Connaissances, pages 25-30, Lille, France, 2006."},{"key":"10_CR8_Ref","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0950-7051(99)00019-2","volume":"12","author":"AA Freitas","year":"1999","unstructured":"A.A. Freitas. On rule interestingness measure. Knowledge-Based System, 12:309-315, 1999.","journal-title":"Knowledge-Based System"},{"key":"10_CR9_Ref","volume-title":"L\u2019implication statistique. Nouvelle m\u00e9thode exploratoire de donn\u00e9es","author":"R Gras","year":"1996","unstructured":"R. Gras. L\u2019implication statistique. Nouvelle m\u00e9thode exploratoire de donn\u00e9es. La Pen\u00e9e sauvage, France, 1996."},{"key":"10_CR10_Ref","unstructured":"S. Guillaume. Traitement des donn\u00e9es volumineuses. Mesures et algorithmes d\u2019extraction des r\u00e8gles d\u2019association et r\u00e8gles ordinales. PhD thesis, Universit\u00e9 de Nantes, France, 2000."},{"key":"10_CR11_Ref","unstructured":"R. J. Hilderman and H. J. Hamilton. Knowledge discovery and interestingness measures: A survey. Technical Report CS 99-04, Department of Computer Science, University of Regina, 1999."},{"key":"10_CR12_Ref","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"J Hipp","year":"2000","unstructured":"J. Hipp, U. G\u00fcntzer, and G. Nakhaeizadeh. Algorithms for Association Rule Mining - a General Survey and Comparison. SIGKDD Explorations, 2:58-64, 2000.","journal-title":"SIGKDD Explorations"},{"key":"10_CR13_Ref","volume-title":"Mining positive and negative Association Rules: an approach for confined rules. Technical report, Dept of Computing Sciences","author":"\u0131ane","year":"2004","unstructured":"\u0131ane. Mining positive and negative Association Rules: an approach for confined rules. Technical report, Dept of Computing Sciences, university of Alberta, Canada, 2004."},{"key":"10_CR14_Ref","unstructured":"Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Closed set based discovery of small covers for association rules. In Proc. 15emes Journees Bases de Donnees Avancees, BDA, pages 361-381, 1999."},{"issue":"5","key":"10_CR15_Ref","first-page":"68","volume":"11","author":"G Piatetsky-Shapiro","year":"1991","unstructured":"G. Piatetsky-Shapiro. Knowledge discovery in real databases. a report on the ijcai-86 workshop. AI Magazine, 11(5):68-70, 1991.","journal-title":"AI Magazine"},{"key":"10_CR16_Ref","unstructured":"A Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21th VLDB Conference, pages 432-444, September 1995."},{"key":"10_CR17_Ref","unstructured":"H. Toivonen. Sampling large databases for association rules. In Proc. of the 22nd VLDB Conference, pages 134-145, September 1994."},{"key":"10_CR18_Ref","unstructured":"A. Totohasina. Notes sur l\u2019implication statistique: d\u00e9pendance positive orient\u00e9e, valeurs critiques. Technical report, SCAD, Dept de Maths-Info, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, 1994."},{"key":"10_CR19_Ref","unstructured":"A. Totohasina. Normalization of probabilistic quality measure (in french). In Proc. French Society of Statistics (SFDS\u201903), XXVth Days of Statistics, volume 2, pages 958-988, Lyon 2, France, 2003."},{"issue":"3","key":"10_CR20_Ref","first-page":"381","volume":"22","author":"X Wu","year":"2004","unstructured":"X. Wu, C. Zhang, and S. Zhang. Mining both positive and negative rules. ACM J. Information Systems, 22(3):381-405, 2004.","journal-title":"Information Systems"},{"key":"10_CR21_Ref","unstructured":"M. J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed itemset mining, 1999. Technical Report 99-10, Computer Science, Rensselaer Polytechnic Institute, 1999."},{"key":"10_CR22_Ref","unstructured":"M. J. Zaki and M. Ogihara. Theoretical Foundations of Association Rules. In 3rd SIGMOD\u201998 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), pages 1-8, 1998."}],"container-title":["Studies in Computational Intelligence","Quality Measures in Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-44918-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:37:37Z","timestamp":1619998657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-44918-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540449119","9783540449188"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-44918-8_10","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2007]]}}}