{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:29Z","timestamp":1725551969669},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322030"},{"type":"electronic","value":"9783540322047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671404_12","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T07:03:57Z","timestamp":1137999837000},"page":"177-190","source":"Crossref","is-referenced-by-count":2,"title":["Interactive Association Rules Discovery"],"prefix":"10.1007","author":[{"given":"Raoul","family":"Medina","sequence":"first","affiliation":[]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Raynaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD 1993, Washington, USA (1993)","DOI":"10.1145\/170035.170072"},{"key":"12_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: 20th International Conference of Very Large DataBasis (VLDB), Santiago, Chile, September 1994, pp. 487\u2013499 (1994)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: SIGMOD 1997 (1997)","DOI":"10.1145\/253260.253325"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(92)90028-9","volume":"40","author":"J. Demetrovics","year":"1992","unstructured":"Demetrovics, J., Libkin, L., Muchnik, I.B.: Functional dependencies in relational databases: A lattice point of view. Discrete Applied Mathematics\u00a040(2), 155\u2013185 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR5","unstructured":"Duquenne, V., Guigues, J.-L.: Famille minimale d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques Sciences Humaines\u00a024 (1986)"},{"key":"12_CR6","volume-title":"Mathematical foundation","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal concept analysis. In: Mathematical foundation. Springer, Heidelberg (1999)"},{"key":"12_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-32262-7_16","volume-title":"Formal Concept Analysis","author":"A. Gely","year":"2005","unstructured":"Gely, A., Medina, R., Nourine, L., Renaud, Y.: Uncovering and reducing hidden combinatorics in guigues-duquenne covers. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 235\u2013248. Springer, Heidelberg (2005)"},{"issue":"2","key":"12_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0304-3975(94)90195-3","volume":"133","author":"R. Godin","year":"1994","unstructured":"Godin, R., Missaoui, R.: An incremental concept formation approach for learning from databases. Theoritical Computer Science: Special issue on formal methods in databases and softwear engineering\u00a0133(2), 387\u2013419 (1994)","journal-title":"Theoritical Computer Science: Special issue on formal methods in databases and softwear engineering"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM-SIGMOD International Conference on Management of Data. Dallas, Texas, USA (2000)","DOI":"10.1145\/342009.335372"},{"key":"12_CR10","unstructured":"Hilderman, R.J., Hamilton, H.J.: Knowledge discovery and interestingness measures: a survey. Technical report CS99-04, Departement of computer science, University of Regina (1999)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/568574.568582","volume":"4","author":"J. Hipp","year":"2002","unstructured":"Hipp, J., Guentzer, U.: Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations\u00a04(1), 50\u201355 (2002)","journal-title":"SIGKDD Explorations"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"J. Hipp","year":"2000","unstructured":"Hipp, J., Guentzer, U., Nakhaeizadeh, G.: Algorithms for association rules mining - a general survey and comparison. SIGKDD Exploration\u00a02(1), 58\u201364 (2000)","journal-title":"SIGKDD Exploration"},{"key":"12_CR13","unstructured":"Maier, D.: The theory of relational data bases, Computer Science Press Rockville (1983)"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(92)90031-5","volume":"40","author":"H. Manilla","year":"1992","unstructured":"Manilla, H., R\u00e4ih\u00e4, K.J.: On the complexity of inferring functionnal dependencies. Discret Applied Mathematics\u00a040(2), 237\u2013243 (1992)","journal-title":"Discret Applied Mathematics"},{"key":"12_CR15","unstructured":"Medina, R., Noyer, C., Raynaud, O.: Efficient algorithms for clone items detection. In: CLA 2005, pp. 70\u201381 (2005)"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"12_CR17","unstructured":"Pasquier, N., Bastides, Y., Taouil, R., Lakhal, L.: Closed set based discovery of small covers for association rules. In: Proceeding in BDA conf., October 1999, pp. 361\u2013381 (1999)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671404_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:14:14Z","timestamp":1619493254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671404_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322030","9783540322047"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11671404_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}