Sciweavers

7581 search results - page 245 / 1517
» Incompleteness in Data Mining
Sort
View
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
16 years 7 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
16 years 7 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu
ICEIS
2009
IEEE
16 years 1 months ago
Minable Data Warehouse
Data warehouses have been widely used in various capacities such as large corporations or public institutions. These systems contain large and rich datasets that are often used by ...
David Morgan, Jai W. Kang, James M. Kang
DAWAK
2000
Springer
15 years 11 months ago
Enhancing Preprocessing in Data-Intensive Domains using Online-Analytical Processing
Abstract The application of data mining algorithms needs a goal-oriented preprocessing of the data. In practical applications the preprocessing task is very time consuming and has ...
Alexander Maedche, Andreas Hotho, Markus Wiese
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 9 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh