Sciweavers

358 search results - page 49 / 72
» Learning from labeled and unlabeled data on a directed graph
Sort
View
FLAIRS
2006
15 years 1 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
113
Voted
WWW
2011
ACM
14 years 6 months ago
Towards semantic knowledge propagation from text corpus to web images
In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge bet...
Guojun Qi, Charu C. Aggarwal, Thomas Huang
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
15 years 4 months ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 3 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
ICML
2002
IEEE
16 years 19 days ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...