A modified competitive agglomeration for relational data algorithm

Lisa Gandy; Shahram Rahimi; Bidyut Gupta

doi:10.1109/NAFIPS.2005.1548535

A modified competitive agglomeration for relational data algorithm

Lisa Gandy, Shahram Rahimi, Bidyut Gupta

Computer Science

Research output: Contribution to conference › Paper › peer-review

4 Scopus citations

Abstract

Clustering algorithms are invaluable methods for organizing data into useful information. The CARD Algorithm [1] 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.

Original language	English
Pages	210-215
Number of pages	6
DOIs	https://doi.org/10.1109/NAFIPS.2005.1548535
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

Conference	NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society
Country/Territory	United States
City	Detroit, MI
Period	06/26/05 → 06/28/05

Access to Document

10.1109/NAFIPS.2005.1548535

Cite this

@conference{1fe881832ef949ce8c8dd5afe5ab45de,

title = "A modified competitive agglomeration for relational data algorithm",

abstract = "Clustering algorithms are invaluable methods for organizing data into useful information. The CARD Algorithm [1] 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.",

author = "Lisa Gandy and Shahram Rahimi and Bidyut Gupta",

year = "2005",

doi = "10.1109/NAFIPS.2005.1548535",

language = "English",

pages = "210--215",

note = "NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society ; Conference date: 26-06-2005 Through 28-06-2005",

}

TY - CONF

T1 - A modified competitive agglomeration for relational data algorithm

AU - Gandy, Lisa

AU - Rahimi, Shahram

AU - Gupta, Bidyut

PY - 2005

Y1 - 2005

N2 - Clustering algorithms are invaluable methods for organizing data into useful information. The CARD Algorithm [1] 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.

AB - Clustering algorithms are invaluable methods for organizing data into useful information. The CARD Algorithm [1] 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.

UR - http://www.scopus.com/inward/record.url?scp=33744986718&partnerID=8YFLogxK

U2 - 10.1109/NAFIPS.2005.1548535

DO - 10.1109/NAFIPS.2005.1548535

M3 - Paper

AN - SCOPUS:33744986718

SP - 210

EP - 215

T2 - NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society

Y2 - 26 June 2005 through 28 June 2005

ER -

A modified competitive agglomeration for relational data algorithm

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this