Sciweavers

Share
MLG
2007
Springer
9 years 6 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens
ISNN
2009
Springer
9 years 6 months ago
Use of Ensemble Based on GA for Imbalance Problem
In real-world applications, it has been observed that class imbalance (significant differences in class prior probabilities) may produce an important deterioration of the classifie...
Laura Cleofas, Rosa Maria Valdovinos, Vicente Garc...
ICPR
2002
IEEE
10 years 1 months ago
Adaptive Kernel Metric Nearest Neighbor Classification
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions due to the curse-ofdimensionality. Sev...
Jing Peng, Douglas R. Heisterkamp, H. K. Dai
ICPR
2006
IEEE
10 years 1 months ago
Dissimilarity-based classification for vectorial representations
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
Elzbieta Pekalska, Robert P. W. Duin
CVPR
2005
IEEE
10 years 2 months ago
Local Discriminant Embedding and Its Variants
We present a new approach, called local discriminant embedding (LDE), to manifold learning and pattern classification. In our framework, the neighbor and class relations of data a...
Hwann-Tzong Chen, Huang-Wei Chang, Tyng-Luh Liu
books