skip to main content
article

Advances in frequent itemset mining implementations: report on FIMI'03

Published: 01 June 2004 Publication History
First page of PDF

References

[1]
C. Aggarwal. Towards long pattern generation in dense databases. SIGKDD Explorations, 3(1):20--26, 2001.]]
[2]
R. Agrawal, C. Aggarwal, and V. Prasad. Depth First Generation of Long Patterns. In 7th Int'l Conference on Knowledge Discovery and Data Mining, Aug. 2000.]]
[3]
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207--216. ACM Press, 1993.]]
[4]
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In U. Fayyad and et al, editors, Advances in Knowledge Discovery and Data Mining, pages 307--328. AAAI Press, Menlo Park, CA, 1996.]]
[5]
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In 20th VLDB Conference, Sept. 1994.]]
[6]
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, 2(2), Dec. 2000.]]
[7]
R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD Conf. Management of Data, June 1998.]]
[8]
F. Bodon. A fast apriori implementation. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003.]]
[9]
T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Knowledge Discovery and Data Mining, pages 254--260, 1999.]]
[10]
S. Brin, R. Motwani, J. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In ACM SIGMOD Conf. Management of Data, May 1997.]]
[11]
D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: a maximal frequent itemset algorithm for transactional databases. In Intl. Conf. on Data Engineering, Apr. 2001.]]
[12]
D. Cristofor, L. Cristofor, and D. Simovici. Galois connection and data mining. Journal of Universal Computer Science, 6(1):60--73, 2000.]]
[13]
K. Geurts, G. Wets, T. Brijs, and K. Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, page 18, 2003.]]
[14]
B. Goethals. Efficient Frequent Pattern Mining. PhD thesis, transnational University of Limburg, Belgium, 2002.]]
[15]
B. Goethals and M. Zaki, editors. Proceedings of the FIMI'03 Workshop on Frequent Itemset Mining Implementations, Nov. 2003. http://CEUR-WS.org/Vol-90/.]]
[16]
K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In 1st IEEE Int'l Conf. on Data Mining, Nov. 2001.]]
[17]
G. Grahne and J. Zhu. High performance mining of maximal frequent itemsets. In 6th International Workshop on High Performance Data Mining, May 2003.]]
[18]
D. Gunopulos, H. Mannila, and S. Saluja. Discovering all the most specific sentences by randomized algorithms. In Intl. Conf. on Database Theory, Jan. 1997.]]
[19]
J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM SIGMOD Conf. Management of Data, May 2000.]]
[20]
M. Houtsma and A. Swami. Set-oriented mining of association rules in relational databases. In 11th Intl. Conf. Data Engineering, 1995.]]
[21]
D.-I. Lin and Z. M. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. In 6th Intl. Conf. Extending Database Technology, Mar. 1998.]]
[22]
J.-L. Lin and M. H. Dunham. Mining association rules: Anti-skew algorithms. In 14th Intl. Conf. on Data Engineering, Feb. 1998.]]
[23]
F. Pan, G. Cong, A. Tung, J. Yang, and M. Zaki. CARPENTER: Finding closed patterns in long biological datasets. In ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, Aug. 2003.]]
[24]
J. S. Park, M. Chen, and P. S. Yu. An effective hash based algorithm for mining association rules. In ACM SIGMOD Intl. Conf. Management of Data, May 1995.]]
[25]
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In 7th Intl. Conf. on Database Theory, Jan. 1999.]]
[26]
J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In SIGMOD Int'l Workshop on Data Mining and Knowledge Discovery, May 2000.]]
[27]
A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In 21st VLDB Conf., 1995.]]
[28]
P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging vertical mining of large databases. In ACM SIGMOD Intl. Conf. Management of Data, May 2000.]]
[29]
H. Toivonen. Sampling large databases for association rules. In 22nd VLDB Conf., 1996.]]
[30]
J. Wang, J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent closed itemsets. In ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, Aug. 2003.]]
[31]
M. J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3):372--390, May-June 2000.]]
[32]
M. J. Zaki and K. Gouda. Fast vertical mining using Diffsets. In 9th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, Aug. 2003.]]
[33]
M. J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In 2nd SIAM International Conference on Data Mining, Apr. 2002.]]
[34]
M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining, Aug. 1997.]]
[35]
Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 401--406. ACM Press, 2001.]]
[36]
Q. Zou, W. Chu, and B. Lu. Smartminer: a depth first algorithm guided by tail information for mining maximal frequent itemsets. In 2nd IEEE Int'l Conf. on Data Mining, Nov. 2002.]]

Cited By

View all
  • (2023)An Efficient Bit-Based Approach for Mining Skyline Periodic Itemset PatternsElectronics10.3390/electronics1223487412:23(4874)Online publication date: 3-Dec-2023
  • (2023)High utility itemsets mining from transactional databases: a surveyApplied Intelligence10.1007/s10489-023-04853-553:22(27655-27703)Online publication date: 16-Sep-2023
  • (2022)Assessing the tendency of judging bias in student competition: a data mining approachJournal of Applied Research in Higher Education10.1108/JARHE-02-2022-005315:4(1198-1211)Online publication date: 31-Oct-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGKDD Explorations Newsletter
ACM SIGKDD Explorations Newsletter  Volume 6, Issue 1
Special issue on learning from imbalanced datasets
June 2004
117 pages
ISSN:1931-0145
EISSN:1931-0153
DOI:10.1145/1007730
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2004
Published in SIGKDD Volume 6, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)An Efficient Bit-Based Approach for Mining Skyline Periodic Itemset PatternsElectronics10.3390/electronics1223487412:23(4874)Online publication date: 3-Dec-2023
  • (2023)High utility itemsets mining from transactional databases: a surveyApplied Intelligence10.1007/s10489-023-04853-553:22(27655-27703)Online publication date: 16-Sep-2023
  • (2022)Assessing the tendency of judging bias in student competition: a data mining approachJournal of Applied Research in Higher Education10.1108/JARHE-02-2022-005315:4(1198-1211)Online publication date: 31-Oct-2022
  • (2022)UBP-MinerKnowledge-Based Systems10.1016/j.knosys.2022.108865248:COnline publication date: 19-Jul-2022
  • (2022)A two-stage integer programming model considering transaction equivalence for privacy preservationComputers and Operations Research10.1016/j.cor.2022.105997148:COnline publication date: 21-Oct-2022
  • (2022)The pattern frequency distribution theory: a mathematic establishment toward rational and reliable pattern miningInternational Journal of Data Science and Analytics10.1007/s41060-022-00340-116:1(43-83)Online publication date: 20-Aug-2022
  • (2022)Frequent itemset mining using FP-tree: a CLA-based approach and its extended application in biodiversity dataInnovations in Systems and Software Engineering10.1007/s11334-022-00500-319:3(283-301)Online publication date: 17-Nov-2022
  • (2022)A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset EnumerationMachine Learning and Knowledge Discovery in Databases10.1007/978-3-662-44851-9_27(422-436)Online publication date: 10-Mar-2022
  • (2021)MEGAIntelligent Data Analysis10.3233/IDA-20549425:6(1547-1563)Online publication date: 1-Jan-2021
  • (2021)The Efficient Mining of Skyline Patterns from a Volunteer Computing NetworkACM Transactions on Internet Technology10.1145/342355721:4(1-20)Online publication date: 16-Jul-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media