475 search results - page 11 / 95 » A Distance-Based Packing Method for High Dimensional Data |
ICANN
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...
IDEAL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Normal mixture models are often used to cluster continuous data. However, conventional approaches for fitting these models will have problems in producing nonsingular es...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- In recent years, data streams have become ubiquitous because of advances in hardware and software technology. The ability to adapt conventional mining problems to data s...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...