18 Most influential algorithms in the field of data Mining (reproduced)

Source: Internet
Author: User



#1. C4.5

Quinlan, J. R. 1993. C4.5:programs for machine learning.
Morgan Kaufmann Publishers Inc.

Google scholar Count in October 2006:6,907

#2. CART

L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and
Regression Trees. Wadsworth, Belmont, CA, 1984.

Google scholar Count in October 2006:6,078

#3. K Nearest Neighbours (KNN)

Hastie, T. and Tibshirani, R. 1996. discriminant Adaptive Nearest
Neighbor classification. IEEE Trans. Pattern
Anal. Mach. Intell. (Tpami). 6 (June. 1996), 607-616.
Doi= http://dx.doi.org/10.1109/34.506411

Google scholar count:183

#4. Naive Bayes

Hand, D.J, Yu, K., 2001. Idiot ' s bayes:not so Stupid after all?
Internat. Statist. Rev. 69, 385-398.

Google scholar Count in October 2006:51


Statistical learning


#5. Svm

Vapnik, v. N. 1995. The Nature of statistical learning
Theory. Springer-verlag New York, Inc.

Google scholar Count in October 2006:6,441

#6. Em

McLachlan, G. and Peel, D. (2000). Finite Mixture Models.
J. Wiley, New York.

Google scholar Count in October 2006:848


Association analysis


#7. Apriori

Rakesh Agrawal and Ramakrishnan srikant. Fast Algorithms for Mining
Association Rules. In Proc. Of the 20th Int ' L Conference on Very Large
Databases (VLDB ' 94), Santiago, Chile, September 1994.

Google scholar Count in October 2006:3,639

#8. Fp-tree

Han, J., Pei, J., and Yin, Y. 2000. Mining Frequent patterns without
Candidate Generation. In Proceedings of the ACM Sigmod
International Conference on Management of Data (Dallas, Texas, and
States, May 15-18, 2000). Sigmod ' 00. ACM Press, New York, NY, 1-12.
Doi= http://doi.acm.org/10.1145/342009.335372

Google scholar Count in October 2006:1258


Link Mining


#9. PageRank

Brin, S. and Page, L. 1998. The anatomy of a large-scale hypertextual
Web search engine. In Proceedings of the Seventh International
Conference on the World Wide Web (WWW-7) (Brisbane,
Australia). P. H. Enslow and A. Ellis, Eds. Elsevier Science
Publishers B. V., Amsterdam, the Netherlands, 107-117.
Doi= http://dx.doi.org/10.1016/S0169-7552 (98) 00110-x

Google Shcolar count:2558

#10. HITS

Kleinberg, J. M. 1998. Authoritative sources in a hyperlinked
Environment. In Proceedings of the ninth Annual Acm-siam Symposium on
Discrete algorithms (San Francisco, California, states, January
25-27, 1998). Symposium on Discrete Algorithms. Society for
Industrial and Applied Mathematics, Philadelphia, PA, 668-677.

Google Shcolar count:2240




#11. K-means

Macqueen, J. B., Some Methods for classification and analysis of
Multivariate observations, in Proc. 5th Berkeley Symp. Mathematical
Statistics and Probability, 1967, pp. 281-297.

Google scholar Count in October 2006:1579

#12. BIRCH

Zhang, T., Ramakrishnan, R., and Livny, M. 1996. Birch:an Efficient
Data clustering method for very large databases. In Proceedings of the
1996 ACM SIGMOD International Conference on Management of Data
(Montreal, Quebec, Canada, June 04-06, 1996). J. Widom, Ed.
Sigmod ' 96. ACM Press, New York, NY, 103-114.
Doi= http://doi.acm.org/10.1145/233269.233324

Google scholar Count in October 2006:853


Bagging and boosting


#13. AdaBoost

Freund, Y. and Schapire, R. E. 1997. A decision-theoretic
Generalization of on-line learning and an application to
Boosting. J. Comput. Syst. Sci, 1 (1997), 119-139.
Doi= http://dx.doi.org/10.1006/jcss.1997.1504

Google scholar Count in October 2006:1576


Sequential Patterns


#14. Gsp

Srikant, R. and Agrawal, R. 1996. Mining Sequential Patterns:
Generalizations and performance improvements. In Proceedings of the
5th International Conference on extending Database technology:
Advances in Database Technology (March 25-29, 1996). P. M. Apers,
M. Bouzeghoub, and G. Gardarin, Eds. Lecture Notes in Computer
Science, vol. 1057. Springer-verlag, London, 3-17.

Google scholar Count in October 2006:596

#15. Prefixspan

J. Pei, J. Han, B. Mortazavi-asl, H. Pinto, Q. Chen, U. Dayal and
M-c. Hsu. Prefixspan:mining Sequential Patterns efficiently by
prefix-projected Pattern growth. In Proceedings of the 17th
International Conference on Data Engineering (April 02-06,
2001). ICDE ' 01. IEEE Computer Society, Washington, DC.

Google scholar Count in October 2006:248


Integrated Mining


#16. Cba

Liu, B., Hsu, W. and Ma, Y. M. Integrating classification and
Association rule Mining. KDD-98, 1998, pp. 80-86.

Google scholar Count in October 2006:436


Rough Sets


#17. Finding Reduct

Zdzislaw Pawlak, Rough sets:theoretical aspects of reasoning about
Data, Kluwer Academic Publishers, Norwell, MA, 1992

Google scholar Count in October 2006:329


Graph Mining


#18. Gspan

Yan, X. and Han, J. 2002. gspan:graph-based substructure Pattern
Mining. In Proceedings of the 2002 IEEE International Conference on
Data Mining (ICDM ') (December 09-12, 2002). IEEE Computer
Society, Washington, DC.

18 Most influential algorithms in the field of data Mining (reproduced)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.