HSM: Heterogeneous Subspace Mining in High Dimensional Data
Publication: Research - peer-review › Conference article in Journal
Heterogeneous data, i.e. data with both categorical and continuous values, is common in many databases. However, most data mining algorithms assume either continuous or categorical attributes, but not both. In high dimensional data, phenomena due to the "curse of dimensionality" pose additional challenges. Usually, due to locally varying relevance of attributes, patterns do not show across the full set of attributes.
In this paper we propose HSM, which defines a new pattern model for heterogeneous high dimensional data. It allows data mining in arbitrary subsets of the attributes that are relevant for the respective patterns. Based on this model we propose an efficient algorithm, which is aware of the heterogeneity of the attributes. We extend an indexing structure for continuous attributes such that HSM indexing adapts to different attribute types. In our experiments we show that HSM efficiently mines patterns in arbitrary subspaces of heterogeneous high dimensional data.
|Book series||Lecture Notes in Computer Science|
|Conference||International Conference on Scientific and Statistical Database Management (SSDBM 2009)|
|City||New Orleans, Louisiana|
|Period||02/06/09 → 04/06/09|