TY - GEN
T1 - Extracting Web user profiles using a modified CARD algorithm
AU - Rahimi, Shahram
AU - Gandy, Lisa
AU - Gupta, Bidyut
PY - 2006
Y1 - 2006
N2 - Clustering algorithms are widely used methods for organizing data into useful information. The Competitive Agglomeration for Relational Data (CARD) Algorithm is one such clustering 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 an extended execution time. In addition, the methods that prepare the input data for the CARD algorithm's use employs concepts which seem to be incomplete. These limitations of the CARD algorithm are explored and modifications are introduced to yield a more practical and efficient algorithm.
AB - Clustering algorithms are widely used methods for organizing data into useful information. The Competitive Agglomeration for Relational Data (CARD) Algorithm is one such clustering 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 an extended execution time. In addition, the methods that prepare the input data for the CARD algorithm's use employs concepts which seem to be incomplete. These limitations of the CARD algorithm are explored and modifications are introduced to yield a more practical and efficient algorithm.
UR - http://www.scopus.com/inward/record.url?scp=34250785552&partnerID=8YFLogxK
U2 - 10.1109/FUZZY.2006.1681770
DO - 10.1109/FUZZY.2006.1681770
M3 - Conference contribution
AN - SCOPUS:34250785552
SN - 0780394887
SN - 9780780394889
T3 - IEEE International Conference on Fuzzy Systems
SP - 582
EP - 589
BT - 2006 IEEE International Conference on Fuzzy Systems
Y2 - 16 July 2006 through 21 July 2006
ER -