Sciweavers

172 search results - page 34 / 35
» Independent informative subgraph mining for graph informatio...
Sort
View
ICML
2007
IEEE
14 years 6 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
NIPS
2001
13 years 6 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
CIKM
2009
Springer
13 years 10 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009
AAAI
1990
13 years 6 months ago
Constructor: A System for the Induction of Probabilistic Models
The probabilistic network technology is a knowledgebased technique which focuses on reasoning under uncertainty. Because of its well defined semantics and solid theoretical founda...
Robert M. Fung, Stuart L. Crawford
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
13 years 11 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...