• DocumentCode
    589300
  • Title

    Extraction of Strong Associations in Classes of Similarities

  • Author

    Biskri, Ismail ; Rompre, L. ; Descoteaux, S. ; Achouri, A. ; Benasaber, B.A.

  • Author_Institution
    Lab. de Math. et d´Inf. Appl. (LAMIA), Univ. du Quebec a Trois-Rivieres, Trois-Rivières, QC, Canada
  • Volume
    2
  • fYear
    2012
  • fDate
    12-15 Dec. 2012
  • Firstpage
    56
  • Lastpage
    61
  • Abstract
    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.
  • Keywords
    data analysis; data mining; document handling; pattern classification; automated textual document classification process; data analysis; data submission; maximal association rules; similarity classes; strong association extraction; Association rules; Classification algorithms; Noise measurement; Printers; Support vector machine classification; Text categorization; Vocabulary; classification; maximal association rules;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Applications (ICMLA), 2012 11th International Conference on
  • Conference_Location
    Boca Raton, FL
  • Print_ISBN
    978-1-4673-4651-1
  • Type

    conf

  • DOI
    10.1109/ICMLA.2012.187
  • Filename
    6406726