• DocumentCode
    2213846
  • Title

    Binary data clustering based on Wiener transformation

  • Author

    Kumar, D. Arun ; Loraine Charlet Annie, M.C.

  • Author_Institution
    Dept. of Comput. Sci., Gov. Arts Coll., Trichy, India
  • fYear
    2012
  • fDate
    21-23 March 2012
  • Firstpage
    55
  • Lastpage
    60
  • Abstract
    Clustering is the process of grouping similar items. Clustering becomes very tedious when data dimensionality and sparsity increases. Binary data are the simplest form of data used in information systems for very large database and it is very efficient based on computational efficiency, memory capacity to represent categorical type data. Usually the binary data clustering is done by using 0 and 1 as numerical value. In this paper, the binary data clustering is performed by preprocessing the binary data to real by wiener transformation. Wiener is a linear Transformation based upon statistics and it is optimal in terms of Mean square error. Computational results show that the clustering based on Wiener transformation is very efficient in terms of objectivity and subjectivity.
  • Keywords
    mean square error methods; pattern clustering; statistical analysis; transforms; binary data clustering; categorical-type data representation; computational efficiency; data dimensionality; data sparsity; information systems; linear Wiener transformation; memory capacity; objectivity; optimal mean square error; similar item grouping; statistical analysis; subjectivity; Algorithm design and analysis; Cities and towns; Clustering algorithms; Euclidean distance; Hamming distance; Partitioning algorithms; Vectors; binary data; wiener transformation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition, Informatics and Medical Engineering (PRIME), 2012 International Conference on
  • Conference_Location
    Salem, Tamilnadu
  • Print_ISBN
    978-1-4673-1037-6
  • Type

    conf

  • DOI
    10.1109/ICPRIME.2012.6208287
  • Filename
    6208287