Sciweavers

2695 search results - page 247 / 539
» Learning Graph Matching
Sort
View
119
Voted
ACSC
2001
IEEE
15 years 7 months ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
151
Voted
ML
2010
ACM
141views Machine Learning» more  ML 2010»
15 years 2 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
122
Voted
AAAI
2006
15 years 5 months ago
Unsupervised Order-Preserving Regression Kernel for Sequence Analysis
In this work, a generalized method for learning from sequence of unlabelled data points based on unsupervised order-preserving regression is proposed. Sequence learning is a funda...
Young-In Shin
110
Voted
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
15 years 10 months ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
152
Voted
ECML
2006
Springer
15 years 7 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang