Skip to main navigation Skip to search Skip to main content

Generalized entropy and projection clustering of categorical data

  • University of Massachusetts Boston

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We generalize the notion of entropy for a set of attributes of a table and we study its applications to clustering of categorical data. This new concept allows greater flexibility in identifying sets of attribu- tes and, in a certain case, is naturally related to the average distance between the records that are the object of clustering. An algorithm that identifies clusterable sets of attributes (using several types of entropy) is also presented as well as experimental results obtained with this algorithm.

Original languageEnglish
Title of host publicationPrinciples of Data Mining and Knowledge Discovery - 4th European Conference, PKDD 2000, Proceedings
EditorsDjamel A. Zighed, Jan Komorowski, Jan Zytkow
PublisherSpringer Verlag
Pages619-625
Number of pages7
ISBN (Print)9783540410669
DOIs
StatePublished - 2000
Event4th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2000 - Lyon, France
Duration: Sep 13 2000 → Sep 16 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1910
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2000
Country/TerritoryFrance
CityLyon
Period9/13/00 → 9/16/00

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Generalized entropy and projection clustering of categorical data'. Together they form a unique fingerprint.

Cite this