• DocumentCode
    2228139
  • Title

    Concept decomposition by fuzzy k-means algorithm

  • Author

    Dobsa, Jasminka ; Basic, Bojana Dalbelo

  • Author_Institution
    Fac. of Organ. & Informatics, Zagreb Univ., Croatia
  • fYear
    2003
  • fDate
    13-17 Oct. 2003
  • Firstpage
    684
  • Lastpage
    688
  • Abstract
    The method of latent semantic indexing (LSI) is an information retrieval technique using a low-rank singular value decomposition (SVD) of the term-document matrix. Although the LSI method has empirical success, it suffers from the lack of interpretation for the low-rank approximation and, consequently, the lack of controls for accomplishing specific tasks in information retrieval. A method introduced by Dhillon and Modha is an improvement in that direction. It uses centroids of clusters or so called concept decomposition for lowering the rank of the term-document matrix. We focus on improvements of that method using fuzzy k-means algorithm. Also, we compare the precision of information retrieval for the two above methods.
  • Keywords
    approximation theory; document handling; fuzzy logic; indexing; information retrieval; singular value decomposition; LSI; SVD; concept decomposition; fuzzy k-means algorithm; information retrieval technique; latent semantic indexing; low-rank approximation; singular value decomposition; term-document matrix; Approximation algorithms; Clustering algorithms; Data mining; Indexing; Informatics; Information retrieval; Large scale integration; Matrix decomposition; Singular value decomposition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Web Intelligence, 2003. WI 2003. Proceedings. IEEE/WIC International Conference on
  • Print_ISBN
    0-7695-1932-6
  • Type

    conf

  • DOI
    10.1109/WI.2003.1241296
  • Filename
    1241296