Open Access
Subscription or Fee Access
Algorithms in Data Mining
Abstract
Data mining is a technique in which we search huge data stores to find unseen patterns that cannot be evaluated using simple analysis i.e. it is the process of examining, evaluating large and complex databases and to create new information from that data and find patterns hidden inside it. It is a process that uses raw data and converts it into useful and important information. As methods that are used in it are mostly always mathematically complex. The use of data mining techniques, algorithms, methodology and tools is done for discovering data patterns. It uses different computational algorithms to divide the given data and calculate the probability of various upcoming events of real world. Every model is processed by some algorithm. More than one algorithm is used sometimes to solve a problem. There are many algorithms that can be used, and we will be discussing some of the algorithms used for data mining along with their classification, impacts and reviews.
References
Hart P (1968) The condensed nearest neighbor rule. IEEE Trans Inform Theory 14:515–516
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, Pp 487–499
Ahmed S, Coenen F, Leng PH (2006) Tree-based partitioning of date for association rule mining. Knowl Inf Syst 10(3): pp315–331
Banerjee A, Merugu S, Dhillon I, Ghosh J (2005) Clustering with Bregman divergences. J Mach Learn Res 6: pp1705–1749
Bezdek JC, Chuah SK, Leep D (1986) Generalized k-nearest neighbor rules. Fuzzy Sets Syst 18(3) pp:237–256.
Bloch DA, Olshen RA, Walker MG (2002) Risk estimation for classification trees. J Comput Graph Stat 11: pp263–288
Bonchi F, Lucchese C (2006) On condensed representations of constrained frequent patterns. Knowl Inf Syst 9(2): pp180–201
Breiman L (1968) Probability theory. Addison-Wesley, Reading. Republished (1991) in Classics of mathematics. SIAM, Philadelphia
Breiman L (1999) Prediction games and arcing classifiers. Neural Comput 11(7): pp 1493–1517
Breiman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees. Wadsworth, Belmont
Brin S, Page L (1998) The anatomy of a large-scale hypertextualWeb Search Sngine. Comput Networks
https://data-flair.training/blogs/data-mining-algorithms/
https://www.kdnuggets.com/2015/05/top-10-data-mining-algorithms-explained.html/3
Umarani, J., and Karpagam, K., “Investigation of User Identification Methods in Pre-Processing Phase of Web Usage Mining.” International Journal of Engineering Science and Computing, 2016, Vol.6, Issue.08, pp: 2954-2956.
Sriram, R., and Malliga, R., “Innovative Pre-Processing Technique and Efficient Unique User Identification Algorithm for Web Usage Mining.” International Journal of Advanced Research in Computer Science and Software Engineering, 2016, Vol.6, Issue.02, pp: 85-91.
Rathi, A., and Raipurkar, A., “Approach for processing of Web Usage Data.” International Research Journal of Engineering and Technology (IRJET), 2016, Vol.3, Issue.07, pp: 339-343
https://en.wikipedia.org/wiki/Data_mining#cite_note-10
Kuramochi M, Karypis G (2005) Gene Classification using Expression Profiles: A Feasibility Study. Int J Artif Intell Tools 14(4): pp 641–660
Gondek D, Hofmann T (2007) Non-redundant data clustering. Knowl Inf Syst 12(1): pp1–24
Fung G, Stoeckel J (2007) SVM feature selection for classification of SPECT images of Alzheimer’s disease using spatial information. Knowl Inf Syst 11(2): pp243–258
Langville AN, Meyer CD (2006) Google’s PageRank and beyond: the science of search engine rankings. Princeton University Press, Princeton
Washio T, Nakanishi K, Motoda H (2005) Association rules based on levelwise subspace clustering. In: Proceedings. of 9th European conference on principles and practice of knowledge discovery in databases. LNAI, vol 3721, pp. 692–700
DOI: https://doi.org/10.37628/jscrs.v7i1.1558
Refbacks
- There are currently no refbacks.