A Classification Technique using Associative Classification
نویسندگان
چکیده
منابع مشابه
Pattern classification using a linear associative memory
-Pattern classification is a very important image processing task. A typical pattern classification algorithm can be broken into two parts; first, the pattern features are extracted and, second, these features are compared with a stored set of reference features until a match is found. In the second part, usually one of the several clustering algorithms or similarity measures is applied. In thi...
متن کاملMultilabel Associative Text Classification Using Summarization
This paper deals with the concern of curse of dimensionality in the Text Classification problem using Text Summarization. Classification and association rule mining can produce well-organized as well as precise classifiers than established techniques [1]. However, associative classification technique still suffers from the vast set of mined rules. Thus, this work brings in advantages of Automat...
متن کاملEfficient Associative Classification using Genetic Network Programming
Classification and association rule mining are the two important tasks addressed in the data mining literature. Associative classification method applies association rule mining technique in classification and achieves higher classification accuracy. Associative classification method typically yields a large number of rules, from which a set of high quality rules are chosen to construct an effi...
متن کاملAssociative Classification Mining for Website Phishing Classification
-Website phishing is one of the crucial research topics for the internet community due to the massive number of online daily transactions. The process of predicting the phishing activity for a website is a typical classification problem in data mining where different website’s features such as URL length, prefix and suffix, IP address, etc., are used to discover concealed correlations (knowledg...
متن کاملLazy Associative Graph Classification
In this paper, we introduce a modification of the lazy associative classification which addresses the graph classification problem. To deal with intersections of large graphs, graph intersections are approximated with all common subgraphs up to a fixed size similarly to what is done with graphlet kernels. We illustrate the algorithm with a toy example and describe our experiments with a predict...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2430-3268