{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:31:41Z","timestamp":1725503501945},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781363"},{"type":"electronic","value":"9783540781370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78137-0_6","type":"book-chapter","created":{"date-parts":[[2008,2,13]],"date-time":"2008-02-13T23:34:46Z","timestamp":1202945686000},"page":"78-89","source":"Crossref","is-referenced-by-count":4,"title":["From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit"],"prefix":"10.1007","author":[{"given":"Ben","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Eklund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"libferris visited April 2007, \n                  \n                    http:\/\/witme.sf.net\/libferris.web\/"},{"key":"6_CR2","first-page":"487","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases, VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. 20th Int. Conf. Very Large Data Bases, VLDB, 12\u201315\u00a0 1994, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"6_CR3","unstructured":"Blake, C., Merz, C.: UCI Repository of Machine Learning Databases. In: Irvine, CA: University of California, Department of Information and Computer Science (1998), \n                  \n                    http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"6_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0470011297","volume-title":"Concept Data Analysis","author":"C. Carpineto","year":"2004","unstructured":"Carpineto, C., Romano, G.: Concept Data Analysis. Wiley, England (2004)"},{"key":"6_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis \u2014 Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis \u2014 Mathematical Foundations. Springer\u2013Verlag, Berlin Heidelberg (1999)"},{"key":"6_CR6","unstructured":"Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: Report on fimi\u201903. In: Goethals, B., Zaki, M.J. (eds.) Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations. CEUR Workshop Proceedings, vol.\u00a090 (2003)"},{"key":"6_CR7","unstructured":"Grahne, O., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Goethals, B., Zaki, M.J. (eds.) Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Ceur (2003)"},{"key":"6_CR8","volume-title":"Data mining : concepts and techniques","author":"J. Han","year":"2001","unstructured":"Han, J.: Data mining: concepts and techniques. Morgan Kaufmann Publishers, San Francisco (2001)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"2000 ACM SIGMOD Intl. Conference on Management of Data","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J., Bernstein, P.A. (eds.) 2000 ACM SIGMOD Intl. Conference on Management of Data, pp. 1\u201312. ACM Press, New York (2000)"},{"key":"6_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11671404_14","volume-title":"Formal Concept Analysis","author":"B. Martin","year":"2006","unstructured":"Martin, B., Eklund, P.W.: Spatial Indexing for Scalability in FCA. In: Missaoui, R., Schmid, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03874, pp. 205\u2013220. Springer, Heidelberg (2006)"},{"key":"6_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70901-5_6","volume-title":"Formal Concept Analysis","author":"B. Martin","year":"2007","unstructured":"Martin, B., Eklund, P.W.: Custom asymmetric page split generalized index search trees and formal concept analysis. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol.\u00a04390, Springer, Heidelberg (2007)"},{"key":"6_CR12","unstructured":"Mueller, A.: Fast sequential and parallel algorithms for association rule mining: A comparison. Technical Report CS-TR-3515, Departure of Computer Science, University of Maryland, College Park, MD (1995)"},{"key":"6_CR13","unstructured":"Pei, J.: Pattern-growth methods for frequent pattern mining, ph.d. thesis, computing science, simon fraser university (2001)"},{"key":"6_CR14","unstructured":"Pietracaprina, A., Zendolin, D.: Mining frequent itemsets using patricia tries. In: Goethals, B., Zaki, M.J. (eds.) Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Ceur (2003)"},{"key":"6_CR15","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., et al.: Fast discovery of association rules. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., et al.: Computing iceberg concept lattices with titanic. J. on Knowledge and Data Engineering (KDE)\u00a042, 189\u2013222 (2002)","journal-title":"J. on Knowledge and Data Engineering (KDE)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. Knowledge and Data Engineering\u00a012, 372\u2013390 (2000)","journal-title":"Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78137-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:59:15Z","timestamp":1619506755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78137-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781363","9783540781370"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78137-0_6","relation":{},"subject":[]}}