Clustering algorithms are invaluable methods for organizing data into useful information. The CARD Algorithm  is one such algorithm that is designed to organize user sessions into profiles, where each profile would highlight a particular type of user. The CARD algorithm is a viable candidate for web clustering. However it does have limitations such as long execution time. In addition, the data preparation for the algorithm's requirements employs concepts that are incomplete. These limitations of the algorithm will be explored and modified to yield a more practical and efficient algorithm.
|Number of pages||6|
|State||Published - 2005|
|Event||NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society - Detroit, MI, United States|
Duration: Jun 26 2005 → Jun 28 2005
|Conference||NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society|
|Period||06/26/05 → 06/28/05|