{"id":"https://openalex.org/W2159799222","doi":"https://doi.org/10.1109/isip.2008.60","title":"MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets","display_name":"MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2159799222","doi":"https://doi.org/10.1109/isip.2008.60","mag":"2159799222"},"language":"en","primary_location":{"id":"doi:10.1109/isip.2008.60","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isip.2008.60","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposiums on Information Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103223191","display_name":"Shiguang Ju","orcid":"https://orcid.org/0000-0001-6839-4489"},"institutions":[{"id":"https://openalex.org/I115592961","display_name":"Jiangsu University","ror":"https://ror.org/03jc41j30","country_code":"CN","type":"education","lineage":["https://openalex.org/I115592961"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shiguang Ju","raw_affiliation_strings":["School of Computer Science and Telecommunication Engineering, Jiangsu University, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Telecommunication Engineering, Jiangsu University, China","institution_ids":["https://openalex.org/I115592961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100418374","display_name":"Chen Chen","orcid":"https://orcid.org/0000-0001-7747-5109"},"institutions":[{"id":"https://openalex.org/I115592961","display_name":"Jiangsu University","ror":"https://ror.org/03jc41j30","country_code":"CN","type":"education","lineage":["https://openalex.org/I115592961"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chen Chen","raw_affiliation_strings":["School of Computer Science and Telecommunication Engineering, Jiangsu University, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Telecommunication Engineering, Jiangsu University, China","institution_ids":["https://openalex.org/I115592961"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103223191"],"corresponding_institution_ids":["https://openalex.org/I115592961"],"apc_list":null,"apc_paid":null,"fwci":2.5379,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.92168138,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"144","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9657999873161316,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7347266674041748},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.718233585357666},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6390233635902405},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6122944951057434},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5356279015541077},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47392067313194275},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.45240268111228943},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4502715766429901},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.41450604796409607},{"id":"https://openalex.org/keywords/gsp-algorithm","display_name":"GSP Algorithm","score":0.41297006607055664},{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.3342338800430298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19053655862808228},{"id":"https://openalex.org/keywords/apriori-algorithm","display_name":"Apriori algorithm","score":0.16667327284812927},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1178833544254303}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7347266674041748},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.718233585357666},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6390233635902405},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6122944951057434},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5356279015541077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47392067313194275},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.45240268111228943},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4502715766429901},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.41450604796409607},{"id":"https://openalex.org/C87146676","wikidata":"https://www.wikidata.org/wiki/Q5514602","display_name":"GSP Algorithm","level":4,"score":0.41297006607055664},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.3342338800430298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19053655862808228},{"id":"https://openalex.org/C81440476","wikidata":"https://www.wikidata.org/wiki/Q513511","display_name":"Apriori algorithm","level":3,"score":0.16667327284812927},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1178833544254303},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isip.2008.60","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isip.2008.60","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 International Symposiums on Information Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1484413656","https://openalex.org/W2064853889","https://openalex.org/W2138660495","https://openalex.org/W2141115288","https://openalex.org/W2151953639","https://openalex.org/W2159257592","https://openalex.org/W2166559705","https://openalex.org/W4241634004","https://openalex.org/W4252403066","https://openalex.org/W6628750762"],"related_works":["https://openalex.org/W2106878563","https://openalex.org/W2376949134","https://openalex.org/W3034345083","https://openalex.org/W1483188779","https://openalex.org/W2157620887","https://openalex.org/W2348452205","https://openalex.org/W4389611318","https://openalex.org/W2383811731","https://openalex.org/W2981042271","https://openalex.org/W2138381621"],"abstract_inverted_index":{"Existing":[0],"algorithms":[1],"for":[2,31,62,99],"mining":[3,32,100],"maximal":[4,33,101],"frequent":[5,22,34,73,102],"itemsets":[6,35],"have":[7,18],"to":[8,19],"do":[9],"superset":[10,68],"checking,":[11],"and":[12,49,51,88,117],"some":[13],"of":[14,85],"them":[15],"using":[16],"FP-tree":[17],"construct":[20],"conditional":[21,72],"pattern":[23,74],"trees":[24,75],"recursively.":[25],"We":[26,81],"present":[27],"a":[28,37,52],"novel":[29],"algorithm":[30,87,113],"from":[36],"transactional":[38],"database.":[39],"In":[40],"the":[41,43,64,79,83,86],"algorithm,":[42],"FP-Tree":[44],"data":[45],"structure":[46],"is":[47,60,76,105,114],"used":[48,61],"adapted,":[50],"new":[53],"strategy":[54],"called":[55],"ldquoNBNrdquo":[56],"(Node":[57],"By":[58],"Node)":[59],"traversing":[63],"adapted":[65],"FP-Tree.":[66],"Neither":[67],"checking":[69],"nor":[70],"constructing":[71],"needed":[77],"in":[78],"algorithm.":[80],"analyze":[82],"performance":[84],"compare":[89],"our":[90,112],"method":[91],"with":[92],"existing":[93],"algorithms.":[94],"Our":[95],"technique":[96],"works":[97],"better":[98],"itemsets.":[103],"It":[104],"also":[106],"proved":[107],"by":[108],"experimental":[109],"comparison":[110],"that":[111],"more":[115],"fast":[116],"efficient.":[118]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}