A modified competitive agglomeration for relational data algorithm

Clustering algorithms are invaluable methods for organizing data into useful information. The CARD algorithm (Nasroui et al., 2000) 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 are explored and modified to yield a more practical and efficient algorithm.