DocumentCode
2865916
Title
Hierarchical density-based clustering of uncertain data
Author
Kriegel, Hans-Peter ; Pfeifle, Martin
Author_Institution
Inst. for Comput. Sci., Munich Univ., Germany
fYear
2005
fDate
27-30 Nov. 2005
Abstract
The hierarchical density-based clustering algorithm OPTICS has proven to help the user to get an overview over large data sets. When using OPTICS for analyzing uncertain data which naturally occur in many emerging application areas, e.g. location based services, or sensor databases, the similarity between uncertain objects has to be expressed by one numerical distance value. Based on such single-valued distance functions OPTICS, like other standard data mining algorithms, can work without any changes. In this paper, we propose to express the similarity between two fuzzy objects by distance probability functions which assign a probability value to each possible distance value. Contrary to the traditional approach, we do not extract aggregated values from the fuzzy distance functions but enhance OPTICS so that it can exploit the full information provided by these functions. The resulting algorithm FOPTICS helps the user to get an overview over a large set of fuzzy objects.
Keywords
data mining; fuzzy set theory; pattern clustering; probability; data mining; distance probability function; fuzzy object similarity; hierarchical density-based clustering; single-valued distance function; uncertain data clustering; Algorithm design and analysis; Clustering algorithms; Data analysis; Data mining; Databases; Density functional theory; Distribution functions; Fuzzy sets; Optical sensors; Probability density function;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining, Fifth IEEE International Conference on
ISSN
1550-4786
Print_ISBN
0-7695-2278-5
Type
conf
DOI
10.1109/ICDM.2005.75
Filename
1565758
Link To Document