Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
109 | Peien Feng, Hui Zhang, Qingying Qiu, Zhaoxia Wang |
PCAR: An Efficient Approach for Mining Association Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (2) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 2, pp. 605-609, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
105 | Jia-Ling Koh, Ching-Yi Lin |
Concept Shift Detection for Frequent Itemsets from Sliding Windows over Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA Workshops ![In: Database Systems for Advanced Applications, DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20-23, 2009, pp. 334-348, 2009, Springer, 978-3-642-04204-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Data Streams, Change Detection, Frequent Itemsets |
105 | Jouni K. Seppänen, Heikki Mannila |
Dense itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, August 22-25, 2004, pp. 683-688, 2004, ACM, 1-58113-888-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
frequent itemsets, error tolerance |
101 | Tsuyoshi Taniguchi, Makoto Haraguchi |
An Algorithm for Mining Implicit Itemset Pairs Based on Differences of Correlations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 8th International Conference, DS 2005, Singapore, October 8-11, 2005, Proceedings, pp. 227-240, 2005, Springer, 3-540-29230-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
98 | Yun 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](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 10(3), pp. 265-294, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Data streams, Incremental learning, Sliding window, Closed frequent itemset |
98 | Juho Muhonen, Hannu Toivonen |
Closed Non-derivable Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings, pp. 601-608, 2006, Springer, 3-540-45374-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
98 | Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Muntz |
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 1-4 November 2004, Brighton, UK, pp. 59-66, 2004, IEEE Computer Society, 0-7695-2142-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
96 | R. V. Nataraj, S. Selvan |
A framework for mining top-k frequent closed itemsets using order preserving generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bangalore Compute Conf. ![In: Proceedings of the 2nd Bangalore Annual Compute Conference, Compute 2009, Bangalore, India, January 9-10, 2009, pp. 3, 2009, ACM, 978-1-60558-476-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
mining methods, data mining, algorithms, closed itemsets |
96 | Daniel Kunkle, Donghui Zhang, Gene Cooperman |
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 23(1), pp. 77-102, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
frequent generalized itemsets, redundancy avoidance, generalized association rules |
96 | Soon M. Chung, Congnan Luo |
Efficient mining of maximal frequent itemsets from databases on a cluster of workstations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 16(3), pp. 359-391, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Scalability, Association rules, Parallel data mining, Maximal frequent itemsets |
96 | Tae-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](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis and Applications, 11th Iberoamerican Congress in Pattern Recognition, CIARP 2006, Cancun, Mexico, November 14-17, 2006, Proceedings, pp. 511-518, 2006, Springer, 3-540-46556-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Data Mining, Data Stream, Frequent Itemsets |
95 | Show-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](Pics/bibsonomy.png) |
IEA/AIE ![In: Next-Generation Applied Intelligence, 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2009, Tainan, Taiwan, June 24-27, 2009. Proceedings, pp. 767-776, 2009, Springer, 978-3-642-02567-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Data Mining, Data Stream, Frequent Itemsets, Frequent Closed Itemsets |
91 | Don-Lin Yang, Ching-Ting Pan, Yeh-Ching Chung |
An Efficient Hash-Based Method for Discovering the Maximal Frequent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 25th International Computer Software and Applications Conference (COMPSAC 2001), Invigorating Software Development, 8-12 October 2001, Chicago, IL, USA, pp. 511-516, 2001, IEEE Computer Society, 0-7695-1372-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
the HMFS method, data mining, association rules, frequent itemsets |
89 | Irene Ntoutsi, Yannis Theodoridis |
Comparing Datasets Using Frequent Itemsets: Dependency on the Mining Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETN ![In: Artificial Intelligence: Theories, Models and Applications, 5th Hellenic Conference on AI, SETN 2008, Syros, Greece, October 2-4, 2008. Proceedings, pp. 212-225, 2008, Springer, 978-3-540-87880-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
89 | Guojie 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](Pics/bibsonomy.png) |
DASFAA ![In: Advances in Databases: Concepts, Systems and Applications, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, April 9-12, 2007, Proceedings, pp. 664-675, 2007, Springer, 978-3-540-71702-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
88 | Jiayin Feng, Jiadong Ren |
MMFI_DSSW - A New Method to Incrementally Mine Maximal Frequent Itemsets in Transaction Sensitive Sliding Window. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KSEM ![In: Knowledge Science, Engineering and Management, Second International Conference, KSEM 2007, Melbourne, Australia, November 28-30, 2007, Proceedings, pp. 485-495, 2007, Springer, 978-3-540-76718-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algorithm, data streams, maximal frequent itemsets |
86 | Bai-En Shie, Vincent S. Tseng, Philip S. Yu |
Online mining of temporal maximal utility itemsets from data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1622-1626, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
maximal itemsets, temporal high utility itemsets, data stream mining, utility mining |
84 | Vincent S. Tseng, Cheng-Wei Wu, Bai-En Shie, Philip S. Yu |
UP-Growth: an efficient algorithm for high utility itemset mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 253-262, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
candidate pruning, high utility itemset, frequent itemset, utility mining |
83 | Salvatore Ruggieri |
Frequent regular itemset mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 263-272, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
closed and free itemsets, concise representations |
81 | Zequn Zhou, Christie I. Ezeife |
A Low-Scan Incremental Association Rule Maintenance Method Based on the Apriori Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 14th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI 2001, Ottawa, Canada, June 7-9, 2001, Proceedings, pp. 26-35, 2001, Springer, 3-540-42144-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Maintaining Mining Asociation Rules, High Level Large Itemsets, Low Level Large Itemsets, Apriori Property |
81 | Mirko Böttcher, Martin Spott, Rudolf Kruse |
A Condensed Representation of Itemsets for Analyzing Their Evolution over Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (1) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2009, Bled, Slovenia, September 7-11, 2009, Proceedings, Part I, pp. 163-178, 2009, Springer, 978-3-642-04179-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
81 | Xiangjun Dong, Zhendong Niu, Donghua Zhu 0001, Zhiyun Zheng, Qiuting Jia |
Mining Interesting Infrequent and Frequent Itemsets Based on MLMS Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 4th International Conference, ADMA 2008, Chengdu, China, October 8-10, 2008. Proceedings, pp. 444-451, 2008, Springer, 978-3-540-88191-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
81 | Jie Dong, Min Han |
IFCIA: An Efficient Algorithm for Mining Intertransaction Frequent Closed Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (2) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 2, pp. 678-682, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
81 | Xu-dong Song, Kun Zhai, Xiao-bing Liu |
The Efficient and Complete Frequent Itemsets Mining of Association Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 1, pp. 428-432, 2007, IEEE Computer Society, 0-7695-2874-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
81 | Hassan H. Malik, John R. Kender |
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 991-996, 2006, IEEE Computer Society, 0-7695-2701-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
79 | Bo He, Yue Wang, Wu Yang, Yuan Chen |
Fast Algorithm for Mining Global Frequent Itemsets Based on Distributed Database. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, First International Conference, RSKT 2006, Chongqing, China, July 24-26, 2006, Proceedings, pp. 415-420, 2006, Springer, 3-540-36297-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Global frequent itemsets, distributed database, FP-tree, FP-growth |
79 | Kai Chen |
Mining Frequent Closed Itemsets Without Candidate Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, Third International Symposium, ISPA 2005, Nanjing, China, November 2-5, 2005, Proceedings, pp. 668-677, 2005, Springer, 3-540-29769-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
data mining, association rule, stack, frequent closed itemsets |
75 | Li Yang 0008 |
Pruning and Visualizing Generalized Association Rules in Parallel Coordinates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(1), pp. 60-70, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
data mining, Association rules, data visualization, mining methods and algorithms, interactive data exploration |
75 | Dao-I Lin, Zvi M. Kedem |
Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 14(3), pp. 553-566, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
maximum frequent set, Pincer Search, maximum frequent candidate set, Data mining, association rule, knowledge discovery |
75 | Dao-I Lin, Zvi M. Kedem |
Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Advances in Database Technology - EDBT'98, 6th International Conference on Extending Database Technology, Valencia, Spain, March 23-27, 1998, Proceedings, pp. 105-119, 1998, Springer, 3-540-64264-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
74 | Toon Calders, Bart Goethals |
Non-derivable itemset mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 14(1), pp. 171-206, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Data mining, Itemsets, Condensed representation |
72 | Nikolaj Tatti, Jilles Vreeken |
Finding Good Itemsets by Packing Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 588-597, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
72 | Kun Li, Yongyan Wang, M. Ellahi, Hongan Wang |
Mining Recent Frequent Itemsets in Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (4) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 4, pp. 353-358, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
72 | Wassim Ayadi, Khedija Arour |
A Binary Decision Diagram to discover low threshold support frequent itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA Workshops ![In: 18th International Workshop on Database and Expert Systems Applications (DEXA 2007), 3-7 September 2007, Regensburg, Germany, pp. 509-513, 2007, IEEE Computer Society, 0-7695-2932-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
data mining, association rules, binary decision diagram, frequent item sets |
72 | Jianyong Wang 0001, Jiawei Han 0001, Ying Lu 0001, Petre Tzvetkov |
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(5), pp. 652-664, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
72 | Ningthoujam Gourakishwar Singh, Sanasam Ranbir Singh, Anjana Kakoti Mahanta |
CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 633-636, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
72 | Taneli Mielikäinen |
Transaction Databases, Frequent Itemsets, and Their Condensed Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDID ![In: Knowledge Discovery in Inductive Databases, 4th International Workshop, KDID 2005, Porto, Portugal, October 3, 2005, Revised Selected and Invited Papers, pp. 139-164, 2005, Springer, 3-540-33292-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
72 | Toon Calders, Bart Goethals |
Mining All Non-derivable Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Principles of Data Mining and Knowledge Discovery, 6th European Conference, PKDD 2002, Helsinki, Finland, August 19-23, 2002, Proceedings, pp. 74-85, 2002, Springer, 3-540-44037-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
71 | Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee |
DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 17(1), pp. 79-97, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Single-pass algorithm, Landmark window, Data mining, Data streams, Frequent itemsets |
71 | Wassim Ayadi, Khedija Arour |
A Novel Parallel Boolean Approach for Discovering Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA, pp. 297-302, 2007, IEEE Computer Society, 0-7695-3033-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Data mining, Association rules, Binary decision diagram, Frequent itemsets, Parallel data mining |
71 | Nan Jiang, Le Gruenwald |
CFI-Stream: mining closed frequent itemsets in data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006, pp. 592-597, 2006, ACM, 1-59593-339-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
association rules, data stream, frequent closed itemsets |
71 | Xuegang Hu, Haitao Yu |
The Research of Sampling for Mining Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, First International Conference, RSKT 2006, Chongqing, China, July 24-26, 2006, Proceedings, pp. 496-501, 2006, Springer, 3-540-36297-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
weighted sampling, statistical optimal sample size, Data Mining, association rule, frequent itemsets |
71 | Roman Tesar, Vaclav Strnad, Karel Jezek, Massimo Poesio |
Extending the single words-based document model: a comparison of bigrams and 2-itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Symposium on Document Engineering ![In: Proceedings of the 2006 ACM Symposium on Document Engineering, Amsterdam, The Netherlands, October 10-13, 2006, pp. 138-146, 2006, ACM, 1-59593-515-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bigrams, machine learning, feature selection, text categorization, comparison, n-grams, document model, itemsets |
71 | Joong Hyuk Chang, Won Suk Lee |
Effect of Count Estimation in Finding Frequent Itemsets over Online Transactional Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(1), pp. 63-69, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
count estimation, transactional data streams, frequent itemsets |
71 | Yin-Ling Cheung, Ada Wai-Chee Fu |
Mining Frequent Itemsets without Support Threshold: With and without Item Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 16(9), pp. 1052-1069, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
N-most interesting itemsets, item constraints, Association rules, FP-tree |
71 | Soon Myoung Chung, Congnan Luo |
Parallel Mining of Maximal Frequent Itemsets from Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 3-5 November 2003, Sacramento, California, USA, pp. 134-, 2003, IEEE Computer Society, 0-7695-2038-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
scalability, association rules, Parallel data mining, maximal frequent itemsets |
70 | Claudio Lucchese, Salvatore Orlando 0001, Raffaele Perego 0001 |
Fast and Memory Efficient Mining of Frequent Closed Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 18(1), pp. 21-36, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
high-performance algorithms, Data mining, association rules, frequent itemsets, condensed representations, closed itemsets |
67 | R. Uday Kiran, P. Krishna Reddy |
An improved multiple minimum support based approach to mine rare association rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDM ![In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, Nashville, TN, USA, March 30, 2009 - April 2, 2009, pp. 340-347, 2009, IEEE, 978-1-4244-2765-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
67 | Hsuan-Shih Lee |
On-Line Association Rules Mining with Dynamic Support. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based Intelligent Information and Engineering Systems, 10th International Conference, KES 2006, Bournemouth, UK, October 9-11, 2006, Proceedings, Part II, pp. 896-901, 2006, Springer, 3-540-46537-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
67 | Shichao Zhang 0001, Jeffrey Xu Yu, Jingli Lu, Chengqi Zhang |
Is Frequency Enough for Decision Makers to Make Decisions?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference, PAKDD 2006, Singapore, April 9-12, 2006, Proceedings, pp. 499-503, 2006, Springer, 3-540-33206-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
64 | Marzena Kryszkiewicz, Henryk Rybinski, Marcin Gajek |
Dataless Transitions Between Concise Representations of Frequent Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Inf. Syst. ![In: J. Intell. Inf. Syst. 22(1), pp. 41-70, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
data mining, knowledge discovery, frequent itemsets, closed itemsets, concise representation |
64 | Nikolaj Tatti |
Probably the best itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 293-302, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
bayesian model selection, decomposable models, exponential models, MCMC, junction tree, itemset mining |
64 | En 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](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 19(1), pp. 132-172, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hash-based approach, Data mining, Data stream, Frequent itemset, False positive |
64 | Jin Qian, Feiyue Ye |
Mining Maximal Frequent Itemsets with Frequent Pattern List. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 1, pp. 628-632, 2007, IEEE Computer Society, 0-7695-2874-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
64 | Xuegang Hu, Wei Liu, Dexing Wang, Xindong Wu 0001 |
Mining Frequent Itemsets Using a Pruned Concept Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (3) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 3, pp. 606-610, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
64 | Junbo Chen, Shanping Li |
GC-Tree: A Fast Online Algorithm for Mining Frequent Closed Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD Workshops ![In: Emerging Technologies in Knowledge Discovery and Data Mining, PAKDD 2007, International Workshops, Nanjing, China, May 22-25, 2007, Revised Selected Papers, pp. 457-468, 2007, Springer, 978-3-540-77016-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
64 | Tianming Hu, Qian Fu, Xiaonan Wang 0002, Sam Yuan Sung |
Mining Maximum Length Frequent Itemsets: A Summary of Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 13-15 November 2006, Arlington, VA, USA, pp. 505-512, 2006, IEEE Computer Society, 0-7695-2728-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
64 | Lei Jia, Jun Yao, Renqing Pei |
Mining Association Rules with Frequent Closed Itemsets Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 7th International Conference, KES 2003, Oxford, UK, September 3-5, 2003, Proceedings, Part I, pp. 469-475, 2003, Springer, 3-540-40803-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
64 | Lei Jia, Jun Yao, Renqing Pei |
Using Loose and Tight Bounds to Mine Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 7th International Conference, KES 2003, Oxford, UK, September 3-5, 2003, Proceedings, Part I, pp. 462-468, 2003, Springer, 3-540-40803-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
64 | Kritsada Sriphaew, Thanaruk Theeramunkong |
A new method for finding generalized frequent itemsets in generalized association rule mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 1-4 July 2002, Taormina, Italy, pp. 1040-1045, 2002, IEEE Computer Society, 0-7695-1671-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
64 | Brock Barber, Howard J. Hamilton |
Parametric Algorithms for Mining Share-Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 12th International Symposium, ISMIS 2000, Charlotte, NC, USA, October 11-14, 2000, Proceedings, pp. 562-572, 2000, Springer, 3-540-41094-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
63 | Congnan Luo, Anil L. Pereira, Soon Myoung Chung |
Distributed Mining of Maximal Frequent Itemsets on a Data Grid System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 37(1), pp. 71-90, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scalability, association rules, Data Grid, distributed data mining, maximal frequent itemsets |
63 | Arno J. Knobbe, Eric K. Y. Ho |
Maximally informative k-itemsets and their efficient discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006, pp. 237-244, 2006, ACM, 1-59593-339-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
joint entropy, maximally informative k-itemsets, feature selection, information theory, subgroup discovery, binary data |
61 | Yongyan Wang, Kun Li, Hongan Wang |
Maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDM ![In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, Nashville, TN, USA, March 30, 2009 - April 2, 2009, pp. 381-388, 2009, IEEE, 978-1-4244-2765-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
59 | Kun-Ta Chuang, Jiun-Long Huang, Ming-Syan Chen |
Mining top-k frequent patterns in the presence of the memory constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 17(5), pp. 1321-1344, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
59 | Junbo Chen, Bo Zhou 0010 |
TGC-Tree: An Online Algorithm Tracing Closed Itemset and Transaction Set Simultaneously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LKR ![In: Large-Scale Knowledge Resources. Construction and Application, Third International Conference on Large-Scale Knowledge Resources, LKR 2008, Tokyo, Japan, March 3-5, 2008, Proceedings, pp. 38-50, 2008, Springer, 978-3-540-78158-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
59 | Wontae Hwang, Dongseung Kim |
Improved Association Rule Mining by Modified Trimming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: Sixth International Conference on Computer and Information Technology (CIT 2006), 20-22 September 2006, Seoul, Korea, pp. 24, 2006, IEEE Computer Society, 0-7695-2687-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
59 | Jong Soo Park, Ming-Syan Chen, Philip S. Yu |
An Effective Hash Based Algorithm for Mining Association Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, USA, May 22-25, 1995., pp. 175-186, 1995, ACM Press, 978-0-89791-731-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
56 | Guimei Liu, Jinyan Li 0001, Limsoon Wong |
A new concise representation of frequent itemsets using generators and a positive border. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 17(1), pp. 35-56, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Positive border, Data mining, Generator, Frequent itemset mining, Concise representation |
56 | Carson Kai-Sang Leung, Pourang Irani, Christopher L. Carmichael |
WiFIsViz: Effective Visualization of Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 875-880, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
56 | Haifeng Li 0006, Zongjian Lu, Hong Chen 0001 |
Mining Approximate Closed Frequent Itemsets over Stream. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008, In conjunction with Second International Workshop on Advanced Internet Technology and Applications, August 6-8, 2008, Phuket, Thailand, pp. 405-410, 2008, IEEE Computer Society, 978-0-7695-3263-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
stream, closed frequent itemset |
56 | Lisheng Ma, Yi Qi |
An Efficient Algorithm for Frequent Closed Itemsets Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSSE (4) ![In: International Conference on Computer Science and Software Engineering, CSSE 2008, Volume 4: Embedded Programming / Database Technology / Neural Networks and Applications / Other Applications, December 12-14, 2008, Wuhan, China, pp. 259-262, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
56 | Jian Hu, Yang-Li Xiang |
A New Fast Frequent Itemsets Mining Algorithm Based on Forest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (2) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 2, pp. 551-555, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
56 | Bashar Saleh, Florent Masseglia |
Time Aware Mining of Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIME ![In: 15th International Symposium on Temporal Representation and Reasoning, TIME 2008, Université du Québec à Montréal, Canada, 16-18 June 2008, pp. 93-97, 2008, IEEE Computer Society, 978-0-7695-3181-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
56 | Alva Erwin, Raj P. Gopalan, N. R. Achuthan |
Efficient Mining of High Utility Itemsets from Large Datasets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 12th Pacific-Asia Conference, PAKDD 2008, Osaka, Japan, May 20-23, 2008 Proceedings, pp. 554-561, 2008, Springer, 978-3-540-68124-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
High Utility Mining, Pattern Growth |
56 | Arianna Gallo, Tijl De Bie, Nello Cristianini |
MINI: Mining Informative Non-redundant Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings, pp. 438-445, 2007, Springer, 978-3-540-74975-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Ho Jin Woo, Won Suk Lee |
estMax: Tracing Maximal Frequent Itemsets over Online Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA, pp. 709-714, 2007, IEEE Computer Society, 0-7695-3018-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Xiangjun Dong, Gang Li, Hongguo Wang, Yuebin Guo, Yueyue Yang |
Mining Infrequent Itemsets Based on Extended MMS Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007. Proceedings, pp. 190-198, 2007, Springer, 978-3-540-74281-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Bo Liu 0062, Jiuhui Pan |
A Graph-Based Algorithm for Mining Maximal Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (3) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 3, pp. 263-267, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Jinze Liu, Susan Paulsen, Wei Wang 0010, Andrew B. Nobel, Jan F. Prins |
Mining Approximate Frequent Itemsets from Noisy Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, Houston, Texas, USA, pp. 721-724, 2005, IEEE Computer Society, 0-7695-2278-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Xiaoming Yang, Zhibin Wang, Bing Liu 0009, Shouzhi Zhang, Wei Wang 0009, Bole Shi |
Non-Almost-Derivable Frequent Itemsets Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: Fifth International Conference on Computer and Information Technology (CIT 2005), 21-23 September 2005, Shanghai, China, pp. 157-161, 2005, IEEE Computer Society, 0-7695-2432-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Zhi-Hong Deng, Xin Li, Shi-Wei Tang |
An Efficient Approach for Interactive Mining of Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: Advances in Web-Age Information Management, 6th International Conference, WAIM 2005, Hangzhou, China, October 11-13, 2005, Proceedings, pp. 138-149, 2005, Springer, 3-540-29227-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Duckjin Chai, Heeyoung Choi, Buhyun Hwang |
Discovering Frequent Itemsets Using Transaction Identifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 1175-1184, 2005, Springer, 3-540-28312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang 0001 |
A Fast Algorithm for Mining Share-Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Web Technologies Research and Development - APWeb 2005, 7th Asia-Pacific Web Conference, Shanghai, China, March 29 - April 1, 2005, Proceedings, pp. 417-428, 2005, Springer, 3-540-25207-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
56 | Soon M. Chung, Congnan Luo |
Distributed mining of maximal frequent itemsets from databases on a cluster of workstations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCGRID ![In: 4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), April 19-22, 2004, Chicago, Illinois, USA, pp. 499-507, 2004, IEEE Computer Society, 0-7803-8430-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
56 | Kritsada Sriphaew, Thanaruk Theeramunkong |
Mining Generalized Closed Frequent Itemsets of Generalized Association Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 7th International Conference, KES 2003, Oxford, UK, September 3-5, 2003, Proceedings, Part I, pp. 476-484, 2003, Springer, 3-540-40803-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
54 | James Cheng, Yiping Ke, Wilfred Ng |
A survey on algorithms for mining frequent itemsets over data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 16(1), pp. 1-27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Window models, Approximate algorithms, Frequent itemsets, Stream mining |
54 | Nikolaj Tatti |
Maximum entropy based significance of itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 17(1), pp. 57-77, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Binary data mining, Maximum entropy, Itemsets |
54 | Shiguang Ju, Chen Chen |
MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIP ![In: International Symposium on Information Processing, ISIP 2008 / International Pacific Workshop on Web Mining, and Web-Based Application, WMWA 2008, Moscow, Russia, 23-25 May 2008, pp. 144-148, 2008, IEEE Computer Society, 978-0-7695-3151-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
data mining, association rules, maximal frequent itemsets |
54 | B. 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](Pics/bibsonomy.png) |
Bangalore Compute Conf. ![In: Proceedings of the 1st Bangalore Annual Compute Conference, Compute 2008, Bangalore, India, January 18-20, 2008, pp. 16, 2008, ACM, 978-1-59593-950-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
association rules, incremental mining, Galois Lattices, closed frequent itemsets |
54 | Haifeng Li 0006, Hong Chen 0001 |
Improve Frequent Closed Itemsets Mining over Data Stream with Bitmap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008, In conjunction with Second International Workshop on Advanced Internet Technology and Applications, August 6-8, 2008, Phuket, Thailand, pp. 399-404, 2008, IEEE Computer Society, 978-0-7695-3263-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
stream, bitmap, frequent closed itemsets |
54 | Yanbin Ye, Chia-Chu Chiang |
A Parallel Apriori Algorithm for Frequent Itemsets Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SERA ![In: Fourth International Conference on Software Engineering, Research, Management and Applications (SERA 2006), 9-11 August 2006, Seattle, Washington, USA, pp. 87-94, 2006, IEEE Computer Society, 0-7695-2656-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Frequent Itemsets Mining (FIM), Data Mining, Parallel Computing, Association Rules, Apriori |
53 | Karam Gouda, Mohammed Javeed Zaki |
GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 11(3), pp. 223-242, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
maximal itemsets, data mining, association rules, frequent itemsets, backtracking search |
53 | Joong Hyuk Chang, Won Suk Lee |
Finding recent frequent itemsets adaptively over online data streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003, pp. 487-492, 2003, ACM, 1-58113-737-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
decay mechanism, delayed-insertion, pruning of itemsets, recent frequent itemsets, data stream |
53 | Fuzan Chen, Minqiang Li |
An Efficiently Algorithm Based on Itemsets-Lattice and Bitmap Index for Finding Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (2) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part II, pp. 420-429, 2005, Springer, 3-540-28331-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | K. 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](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 11th International Conference, DEXA 2000, London, UK, September 4-8, 2000, Proceedings, pp. 710-719, 2000, Springer, 3-540-67978-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Data mining, association rules, lattice |
50 | Willie Ng, Manoranjan Dash |
Which Is Better for Frequent Pattern Mining: Approximate Counting or Sampling?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 11th International Conference, DaWaK 2009, Linz, Austria, August 31 - September 2, 2009, Proceedings, pp. 151-162, 2009, Springer, 978-3-642-03729-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
50 | Ying-Hsiang Wen, Jen-Wei Huang, Ming-Syan Chen |
Hardware-Enhanced Association Rule Mining with Hashing and Pipelining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 20(6), pp. 784-795, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hardware-enhanced mining, data mining, Association Rules |
50 | Mitica Craus |
A New Parallel Algorithm for the Frequent Itemset Mining Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 7th International Symposium on Parallel and Distributed Computing (ISPDC 2008), 1-5 July 2008, Krakow, Poland, pp. 165-170, 2008, IEEE Computer Society, 978-0-7695-3472-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
50 | Huaiguo Fu, Mícheál Ó Foghlú |
A Distributed Algorithm of Density-Based Subspace Frequent Closed Itemset Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, 25-27 Sept. 2008, Dalian, China, pp. 750-755, 2008, IEEE Computer Society, 978-0-7695-3352-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|