The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Itemsets with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1995-1999 (30) 2000 (28) 2001 (36) 2002 (50) 2003 (70) 2004 (108) 2005 (122) 2006 (123) 2007 (129) 2008 (132) 2009 (103) 2010 (71) 2011 (51) 2012 (58) 2013 (61) 2014 (75) 2015 (62) 2016 (75) 2017 (79) 2018 (76) 2019 (76) 2020 (55) 2021 (51) 2022 (50) 2023 (51) 2024 (7)
Publication types (Num. hits)
article(619) incollection(17) inproceedings(1184) phdthesis(9)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 838 occurrences of 283 keywords

Results
Found 1829 publication records. Showing 1829 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
109Peien Feng, Hui Zhang, Qingying Qiu, Zhaoxia Wang PCAR: An Efficient Approach for Mining Association Rules. Search on Bibsonomy FSKD (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
105Jia-Ling Koh, Ching-Yi Lin Concept Shift Detection for Frequent Itemsets from Sliding Windows over Data Streams. Search on Bibsonomy DASFAA Workshops The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Data Streams, Change Detection, Frequent Itemsets
105Jouni K. Seppänen, Heikki Mannila Dense itemsets. Search on Bibsonomy KDD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF frequent itemsets, error tolerance
101Tsuyoshi Taniguchi, Makoto Haraguchi An Algorithm for Mining Implicit Itemset Pairs Based on Differences of Correlations. Search on Bibsonomy Discovery Science The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
98Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Muntz Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Data streams, Incremental learning, Sliding window, Closed frequent itemset
98Juho Muhonen, Hannu Toivonen Closed Non-derivable Itemsets. Search on Bibsonomy PKDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
98Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Muntz Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. Search on Bibsonomy ICDM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
96R. V. Nataraj, S. Selvan A framework for mining top-k frequent closed itemsets using order preserving generators. Search on Bibsonomy Bangalore Compute Conf. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF mining methods, data mining, algorithms, closed itemsets
96Daniel Kunkle, Donghui Zhang, Gene Cooperman Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF frequent generalized itemsets, redundancy avoidance, generalized association rules
96Soon M. Chung, Congnan Luo Efficient mining of maximal frequent itemsets from databases on a cluster of workstations. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Scalability, Association rules, Parallel data mining, Maximal frequent itemsets
96Tae-Su Park, Ju-Hong Lee, Sang Ho Park, Bumghi Choi, Deok-Hwan Kim Search Method of Time Sensitive Frequent Itemsets in Data Streams. Search on Bibsonomy CIARP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Data Mining, Data Stream, Frequent Itemsets
95Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin Lin An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream. Search on Bibsonomy IEA/AIE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Data Mining, Data Stream, Frequent Itemsets, Frequent Closed Itemsets
91Don-Lin Yang, Ching-Ting Pan, Yeh-Ching Chung An Efficient Hash-Based Method for Discovering the Maximal Frequent Set. Search on Bibsonomy COMPSAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF the HMFS method, data mining, association rules, frequent itemsets
89Irene Ntoutsi, Yannis Theodoridis Comparing Datasets Using Frequent Itemsets: Dependency on the Mining Parameters. Search on Bibsonomy SETN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
89Guojie Song, Dongqing Yang, Bin Cui 0001, Baihua Zheng, Yunfeng Liu, Kunqing Xie CLAIM: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data. Search on Bibsonomy DASFAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
88Jiayin Feng, Jiadong Ren MMFI_DSSW - A New Method to Incrementally Mine Maximal Frequent Itemsets in Transaction Sensitive Sliding Window. Search on Bibsonomy KSEM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF algorithm, data streams, maximal frequent itemsets
86Bai-En Shie, Vincent S. Tseng, Philip S. Yu Online mining of temporal maximal utility itemsets from data streams. Search on Bibsonomy SAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF maximal itemsets, temporal high utility itemsets, data stream mining, utility mining
84Vincent S. Tseng, Cheng-Wei Wu, Bai-En Shie, Philip S. Yu UP-Growth: an efficient algorithm for high utility itemset mining. Search on Bibsonomy KDD The full citation details ... 2010 DBLP  DOI  BibTeX  RDF candidate pruning, high utility itemset, frequent itemset, utility mining
83Salvatore Ruggieri Frequent regular itemset mining. Search on Bibsonomy KDD The full citation details ... 2010 DBLP  DOI  BibTeX  RDF closed and free itemsets, concise representations
81Zequn Zhou, Christie I. Ezeife A Low-Scan Incremental Association Rule Maintenance Method Based on the Apriori Property. Search on Bibsonomy AI The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Maintaining Mining Asociation Rules, High Level Large Itemsets, Low Level Large Itemsets, Apriori Property
81Mirko Böttcher, Martin Spott, Rudolf Kruse A Condensed Representation of Itemsets for Analyzing Their Evolution over Time. Search on Bibsonomy ECML/PKDD (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
81Xiangjun Dong, Zhendong Niu, Donghua Zhu 0001, Zhiyun Zheng, Qiuting Jia Mining Interesting Infrequent and Frequent Itemsets Based on MLMS Model. Search on Bibsonomy ADMA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
81Jie Dong, Min Han IFCIA: An Efficient Algorithm for Mining Intertransaction Frequent Closed Itemsets. Search on Bibsonomy FSKD (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
81Xu-dong Song, Kun Zhai, Xiao-bing Liu The Efficient and Complete Frequent Itemsets Mining of Association Rules. Search on Bibsonomy FSKD (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
81Hassan H. Malik, John R. Kender High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets. Search on Bibsonomy ICDM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
79Bo He, Yue Wang, Wu Yang, Yuan Chen Fast Algorithm for Mining Global Frequent Itemsets Based on Distributed Database. Search on Bibsonomy RSKT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Global frequent itemsets, distributed database, FP-tree, FP-growth
79Kai Chen Mining Frequent Closed Itemsets Without Candidate Generation. Search on Bibsonomy ISPA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF data mining, association rule, stack, frequent closed itemsets
75Li Yang 0008 Pruning and Visualizing Generalized Association Rules in Parallel Coordinates. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF data mining, Association rules, data visualization, mining methods and algorithms, interactive data exploration
75Dao-I Lin, Zvi M. Kedem Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF maximum frequent set, Pincer Search, maximum frequent candidate set, Data mining, association rule, knowledge discovery
75Dao-I Lin, Zvi M. Kedem Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. Search on Bibsonomy EDBT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
74Toon Calders, Bart Goethals Non-derivable itemset mining. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Data mining, Itemsets, Condensed representation
72Nikolaj Tatti, Jilles Vreeken Finding Good Itemsets by Packing Data. Search on Bibsonomy ICDM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
72Kun Li, Yongyan Wang, M. Ellahi, Hongan Wang Mining Recent Frequent Itemsets in Data Streams. Search on Bibsonomy FSKD (4) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
72Wassim Ayadi, Khedija Arour A Binary Decision Diagram to discover low threshold support frequent itemsets. Search on Bibsonomy DEXA Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF data mining, association rules, binary decision diagram, frequent item sets
72Jianyong Wang 0001, Jiawei Han 0001, Ying Lu 0001, Petre Tzvetkov TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
72Ningthoujam Gourakishwar Singh, Sanasam Ranbir Singh, Anjana Kakoti Mahanta CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets. Search on Bibsonomy ICDM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
72Taneli Mielikäinen Transaction Databases, Frequent Itemsets, and Their Condensed Representations. Search on Bibsonomy KDID The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
72Toon Calders, Bart Goethals Mining All Non-derivable Frequent Itemsets. Search on Bibsonomy PKDD The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
71Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Single-pass algorithm, Landmark window, Data mining, Data streams, Frequent itemsets
71Wassim Ayadi, Khedija Arour A Novel Parallel Boolean Approach for Discovering Frequent Itemsets. Search on Bibsonomy ICDM Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Data mining, Association rules, Binary decision diagram, Frequent itemsets, Parallel data mining
71Nan Jiang, Le Gruenwald CFI-Stream: mining closed frequent itemsets in data streams. Search on Bibsonomy KDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF association rules, data stream, frequent closed itemsets
71Xuegang Hu, Haitao Yu The Research of Sampling for Mining Frequent Itemsets. Search on Bibsonomy RSKT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF weighted sampling, statistical optimal sample size, Data Mining, association rule, frequent itemsets
71Roman Tesar, Vaclav Strnad, Karel Jezek, Massimo Poesio Extending the single words-based document model: a comparison of bigrams and 2-itemsets. Search on Bibsonomy ACM Symposium on Document Engineering The full citation details ... 2006 DBLP  DOI  BibTeX  RDF bigrams, machine learning, feature selection, text categorization, comparison, n-grams, document model, itemsets
71Joong Hyuk Chang, Won Suk Lee Effect of Count Estimation in Finding Frequent Itemsets over Online Transactional Data Streams. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF count estimation, transactional data streams, frequent itemsets
71Yin-Ling Cheung, Ada Wai-Chee Fu Mining Frequent Itemsets without Support Threshold: With and without Item Constraints. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF N-most interesting itemsets, item constraints, Association rules, FP-tree
71Soon Myoung Chung, Congnan Luo Parallel Mining of Maximal Frequent Itemsets from Databases. Search on Bibsonomy ICTAI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF scalability, association rules, Parallel data mining, maximal frequent itemsets
70Claudio Lucchese, Salvatore Orlando 0001, Raffaele Perego 0001 Fast and Memory Efficient Mining of Frequent Closed Itemsets. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF high-performance algorithms, Data mining, association rules, frequent itemsets, condensed representations, closed itemsets
67R. Uday Kiran, P. Krishna Reddy An improved multiple minimum support based approach to mine rare association rules. Search on Bibsonomy CIDM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
67Hsuan-Shih Lee On-Line Association Rules Mining with Dynamic Support. Search on Bibsonomy KES (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
67Shichao Zhang 0001, Jeffrey Xu Yu, Jingli Lu, Chengqi Zhang Is Frequency Enough for Decision Makers to Make Decisions?. Search on Bibsonomy PAKDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
64Marzena Kryszkiewicz, Henryk Rybinski, Marcin Gajek Dataless Transitions Between Concise Representations of Frequent Patterns. Search on Bibsonomy J. Intell. Inf. Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF data mining, knowledge discovery, frequent itemsets, closed itemsets, concise representation
64Nikolaj Tatti Probably the best itemsets. Search on Bibsonomy KDD The full citation details ... 2010 DBLP  DOI  BibTeX  RDF bayesian model selection, decomposable models, exponential models, MCMC, junction tree, itemset mining
64En Tzu Wang, Arbee L. P. Chen A novel hash-based approach for mining frequent itemsets over data streams requiring less memory space. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hash-based approach, Data mining, Data stream, Frequent itemset, False positive
64Jin Qian, Feiyue Ye Mining Maximal Frequent Itemsets with Frequent Pattern List. Search on Bibsonomy FSKD (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
64Xuegang Hu, Wei Liu, Dexing Wang, Xindong Wu 0001 Mining Frequent Itemsets Using a Pruned Concept Lattice. Search on Bibsonomy FSKD (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
64Junbo Chen, Shanping Li GC-Tree: A Fast Online Algorithm for Mining Frequent Closed Itemsets. Search on Bibsonomy PAKDD Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
64Tianming Hu, Qian Fu, Xiaonan Wang 0002, Sam Yuan Sung Mining Maximum Length Frequent Itemsets: A Summary of Results. Search on Bibsonomy ICTAI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
64Lei Jia, Jun Yao, Renqing Pei Mining Association Rules with Frequent Closed Itemsets Lattice. Search on Bibsonomy KES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
64Lei Jia, Jun Yao, Renqing Pei Using Loose and Tight Bounds to Mine Frequent Itemsets. Search on Bibsonomy KES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
64Kritsada Sriphaew, Thanaruk Theeramunkong A new method for finding generalized frequent itemsets in generalized association rule mining. Search on Bibsonomy ISCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
64Brock Barber, Howard J. Hamilton Parametric Algorithms for Mining Share-Frequent Itemsets. Search on Bibsonomy ISMIS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
63Congnan Luo, Anil L. Pereira, Soon Myoung Chung Distributed Mining of Maximal Frequent Itemsets on a Data Grid System. Search on Bibsonomy J. Supercomput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF scalability, association rules, Data Grid, distributed data mining, maximal frequent itemsets
63Arno J. Knobbe, Eric K. Y. Ho Maximally informative k-itemsets and their efficient discovery. Search on Bibsonomy KDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF joint entropy, maximally informative k-itemsets, feature selection, information theory, subgroup discovery, binary data
61Yongyan Wang, Kun Li, Hongan Wang Maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams. Search on Bibsonomy CIDM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
59Kun-Ta Chuang, Jiun-Long Huang, Ming-Syan Chen Mining top-k frequent patterns in the presence of the memory constraint. Search on Bibsonomy VLDB J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
59Junbo Chen, Bo Zhou 0010 TGC-Tree: An Online Algorithm Tracing Closed Itemset and Transaction Set Simultaneously. Search on Bibsonomy LKR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
59Wontae Hwang, Dongseung Kim Improved Association Rule Mining by Modified Trimming. Search on Bibsonomy CIT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
59Jong Soo Park, Ming-Syan Chen, Philip S. Yu An Effective Hash Based Algorithm for Mining Association Rules. Search on Bibsonomy SIGMOD Conference The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
56Guimei Liu, Jinyan Li 0001, Limsoon Wong A new concise representation of frequent itemsets using generators and a positive border. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Positive border, Data mining, Generator, Frequent itemset mining, Concise representation
56Carson Kai-Sang Leung, Pourang Irani, Christopher L. Carmichael WiFIsViz: Effective Visualization of Frequent Itemsets. Search on Bibsonomy ICDM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
56Haifeng Li 0006, Zongjian Lu, Hong Chen 0001 Mining Approximate Closed Frequent Itemsets over Stream. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF stream, closed frequent itemset
56Lisheng Ma, Yi Qi An Efficient Algorithm for Frequent Closed Itemsets Mining. Search on Bibsonomy CSSE (4) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
56Jian Hu, Yang-Li Xiang A New Fast Frequent Itemsets Mining Algorithm Based on Forest. Search on Bibsonomy FSKD (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
56Bashar Saleh, Florent Masseglia Time Aware Mining of Itemsets. Search on Bibsonomy TIME The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
56Alva Erwin, Raj P. Gopalan, N. R. Achuthan Efficient Mining of High Utility Itemsets from Large Datasets. Search on Bibsonomy PAKDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF High Utility Mining, Pattern Growth
56Arianna Gallo, Tijl De Bie, Nello Cristianini MINI: Mining Informative Non-redundant Itemsets. Search on Bibsonomy PKDD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
56Ho Jin Woo, Won Suk Lee estMax: Tracing Maximal Frequent Itemsets over Online Data Streams. Search on Bibsonomy ICDM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
56Xiangjun Dong, Gang Li, Hongguo Wang, Yuebin Guo, Yueyue Yang Mining Infrequent Itemsets Based on Extended MMS Model. Search on Bibsonomy ICIC (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
56Bo Liu 0062, Jiuhui Pan A Graph-Based Algorithm for Mining Maximal Frequent Itemsets. Search on Bibsonomy FSKD (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
56Jinze Liu, Susan Paulsen, Wei Wang 0010, Andrew B. Nobel, Jan F. Prins Mining Approximate Frequent Itemsets from Noisy Data. Search on Bibsonomy ICDM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Xiaoming Yang, Zhibin Wang, Bing Liu 0009, Shouzhi Zhang, Wei Wang 0009, Bole Shi Non-Almost-Derivable Frequent Itemsets Mining. Search on Bibsonomy CIT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Zhi-Hong Deng, Xin Li, Shi-Wei Tang An Efficient Approach for Interactive Mining of Frequent Itemsets. Search on Bibsonomy WAIM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Duckjin Chai, Heeyoung Choi, Buhyun Hwang Discovering Frequent Itemsets Using Transaction Identifiers. Search on Bibsonomy FSKD (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang 0001 A Fast Algorithm for Mining Share-Frequent Itemsets. Search on Bibsonomy APWeb The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
56Soon M. Chung, Congnan Luo Distributed mining of maximal frequent itemsets from databases on a cluster of workstations. Search on Bibsonomy CCGRID The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
56Kritsada Sriphaew, Thanaruk Theeramunkong Mining Generalized Closed Frequent Itemsets of Generalized Association Rules. Search on Bibsonomy KES The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
54James Cheng, Yiping Ke, Wilfred Ng A survey on algorithms for mining frequent itemsets over data streams. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Window models, Approximate algorithms, Frequent itemsets, Stream mining
54Nikolaj Tatti Maximum entropy based significance of itemsets. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Binary data mining, Maximum entropy, Itemsets
54Shiguang Ju, Chen Chen MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets. Search on Bibsonomy ISIP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF data mining, association rules, maximal frequent itemsets
54B. Kalpana, R. Nadarajan, J. Senthil Babu A Galois Lattice framework to handle updates in the mining of closed itemsets in dynamic databases. Search on Bibsonomy Bangalore Compute Conf. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF association rules, incremental mining, Galois Lattices, closed frequent itemsets
54Haifeng Li 0006, Hong Chen 0001 Improve Frequent Closed Itemsets Mining over Data Stream with Bitmap. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF stream, bitmap, frequent closed itemsets
54Yanbin Ye, Chia-Chu Chiang A Parallel Apriori Algorithm for Frequent Itemsets Mining. Search on Bibsonomy SERA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Frequent Itemsets Mining (FIM), Data Mining, Parallel Computing, Association Rules, Apriori
53Karam Gouda, Mohammed Javeed Zaki GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF maximal itemsets, data mining, association rules, frequent itemsets, backtracking search
53Joong Hyuk Chang, Won Suk Lee Finding recent frequent itemsets adaptively over online data streams. Search on Bibsonomy KDD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF decay mechanism, delayed-insertion, pruning of itemsets, recent frequent itemsets, data stream
53Fuzan Chen, Minqiang Li An Efficiently Algorithm Based on Itemsets-Lattice and Bitmap Index for Finding Frequent Itemsets. Search on Bibsonomy FSKD (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
53K. K. Loo, Chi Lap Yip, Ben Kao, David Wai-Lok Cheung Exploiting the Duality of Maximal Frequent Itemsets and Minimal Infrequent Itemsets for I/O Efficient Association Rule Mining. Search on Bibsonomy DEXA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Data mining, association rules, lattice
50Willie Ng, Manoranjan Dash Which Is Better for Frequent Pattern Mining: Approximate Counting or Sampling?. Search on Bibsonomy DaWaK The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
50Ying-Hsiang Wen, Jen-Wei Huang, Ming-Syan Chen Hardware-Enhanced Association Rule Mining with Hashing and Pipelining. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hardware-enhanced mining, data mining, Association Rules
50Mitica Craus A New Parallel Algorithm for the Frequent Itemset Mining Problem. Search on Bibsonomy ISPDC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
50Huaiguo Fu, Mícheál Ó Foghlú A Distributed Algorithm of Density-Based Subspace Frequent Closed Itemset Mining. Search on Bibsonomy HPCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1829 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license