Extracting Web user profiles using a modified CARD algorithm

Shahram Rahimi, Lisa Gandy, Bidyut Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2006 IEEE International Conference on Fuzzy Systems
Pages582-589
Number of pages8
DOIs
StatePublished - 2006
Event2006 IEEE International Conference on Fuzzy Systems - Vancouver, BC, Canada
Duration: Jul 16 2006Jul 21 2006

Publication series

NameIEEE International Conference on Fuzzy Systems
ISSN (Print)1098-7584

Conference

Conference2006 IEEE International Conference on Fuzzy Systems
Country/TerritoryCanada
CityVancouver, BC
Period07/16/0607/21/06

Fingerprint

Dive into the research topics of 'Extracting Web user profiles using a modified CARD algorithm'. Together they form a unique fingerprint.

Cite this