Abstract
Clustering algorithms are invaluable methods for organizing data into useful information. The CARD Algorithm [11 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.
Recommended Citation
Gandy, Lisa, Rahimi, Shahram and Gupta, Bidyut. "A Modified Competitive Agglomeration for Relational Data Algorithm." (Jun 2005).
Comments
Published in Gandy, L., Rahimi, S., & Gupta, B. (2005). A modified competitive agglomeration for relational data algorithm. Annual Meeting of the North American Fuzzy Information Processing Society, 2005. NAFIPS 2005, 210-215. doi: 10.1109/NAFIPS.2005.1548535 ©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.