Sciweavers

1746 search results - page 225 / 350
» Hierarchical Unsupervised Learning
Sort
View
ICMLA
2003
15 years 5 months ago
Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
Lukasz A. Kurgan, Krzysztof J. Cios
130
Voted
JCP
2008
121views more  JCP 2008»
15 years 4 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
DATAMINE
2010
161views more  DATAMINE 2010»
15 years 1 months ago
Predicting labels for dyadic data
: In dyadic prediction, the input consists of a pair of items (a dyad), and the goal is to predict the value of an observation related to the dyad. Special cases of dyadic predicti...
Aditya Krishna Menon, Charles Elkan
ICASSP
2011
IEEE
14 years 8 months ago
Multiple kernel nonnegative matrix factorization
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
Shounan An, Jeong-Min Yun, Seungjin Choi