{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T18:49:49Z","timestamp":1675277389684},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,19]],"date-time":"2012-08-19T00:00:00Z","timestamp":1345334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10115-012-0526-5","type":"journal-article","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T09:26:59Z","timestamp":1345282019000},"page":"655-684","source":"Crossref","is-referenced-by-count":3,"title":["Mining frequent conjunctive queries in relational databases through dependency discovery"],"prefix":"10.1007","volume":"33","author":[{"given":"Bart","family":"Goethals","sequence":"first","affiliation":[]},{"given":"Dominique","family":"Laurent","sequence":"additional","affiliation":[]},{"given":"Wim","family":"Le Page","sequence":"additional","affiliation":[]},{"given":"Cheikh Tidiane","family":"Dieng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,19]]},"reference":[{"key":"526_CR1","unstructured":"Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo A (1996) Fast discovery of association rules. In: Advances in knowledge discovery and data mining. AAAI-MIT Press, Cambridge, pp 309\u2013328"},{"key":"526_CR2","unstructured":"Baixeries J (2004) A formal concept analysis framework to mine functional dependencies. In: Int. workshop on mathematical methods for learning, pp 1\u20139"},{"key":"526_CR3","doi-asserted-by":"crossref","unstructured":"Baixeries J (2008) A formal context for symmetric dependencies. In: Formal concept analysis, 6th international conference, ICFCA, vol 4933 of lecture notes in computer science, Springer, Berlin, pp 90\u2013105","DOI":"10.1007\/978-3-540-78137-0_7"},{"key":"526_CR4","unstructured":"Baixeries J (2011) A new formal context for symmetric dependencies. In: Concept lattices and their applications, CLA, pp 333\u2013348 (INRIA)"},{"key":"526_CR5","doi-asserted-by":"crossref","unstructured":"Bohannon P, Fan W, Geerts F, Jia X, Kementsietsidis A (2007) Conditional functional dependencies for data cleaning. In: ICDE, pp 746\u2013755","DOI":"10.1109\/ICDE.2007.367920"},{"key":"526_CR6","doi-asserted-by":"crossref","unstructured":"Dehaspe L, Toivonen H (2001) Discovery of relational association rules. In: D\u017eeroski S, Lavra\u010d N (eds) Relational data mining. Springer, Berlin, pp 189\u2013208","DOI":"10.1007\/978-3-662-04599-2_8"},{"key":"526_CR7","doi-asserted-by":"crossref","unstructured":"Dieng C, Jen T-Y, Laurent D (2010) An efficient computation of frequent queries in a star schema. In: DEXA 2010, vol 6262(II) of LNCS, Springer, Berlin, pp 225\u2013239","DOI":"10.1007\/978-3-642-15251-1_18"},{"key":"526_CR8","doi-asserted-by":"crossref","unstructured":"Diop C, Giacometti A, Laurent D, Spyratos N (2002) Composition of mining contexts for efficient extraction of association rules. In: EDBT\u201902, vol 2287 of LNCS. Springer, Berlin, pp 106\u2013123","DOI":"10.1007\/3-540-45876-X_9"},{"key":"526_CR9","doi-asserted-by":"crossref","unstructured":"Goethals B, den Bussche JV (2002) Relational association rules: getting warmer. In: ESF exploratory workshop on pattern detection and discovery in data mining, vol 2447 of LNCS, Springer, Berlin, pp 125\u2013139","DOI":"10.1007\/3-540-45728-3_10"},{"key":"526_CR10","doi-asserted-by":"crossref","unstructured":"Goethals B, Hoekx E, den Bussche JV (2005) Mining tree queries in a graph. In: ACM KDD, pp 61\u201369","DOI":"10.1145\/1081870.1081881"},{"key":"526_CR11","doi-asserted-by":"crossref","unstructured":"Goethals B, Laurent D, Le Page W (2010) Discovery and application of functional dependencies in conjunctive query mining. In: DAWAK 2010, vol 6263 of LNCS, Springer, Berlin, pp 142\u2013156","DOI":"10.1007\/978-3-642-15105-7_12"},{"key":"526_CR12","doi-asserted-by":"crossref","unstructured":"Goethals B, Le Page W, Mannila H (2008) Mining association rules of simple conjunctive queries. In: SIAM-SDM, pp 96\u2013107","DOI":"10.1137\/1.9781611972788.9"},{"key":"526_CR13","doi-asserted-by":"crossref","unstructured":"Hoekx E, den Bussche JV (2006) Mining for tree-query associations in a graph. In: IEEE ICDM, pp 254\u2013264","DOI":"10.1109\/ICDM.2006.107"},{"key":"526_CR14","unstructured":"IMDB. http:\/\/imdb.com . 2008"},{"key":"526_CR15","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An Apriori-based algorithm for mining frequent substructures from graph data. In: PKDD, vol 1910 of LNCS, Springer, Berlin, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"526_CR16","unstructured":"Jen T-Y, Laurent D, Spyratos N (2008) Mining all frequent selection-projection queries from a relational table. In: EDBT\u201908, ACM Press, pp 368\u2013379"},{"key":"526_CR17","unstructured":"Jen T-Y, Laurent D, Spyratos N (2009) Mining frequent conjunctive queries in star schemas. In: International database engineering and applications symposium (IDEAS), ACM Press, pp 97\u2013108"},{"key":"526_CR18","unstructured":"Jen T-Y, Laurent D, Spyratos N, Sy O (2005) Towards mining frequent queries in star schemes. In: International workshop on knowledge discovery in databases (KDID), vol 3933 of LNCS, Springer, Berlin, pp 104\u2013123"},{"key":"526_CR19","doi-asserted-by":"crossref","unstructured":"Jensen V, Soparker N (2000) Frequent itemset counting across multiple tables. In: PAKDD, vol 1805 of lecture notes in computer science, Springer, Berlin, pp 49\u201361","DOI":"10.1007\/3-540-45571-X_8"},{"key":"526_CR20","unstructured":"Kamber M, Han J, Chiang J (1997) Metarule-guided mining of multi-dimensional association rules using data cubes. In: ACM KDD, pp 207\u2013210"},{"key":"526_CR21","volume-title":"The art of computer programming, vol. 4","author":"D Knuth","year":"2006","unstructured":"Knuth D (2006) The art of computer programming, vol. 4. Addison-Wesley, Reading"},{"key":"526_CR22","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: IEEE ICDM, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"526_CR23","doi-asserted-by":"crossref","unstructured":"Lakhal L, Stumme G (2005) Efficient mining of association rules based on formal concept analysis. In: Formal concept analysis, vol 3626 of lecture notes in computer science. Springer, Berlin, pp 180\u2013195","DOI":"10.1007\/11528784_10"},{"key":"526_CR24","unstructured":"Le Page W (2009) Mining patterns in relational databases. PhD thesis, University of Antwerp, Antwerp"},{"issue":"2\u20133","key":"526_CR25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/09528130210164143","volume":"14","author":"S Lopes","year":"2002","unstructured":"Lopes S, Petit J-M, Lakhal L (2002) Functional and approximative dependency mining: database and FCA points of view. J Exp Theor Artif Intell 14(2\u20133):93\u2013114","journal-title":"J Exp Theor Artif Intell"},{"key":"526_CR26","unstructured":"Ng E, Fu A, Wang K (2002) Mining association rules from stars. In: IEEE-ICDM, pp 322\u2013329"},{"key":"526_CR27","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2003) Efficient frequent query discovery in FARMER. In: PKDD 2003, vol 2838 of LNCS, Springer, Berlin, pp 350\u2013362","DOI":"10.1007\/978-3-540-39804-2_32"},{"key":"526_CR28","doi-asserted-by":"crossref","unstructured":"Novelli N, Cicchetti R (2001) FUN: an efficient algorithm for mining functional and embedded dependencies. In: International conference on database theory (ICDT), vol 1973 of LNCS, Springer, Berlin, pp 189\u2013203","DOI":"10.1007\/3-540-44503-X_13"},{"issue":"1","key":"526_CR29","doi-asserted-by":"crossref","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 (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1):25\u201346","journal-title":"Inf Syst"},{"key":"526_CR30","first-page":"153","volume":"5","author":"G Plotkin","year":"1970","unstructured":"Plotkin G (1970) A note on inductive generalization. Mach Intell 5:153\u2013163","journal-title":"Mach Intell"},{"key":"526_CR31","unstructured":"Ullman J (1988\u20131989) Principles of databases and knowledge-base systems, vol 1\u20132. Computer Science Press, Rockville"},{"key":"526_CR32","unstructured":"Weisstein EW (2009) Restricted growth string. In: A Wolfram web resource ( http:\/\/mathword.wolfram.com\/RestrictedGrowthString.html )"},{"key":"526_CR33","unstructured":"Wyss C-M, Giannella C, Robertson E-L (2001) FastFDs: a heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. In: DAWAK, vol 2114 of LNCS, Springer, Berlin, pp 101\u2013110"},{"key":"526_CR34","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: IEEE ICDM, pp 721\u2013724"},{"issue":"2","key":"526_CR35","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10618-007-0083-9","volume":"16","author":"H Yao","year":"2008","unstructured":"Yao H, Hamilton HJ (2008) Mining functional dependencies from data. Data Min Know Discov 16(2):197\u2013219","journal-title":"Data Min Know Discov"},{"key":"526_CR36","doi-asserted-by":"crossref","unstructured":"Zaki M (2002) Efficiently mining frequent trees in a forest. In: ACM KDD, pp 71\u201380","DOI":"10.1145\/775047.775058"},{"issue":"4","key":"526_CR37","first-page":"462","volume":"17","author":"M Zaki","year":"2005","unstructured":"Zaki M, Hsiao C-J (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE-TKDE 17(4):462\u2013478","journal-title":"IEEE-TKDE"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0526-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0526-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0526-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T23:32:59Z","timestamp":1562110379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0526-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,19]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["526"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0526-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,19]]}}}