On High Dimensional Data Spaces
Subhrakanti Dey, Sophie Roberts · WIT transactions on information and communication technologies · 2002
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
WIT transactions on information and communication technologies · WIT Press · article · 2002
Abstract
Data mining applications usually encounter high dimensional data spaces. Most of these dimensions contain ‘uninteresting’ data, which would not only be of little value in terms of discovery of any rules or patterns, but have been shown to mislead some classification algorithms. Since, the computational effort increases very significantly (usually exponentially) in the presence of a large number of attributes, it is highly desirable that all irrelevant attributes be weeded out at an early stage. Often, patterns of interest are embedded in lower dimensional subspaces of data.
If the data space S has k attributes G {al, a2...a~), then a n-dimensional subspace s. of the data space S can be formed by selecting a combination of n attributes from the set {al,az...ak), where n < k. It is usual to tackle this problem by getting some attributes and subspaces identified by the user (or domain experts). For even moderately large number of attributes, the number of possible subspaces is so large, that it is quite unlikely that the ‘experts’ would be able to identify all the ‘interesting’ subspaces.
Open the resolved locator · 10.2495/data020251
Metadata licence: OpenAlex metadata (CC0)