{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:51:24Z","timestamp":1730299884627,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/tai.2003.1250237","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"537-541","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning large data to scale up lattice-based algorithm"],"prefix":"10.1109","author":[{"family":"Huaiguo Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.M.","family":"Nguifo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"How well go lattice algorithms on currently used machine learning testbeds?","author":"fu","year":"2003","journal-title":"ICFCA 2003 First International Conference on Formal Concept Analysis"},{"key":"ref3","article-title":"Algorithme de recherche des sous matrices premi&#x00E8;res d'une matrice","volume":"13","author":"chein","year":"1969","journal-title":"M R S Bull"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00108-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"ref5","article-title":"Two basic algorithms in concept analysis","author":"ganter","year":"1984","journal-title":"Technical Report"},{"key":"ref12","first-page":"290","article-title":"Building galois (concept) lattices from parts: Generalizing the incremental approach","author":"valtchev","year":"2001","journal-title":"Proc ICC 2001"},{"key":"ref8","article-title":"Journal of Experimental and Theoretical Artificial Intelligence (JETAl) Special Issue on Concept Lattice-based theory","author":"mephu nguifo","year":"2002","journal-title":"methods and tools for Knowledge Discovery in Databases"},{"key":"ref7","first-page":"105","article-title":"M&#x00E9;thodes de classification conceptuelle bas&#x00E9;s sur les treillis de galois et application","author":"godin","year":"1995","journal-title":"Revue d'Intelligence Artificielle"},{"key":"ref2","first-page":"31","article-title":"Calcul pratique du treillis de galois d'une correspondance","volume":"24","author":"bordat","year":"1986","journal-title":"Math&#x00E9;matiques Informatiques et Sciences Humaines"},{"key":"ref9","first-page":"243","article-title":"An algorithm for computing the maximal rectangles in a binary relation","volume":"xxiii","author":"norris","year":"1978","journal-title":"Rev Roumaine Math Pures Appl"},{"journal-title":"Lattice Theory","year":"1967","author":"birkhoff","key":"ref1"}],"event":{"name":"15th IEEE International Conference on Tools with Artificial Intelligence","acronym":"TAI-03","location":"Sacramento, CA, USA"},"container-title":["Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8840\/27974\/01250237.pdf?arnumber=1250237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T19:25:24Z","timestamp":1489433124000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250237\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/tai.2003.1250237","relation":{},"subject":[]}}