{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:34Z","timestamp":1760596234507},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,5,3]],"date-time":"2014-05-03T00:00:00Z","timestamp":1399075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10115-014-0749-8","type":"journal-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T06:54:14Z","timestamp":1399013654000},"page":"497-527","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["PGLCM: efficient parallel mining of closed frequent gradual itemsets"],"prefix":"10.1007","volume":"43","author":[{"given":"Trong Dinh Thac","family":"Do","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Termier","sequence":"additional","affiliation":[]},{"given":"Anne","family":"Laurent","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Negrevergne","sequence":"additional","affiliation":[]},{"given":"Behrooz","family":"Omidvar-Tehrani","sequence":"additional","affiliation":[]},{"given":"Sihem","family":"Amer-Yahia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,3]]},"reference":[{"key":"749_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, 1994, pp 487\u2013499"},{"key":"749_CR2","first-page":"215","volume":"2001","author":"J Pei","year":"2001","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) Prefixspan: mining sequential patterns by prefix-projected growth. ICDE 2001:215\u2013224","journal-title":"ICDE"},{"key":"749_CR3","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Sakamoto H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: Proceedings of the second SIAM international conference on data mining (SDM2002), Arlington, VA, April 2002, pp 158\u2013174","DOI":"10.1137\/1.9781611972726.10"},{"key":"749_CR4","first-page":"13","volume":"2000","author":"A Inokuchi","year":"2000","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. PKDD 2000:13\u201323","journal-title":"PKDD"},{"key":"749_CR5","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: SIGMOD Conference 1996:1\u201312","DOI":"10.1145\/233269.233311"},{"issue":"3","key":"749_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1022812808206","volume":"20","author":"Y Aumann","year":"2003","unstructured":"Aumann Y, Lindell Y (2003) A statistical theory for quantitative association rules. J Intell Inf Syst 20(3):255\u2013283","journal-title":"J Intell Inf Syst"},{"key":"749_CR7","first-page":"793","volume":"2005","author":"T Washio","year":"2005","unstructured":"Washio T, Mitsunaga Y, Motoda H (2005) Mining quantitative frequent itemsets using adaptive density-based subspace clustering. ICDM 2005:793\u2013796","journal-title":"ICDM"},{"key":"749_CR8","doi-asserted-by":"crossref","unstructured":"Di Jorio L, Laurent A, Teisseire M (2009) Mining frequent gradual itemsets from large databases. In: International conference on intelligent data analysis, IDA\u201909, 2009","DOI":"10.1007\/978-3-642-03915-7_26"},{"key":"749_CR9","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:25\u201346","journal-title":"Inf Syst"},{"key":"749_CR10","unstructured":"Goethals B (2003\u20132004) Fimi repository website. http:\/\/fimi.cs.helsinki.fi\/ , 2003\u20132004"},{"key":"749_CR11","unstructured":"Uno T, Kiyomi M, Arimura H (2004) Lcm ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: FIMI, 2004"},{"key":"749_CR12","doi-asserted-by":"crossref","unstructured":"Negrevergne B, Termier A, Mehaut J-F, Uno T (2010) Discovering closed frequent itemsets on multicore: parallelizing computations and optimizing memory accesses. In: The 2010 International Conference on High Performance Computing and Simulation (HPCS 2010), 2010","DOI":"10.1109\/HPCS.2010.5547082"},{"key":"749_CR13","unstructured":"Negrevergne B (2011) A generic and parallel pattern mining algorithm for multi-core architectures. In: PhD dissertation, 2011"},{"key":"749_CR14","doi-asserted-by":"crossref","unstructured":"Arimura H, Uno T (2005) An output-polynomial time algorithm for mining frequent closed attribute trees. In: 15th international conference on inductive logic programming (ILP\u201905), 2005","DOI":"10.1007\/11536314_1"},{"issue":"5","key":"749_CR15","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1142\/S021848850700487X","volume":"15","author":"F Berzal","year":"2007","unstructured":"Berzal F, Cubero J-C, Sanchez D, Vila M-A, Serrano JM (2007) An alternative approach to discover gradual dependencies. Int J Uncertain Fuzziness Knowl Based Syst (IJUFKS) 15(5):559\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst (IJUFKS)"},{"key":"749_CR16","unstructured":"H\u00fcllermeier E (2002) Association rules for expressing gradual dependencies. In: Proceedings of the 6th European conference on principles of data mining and knowledge discovery, PKDD\u201902. Springer-Verlag 2002:200\u2013211"},{"key":"749_CR17","doi-asserted-by":"crossref","unstructured":"Laurent A, N\u00e9grevergne B, Sicard N, Termier A (2010) Pgp-mc: towards a multicore parallel approach for mining gradual patterns. In: DASFAA (1), 2010, pp 78\u201384","DOI":"10.1007\/978-3-642-12026-8_8"},{"key":"749_CR18","doi-asserted-by":"crossref","unstructured":"Ayouni S, Laurent A, Yahia SB, Poncelet P (2010) Mining closed gradual patterns. In: 10th international conference on artificial intelligence and soft computing, ICAISC 2010, ser. LNCS, vol 6113, 2010, pp 267\u2013274","DOI":"10.1007\/978-3-642-13208-7_34"},{"key":"749_CR19","unstructured":"Laurent A, Lesot M-J, Rifqi M (2009) Graank: exploiting rank correlations for extracting gradual dependencies. In Proceedings of FQAS\u2019 09:2009"},{"issue":"3","key":"749_CR20","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1214\/aoms\/1177732186","volume":"10","author":"M Kendall","year":"1939","unstructured":"Kendall M, Babington Smith B (1939) The problem of m rankings. Ann Math Stat 10(3):275\u2013287","journal-title":"Ann Math Stat"},{"key":"749_CR21","unstructured":"Lucchese C, Orlando S, Perego R (2004) Dci closed: a fast and memory efficient algorithm to mine frequent closed itemsets. In: FIMI, 2004"},{"key":"749_CR22","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume":"2004","author":"T Uno","year":"2004","unstructured":"Uno T, Asai T, Uchida Y, Arimura H (2004) An efficient algorithm for enumerating closed patterns in transaction databases. Discov Sci 2004:16\u201331","journal-title":"Discov Sci"},{"key":"749_CR23","doi-asserted-by":"crossref","unstructured":"Gelernter D (1989) Multiple tuple spaces in linda. 1989, pp 20\u201327. doi: 10.1007\/3-540-51285-3_30","DOI":"10.1007\/3-540-51285-3_30"},{"issue":"2","key":"749_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0165-0114(96)00066-8","volume":"84","author":"D Dubois","year":"1996","unstructured":"Dubois D, Prade H (1996) What are fuzzy rules and how to use them. Fuzzy Sets Syst 84(2):169\u2013185","journal-title":"Fuzzy Sets Syst"},{"key":"749_CR25","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0255(92)90035-7","volume":"61","author":"D Dubois","year":"1992","unstructured":"Dubois D, Prade H (1992) Gradual inference rules in approximate reasoning. Inf Sci 61:103\u2013122","journal-title":"Inf Sci"},{"key":"749_CR26","unstructured":"Dubois D, Prade H, Grabisch M (1995) Gradual rules and the approximation of control laws. In: Theoretical aspects of fuzzy control, pp 147\u2013181"},{"issue":"5","key":"749_CR27","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1002\/int.10103","volume":"18","author":"D Dubois","year":"2003","unstructured":"Dubois D, Prade H, Ughetto L (2003) A new perspective on reasoning with fuzzy rules. Int J Intell Syst 18(5):541\u2013567","journal-title":"Int J Intell Syst"},{"key":"749_CR28","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J, Hsu C-W (2007), Discriminative frequent pattern analysis for effective classification. In: International conference on data, engineering, pp 717\u2013725","DOI":"10.1109\/ICDE.2007.367917"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0749-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0749-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0749-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T02:08:45Z","timestamp":1565402925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0749-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,3]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["749"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0749-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,3]]}}}