Sciweavers

886 search results - page 11 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 7 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
FLAIRS
2004
13 years 11 months ago
Multimodal Function Optimization Using Local Ruggedness Information
In multimodal function optimization, niching techniques create diversification within the population, thus encouraging heterogeneous convergence. The key to the effective diversif...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
AAAI
2008
13 years 12 months ago
The PELA Architecture: Integrating Planning and Learning to Improve Execution
Building architectures for autonomous rational behavior requires the integration of several AI components, such as planning, learning and execution monitoring. In most cases, the ...
Sergio Jiménez, Fernando Fernández, ...
TPHOL
1997
IEEE
14 years 1 months ago
Higher Order Quotients and their Implementation in Isabelle HOL
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence...
Oscar Slotosch
DAS
2010
Springer
14 years 1 months ago
Towards more effective distance functions for word image matching
Matching word images has many applications in document recognition and retrieval systems. Dynamic Time Warping (DTW) is popularly used to estimate the similarity between word imag...
Raman Jain, C. V. Jawahar