{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T06:05:42Z","timestamp":1709273142268},"reference-count":19,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Info. Know. Mgmt."],"published-print":{"date-parts":[[2018,9]]},"abstract":" This paper describes an efficient algorithm for formal concepts generation in large formal contexts. While many algorithms exist for concept generation, they are not suitable for generating concepts efficiently on larger contexts. We propose an algorithm named as HaLoopUNCG algorithm based on MapReduce framework that uses a lightweight runtime environment called HaLoop. HaLoop, a modified version of Hadoop MapReduce, suits better for iterative algorithms over large datasets. Our approach uses the features of HaLoop efficiently to generate concepts in an iterative manner. First, we describe the theoretical concepts of formal concept analysis and HaLoop. Second, we provide a detailed representation of our work based on Lindig\u2019s fast concept analysis algorithm using HaLoop and MapReduce framework. The experimental evaluations demonstrate that HaLoopUNCG algorithm is performing better than Hadoop version of upper neighbour concept generation (MRUNCG) algorithm, MapReduce implementation of Ganter\u2019s next closure algorithm and other distributed implementations of concept generation algorithms. <\/jats:p>","DOI":"10.1142\/s0219649218500296","type":"journal-article","created":{"date-parts":[[2018,8,16]],"date-time":"2018-08-16T10:08:34Z","timestamp":1534414114000},"page":"1850029","source":"Crossref","is-referenced-by-count":7,"title":["HaLoop Approach for Concept Generation in Formal Concept Analysis"],"prefix":"10.1142","volume":"17","author":[{"given":"Raghavendra K.","family":"Chunduri","sequence":"first","affiliation":[{"name":"School of Information Technology and Engineering, Vellore Institute of Technology, Vellore 632014, Tamil Nadu, India"}]},{"given":"Aswani Kumar","family":"Cherukuri","sequence":"additional","affiliation":[{"name":"School of Information Technology and Engineering, Vellore Institute of Technology, Vellore 632014, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2018,10,2]]},"reference":[{"issue":"1","key":"S0219649218500296BIB003","first-page":"31","volume":"96","author":"Bordat JP","year":"1986","journal-title":"Math\u00e9matiques et Sciences Humanies"},{"key":"S0219649218500296BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0269-7"},{"key":"S0219649218500296BIB006","doi-asserted-by":"publisher","DOI":"10.5430\/air.v5n2p40"},{"key":"S0219649218500296BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2007.02.001"},{"key":"S0219649218500296BIB009","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"Ganter B","year":"1994"},{"key":"S0219649218500296BIB012","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2012.648457"},{"key":"S0219649218500296BIB013","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-4936-1.ch011"},{"key":"S0219649218500296BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.09.026"},{"issue":"1","key":"S0219649218500296BIB015","first-page":"46","volume":"109","author":"Kumar CA","year":"2015","journal-title":"Mathematics and Computers in Simulation"},{"issue":"1","key":"S0219649218500296BIB016","first-page":"37","volume":"24","author":"Kuznetsov S","year":"1989","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"issue":"5","key":"S0219649218500296BIB017","first-page":"11","volume":"27","author":"Kuznetsov S","year":"1993","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"key":"S0219649218500296BIB019","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1088"},{"issue":"2","key":"S0219649218500296BIB021","first-page":"243","volume":"23","author":"Norris E","year":"1978","journal-title":"Revue Roumaine des Mathematiques Pure ser Appliquees"},{"key":"S0219649218500296BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00108-8"},{"key":"S0219649218500296BIB023","doi-asserted-by":"publisher","DOI":"10.1002\/aris.1440400120"},{"key":"S0219649218500296BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.07.038"},{"key":"S0219649218500296BIB025","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-014-0313-6"},{"key":"S0219649218500296BIB026","doi-asserted-by":"publisher","DOI":"10.1515\/amcs-2016-0035"},{"issue":"1","key":"S0219649218500296BIB027","first-page":"1258","volume":"69","author":"\u0160kopljanac-Ma\u010dina F","year":"2013","journal-title":"Procedia Engineering"}],"container-title":["Journal of Information & Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219649218500296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:33:59Z","timestamp":1565184839000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219649218500296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":19,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2018,10,2]]},"published-print":{"date-parts":[[2018,9]]}},"alternative-id":["10.1142\/S0219649218500296"],"URL":"https:\/\/doi.org\/10.1142\/s0219649218500296","relation":{},"ISSN":["0219-6492","1793-6926"],"issn-type":[{"value":"0219-6492","type":"print"},{"value":"1793-6926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}