Sciweavers

17688 search results - page 121 / 3538
» Data Set Balancing
Sort
View
EUROPAR
1999
Springer
15 years 8 months ago
Parallel k/h-Means Clustering for Large Data Sets
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
Kilian Stoffel, Abdelkader Belkoniene
CIDM
2009
IEEE
15 years 11 months ago
Diversity analysis on imbalanced data sets by using ensemble models
— Many real-world applications have problems when learning from imbalanced data sets, such as medical diagnosis, fraud detection, and text classification. Very few minority clas...
Shuo Wang, Xin Yao
DEXAW
2010
IEEE
204views Database» more  DEXAW 2010»
15 years 5 months ago
Scalable Recursive Top-Down Hierarchical Clustering Approach with Implicit Model Selection for Textual Data Sets
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...
Markus Muhr, Vedran Sabol, Michael Granitzer
ICAD
2004
15 years 5 months ago
Orchestration Within the Sonification of Basic Data Sets
The use of sonification as a means of representing and analysing data has become a growing field of research in recent years and as such has become a far more accepted means of wo...
Charlie Cullen, Eugene Coyle
CORR
2002
Springer
144views Education» more  CORR 2002»
15 years 4 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier