{"id":"https://openalex.org/W1982932027","doi":"https://doi.org/10.1109/tkde.2002.1000342","title":"Pincer-search: an efficient algorithm for discovering the maximum frequent set","display_name":"Pincer-search: an efficient algorithm for discovering the maximum frequent set","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W1982932027","doi":"https://doi.org/10.1109/tkde.2002.1000342","mag":"1982932027"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2002.1000342","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2002.1000342","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-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/A5112761996","display_name":"Dao-I Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dao-I Lin","raw_affiliation_strings":["Redback Networks, Inc., San Jose, CA, USA","[Redback Networks, Inc., San Jose, CA, USA]"],"affiliations":[{"raw_affiliation_string":"Redback Networks, Inc., San Jose, CA, USA","institution_ids":[]},{"raw_affiliation_string":"[Redback Networks, Inc., San Jose, CA, USA]","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017861669","display_name":"Zvi M. Kedem","orcid":"https://orcid.org/0000-0002-1353-4584"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Z.M. Kedem","raw_affiliation_strings":["Department of Computer Science, New York University, New York, NY, USA","Dept. of Comput. Sci., New York Univ., New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New York University, New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]},{"raw_affiliation_string":"Dept. of Comput. Sci., New York Univ., New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112761996"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.2563,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.96198405,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"553","last_page":"566"},"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.9921000003814697,"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/T11106","display_name":"Data Management and Algorithms","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.741231381893158},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.602320671081543},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.586297333240509},{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.5861330628395081},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5580360293388367},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5382262468338013},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5136789679527283},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4570174515247345},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42168182134628296}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.741231381893158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.602320671081543},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.586297333240509},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.5861330628395081},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5580360293388367},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5382262468338013},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5136789679527283},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4570174515247345},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42168182134628296},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/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":2,"locations":[{"id":"doi:10.1109/tkde.2002.1000342","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2002.1000342","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.4954","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.4954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.zmkedem.com/nyu/pubs/LK1999b.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.46000000834465027}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307102","display_name":"Intel Corporation","ror":"https://ror.org/01ek73717"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W17085541","https://openalex.org/W20722260","https://openalex.org/W69052479","https://openalex.org/W1482472192","https://openalex.org/W1483679765","https://openalex.org/W1506285740","https://openalex.org/W1520890006","https://openalex.org/W1544139368","https://openalex.org/W1556507321","https://openalex.org/W1576562444","https://openalex.org/W1578959085","https://openalex.org/W1597161471","https://openalex.org/W1597561788","https://openalex.org/W1601529450","https://openalex.org/W1641039719","https://openalex.org/W1676134498","https://openalex.org/W1861465509","https://openalex.org/W2009207944","https://openalex.org/W2030969394","https://openalex.org/W2032226242","https://openalex.org/W2037965136","https://openalex.org/W2054784808","https://openalex.org/W2064853889","https://openalex.org/W2093456341","https://openalex.org/W2108457969","https://openalex.org/W2121317427","https://openalex.org/W2125227861","https://openalex.org/W2137860515","https://openalex.org/W2141115288","https://openalex.org/W2143631149","https://openalex.org/W2144481322","https://openalex.org/W2157086973","https://openalex.org/W2165372900","https://openalex.org/W2166559705","https://openalex.org/W4252403066","https://openalex.org/W4285719527","https://openalex.org/W6600660766","https://openalex.org/W6600858539","https://openalex.org/W6602777731","https://openalex.org/W6628973722","https://openalex.org/W6630198464","https://openalex.org/W6633359351","https://openalex.org/W6634775095","https://openalex.org/W6635637936","https://openalex.org/W6652859727","https://openalex.org/W6676223305","https://openalex.org/W6678222878","https://openalex.org/W6681307243"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2745001401","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W4246352526","https://openalex.org/W2028665553","https://openalex.org/W2086519370","https://openalex.org/W2087343574","https://openalex.org/W2045020414"],"abstract_inverted_index":{"Discovering":[0],"frequent":[1,42,47,55,63,75,88,139,175],"itemsets":[2,56,76,89],"is":[3,65,110,117,126,143,165],"a":[4,33,94,114,133],"key":[5],"problem":[6,30],"in":[7,32,120,154],"important":[8,160],"data":[9,135],"mining":[10],"applications,":[11],"such":[12],"as":[13],"the":[14,60,86,100,103,121,137,155,163,179,182],"discovery":[15],"of":[16,85,162,173,181],"association":[17],"rules,":[18,20],"strong":[19],"episodes,":[21],"and":[22,49,102,131,191],"minimal":[23],"keys.":[24],"Typical":[25],"algorithms":[26,69],"for":[27,129],"solving":[28],"this":[29],"operate":[31],"bottom-up,":[34,112],"breadth-first":[35],"search":[36,108,116,125],"direction.":[37,123],"The":[38,106],"computation":[39],"starts":[40],"from":[41],"1-itemsets":[43],"(the":[44],"minimum":[45],"length":[46],"itemsets)":[48],"continues":[50],"until":[51],"all":[52,73],"maximal":[53,74,87],"(length)":[54],"are":[57,77,90],"found.":[58],"During":[59],"execution,":[61],"every":[62,174],"itemset":[64],"explicitly":[66],"considered.":[67],"Such":[68],"perform":[70],"well":[71],"when":[72,83],"short.":[78],"However,":[79],"performance":[80,180],"drastically":[81],"deteriorates":[82],"some":[84],"long.":[91],"We":[92,177],"present":[93],"new":[95,134],"algorithm":[96,164,183],"which":[97],"combines":[98],"both":[99],"bottom-up":[101,156],"top-down":[104,122],"searches.":[105],"primary":[107],"direction":[109],"still":[111],"but":[113],"restricted":[115],"also":[118],"conducted":[119],"This":[124],"used":[127,144],"only":[128],"maintaining":[130],"updating":[132],"structure,":[136],"maximum":[138],"candidate":[140],"set.":[141],"It":[142],"to":[145],"prune":[146],"early":[147],"candidates":[148],"that":[149,166],"would":[150],"be":[151],"normally":[152],"encountered":[153],"search.":[157],"A":[158],"very":[159],"characteristic":[161],"it":[167],"does":[168],"not":[169],"require":[170],"explicit":[171],"examination":[172],"itemset.":[176],"evaluate":[178],"using":[184],"well-known":[185],"synthetic":[186],"benchmark":[187],"databases,":[188],"real-life":[189],"census,":[190],"stock":[192],"market":[193],"databases.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}