Sciweavers

1290 search results - page 138 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
SSPR
2004
Springer
15 years 11 months ago
Kernel Methods for Exploratory Pattern Analysis: A Demonstration on Text Data
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to...
Tijl De Bie, Nello Cristianini
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
16 years 12 days ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
ICML
1994
IEEE
15 years 10 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
ICPR
2000
IEEE
16 years 7 months ago
Precise Hand-printed Character Recognition Using Elastic Models via Nonlinear Transformation
Distorted character recognition is a difficult but inevitable problem in hand-printed character recognition. In this paper, we propose a character recognition method using elastic...
Tsuyoshi Kato, Shinichiro Omachi, Hirotomo Aso
SEMWEB
2007
Springer
16 years 15 days ago
Towards Correspondence Patterns for Ontology Mediation
We introduce in this paper correspondence patterns as a tool to design ontology alignments. Based on existing research on patterns in the fields of software and ontology engineeri...
François Scharffe, Ying Ding, Dieter Fensel