By Topic

Extraction of Strong Associations in Classes of Similarities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Biskri, I. ; Lab. de Math. et d'Inf. Appl. (LAMIA), Univ. du Quebec a Trois-Rivieres, Trois-Rivières, QC, Canada ; Rompre, L. ; Descoteaux, S. ; Achouri, A.
more authors

Several algorithms are proposed to support the process of automated classification of textual documents. Each of these algorithms has characteristics that influence the classification result. Depending on the amount and nature of the data submitted, the quality of results may vary considerably from one algorithm to another. The generated classes are often noisy. In addition, the number of classes created can be significant. These constraints can easily become barriers to data analysis. This paper presents a method that exploits the notion of association rules to extract regularities in the classes of similarities produced by classifiers.

Published in:

Machine Learning and Applications (ICMLA), 2012 11th International Conference on  (Volume:2 )

Date of Conference:

12-15 Dec. 2012