The week's pick
Random Articles
Reseach Article
Frequent Pattern Mining and Current State of the Art
by
Kalli Srinivasa Nageswara Prasad,
Prof. S. Ramakrishna
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 26 - Number 7 |
| Year of Publication: 2011 |
| Authors: Kalli Srinivasa Nageswara Prasad, Prof. S. Ramakrishna |
10.5120/3114-4279
|
Kalli Srinivasa Nageswara Prasad, Prof. S. Ramakrishna . Frequent Pattern Mining and Current State of the Art. International Journal of Computer Applications. 26, 7 ( July 2011), 33-39. DOI=10.5120/3114-4279
@article{
10.5120/3114-4279,
author = {
Kalli Srinivasa Nageswara Prasad,
Prof. S. Ramakrishna
},
title = { Frequent Pattern Mining and Current State of the Art },
journal = {
International Journal of Computer Applications
},
issue_date = { July 2011 },
volume = { 26 },
number = { 7 },
month = { July },
year = { 2011 },
issn = { 0975-8887 },
pages = {
33-39
},
numpages = {9},
url = {
https://ijcaonline.org/archives/volume26/number7/3114-4279/
},
doi = { 10.5120/3114-4279 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:12:12.232979+05:30
%A Kalli Srinivasa Nageswara Prasad
%A Prof. S. Ramakrishna
%T Frequent Pattern Mining and Current State of the Art
%J International Journal of Computer Applications
%@ 0975-8887
%V 26
%N 7
%P 33-39
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Identifying the association rules in large databases play a key role in data mining. The research is mainly aimed at considering prior researches, present working status and to restore the gaps between them with present known information. There are two problems regarding this context, they are identifying all frequent item sets and to generate constraints from them. Here, first problem, as it takes more processing time, is computationally costly. Consequently, many algorithms are proposed to solve this problem. Current study considers such algorithms and their related issues.
References
- Agrawal, R., T, Imielinski and A, Swami, 1993, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, May 25-28, ACM, New York, USA., pp: 207-216
- Agrawal, R, and R, Srikant, 1994, Fast algorithms for mining association rules, Proceedings of the 20th International Conference on Very Large Data Bases, Sept, 12-15, San Francisco, CA., USA., pp: 487-499
- Mannila, H., H, Toivonen and A, Inkeri Verkamo, 1994 Efficient algorithms for discovering association rules Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, (KDD-94), IEEE, pp: 181-192.
- Han, J., J, Pei, Y, Yin and R, Mao, 2004, Mining frequent patterns without candidate generation: A frequent-pattern tree approach, Data Mining Knowledge Discovery, 8: 53-87
- Sava sere, A., E, Omieccinski and S, Navathe, 1995, An efficient algorithm for mining association rules in large databases, Proceedings of the 21st International Conference on Very Large Databases, Sept, 11-15, Zurich, Switzerland, pp: 432-443
- Toivonen, H., 1996, Sampling large databases for association rules, Proceedings of 22th International Conference on Very Large Databases, Sept, 3-6, Bombay, India, pp: 134-145
- Brin, S., R, Motwani and C, Silverstein, 1997, Beyond market basket: Generalizing association rules to correlations, Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, May 11-15, Tucson, AZ., pp: 265-276
- Hidber, C., 1999, Online association rule mining, ACM SIGMOD Rec., 28: 145-156
- B. Liu, W. Hsu, and Y. Ma, "Mining association rules with multiple minimum supports,", Proceedings of the fifth ACM SIGKDD international conference, San Diego, CA, USA August 15-18, 1999, p.341
- Ezeife, C.I.; Min Chen; Incremental mining of Web sequential patterns using PLWAP tree on tolerance MinSupport, Database Engineering and Applications Symposium, 2004, Issue Date: 7-9 July 2004, On page(s): 465 – 469
- Pei, J., J, Han and L,V,S, Lakshmanan, 2001, Mining frequent itemsets with convertible constraints, Proceedings of the 17th International Conference on Data Engineering, April 2-6, Heidelberg, Germany, pp: 433-332
- Liu, J., Y, Pan, K, Wang and J, Han, 2002, Mining frequent item sets by opportunistic projection, Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery in Databases, July 23-26, Edmonton, Canada, pp: 239-248
- Grahne, G, and J, Zhu, 2003, Efficiently using prefix-trees in mining frequent itemsets, Proceedings of the 2003 ICDM International Workshop on Frequent Itemset Mining Implementations, (IWFIMI03), Melbourne, FL., pp: 123-132
- Lakshmanan, L,V,S., R, Ng, J, Han and A, Pang, 1999, Optimization of constrained frequent set queries with 2-variable constraints, ACM SIGMOD Rec., 28: 157-168
- Grahne, G., L, Lakshmanan and X, Wang, 2000, Efficient mining of constrained correlated sets, Proceedings of the 2000 International Conference on Data Engineering, Feb, 28-March 3, San Diego, CA., pp: 512-521
- Bucila, C., J, Gehrke, D, Kifer and W, White, 2003, DualMiner: A dual-pruning algorithm for itemsets with constraints, Data Min, Knowl, Discov., 7: 241-272
- Bonchi, F., F, Giannotti, A, Mazzanti and D, Pedreschi, 2003, Exante: Anticipated data reduction in constrained pattern mining, Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Sept, 22-26, Cavtat, Dubrovnik, Croatia, pp: 59-70
- Gade, K., J, Wang and G, Karypis, 2004, Efficient closed pattern mining in the presence of tough block constraints, Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug, 22-25, Seattle, WA., pp: 138-147
- Bonchi, F, and C, Lucchese, 2004, On closed constrained frequent pattern mining, Proceedings of the 2004 International Conference on Data Mining, Nov, 1-4, Brighton, UK., pp: 35-42.
- Yun, U, and J, Leggett, 2005, Wfim: Weighted frequent itemset mining with a weight range and aminimum weight, Proceedings of the 2005 SIAM International Conference on Data Mining, April 21-23, Newport Beach, CA., pp: 636-640
- Ya-Han Hu; Fan Wu; Tzu-Wei Yen "Considering RFM-values of frequent patterns in transactional databases", 2nd International Conference on Software Engineering and Data Mining (SEDM), June 2010, pages: 422 – 427
- Long, Z.A. Hamdan, A.R. Bakar, A.A; Parameter setting procedure via quick parameter evaluation in frequent pattern mining for outbreak detection, 2nd Conference on Data Mining and Optimization, 2009. DMO '09, Issue Date: 27-28 Oct. 2009, On page(s): 90 – 93
- Antunes, C.; Pattern Mining over Star Schemas in the Onto4AR Framework, IEEE International Conference on Data Mining Workshops, 2009, ICDMW '09, Issue Date: 6-6 Dec. 2009, On page(s): 453 - 458
- Ya-Han Hu; Fan Wu; Yi-Chun Liao; Sequential pattern mining with multiple minimum supports: A tree based approach, 2nd International Conference on Software Engineering and Data Mining (SEDM), Issue Date: 23-25 June 2010 On page(s): 428 – 433
- Chuang-Kai Chiou, Judy C. R. Tseng; Sorted Compressed Tree: An Improve Method of Frequent Patterns Mining without Support Constraint, 2nd International Conference on Software Engineering and Data Mining (SEDM), 2010, Issue Date: 23-25 June 2010, On page(s): 328 - 333
- Agrawal, R,C., C, Agrawal and V,V,V, Prasad, 2001, A tree projection algorithm for generation of frequent item sets, J, Parallel Distributed Comput., 61: 350-371.
Index Terms
Computer Science
Information Sciences
Keywords