Oyama, Satoshi and Manning, Christopher D. (2004) Using Feature Conjunctions across Examples for Learning Pairwise Classifiers. In: 15th European Conference on Machine Learning (ECML2004), September 20-24, 2004, Pisa, Italy.
This is the latest version of this item.
We propose a kernel method for using combinations of features across example pairs in learning pairwise classifiers. Identifying two instances in the same class is an important technique in duplicate detection, entity matching, and other clustering problems. However, it is a difficult problem when instances have few discriminative features. One typical example is to check whether two abbreviated author names in different papers refer to the same person or not. While using combinations of different features from each instance may improve the classification accuracy, doing this straightforwardly is computationally intensive. Our method uses interaction between different features without high computational cost using a kernel. At medium recall levels, this method can give a precision 4 to 8 times higher than that of previous methods in author matching problems.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||Kernel Methods, Support Vector Machines, Pairwise Classification, Learning Similarity Measures, Entity Matching, Duplicate Detection, Clustering|
Computer Science > Data Mining
Computer Science > Data Integration and Mediation
|Related URLs:||Project Homepage, Project Homepage||http://infolab.stanford.edu/, http://www-nlp.stanford.edu/|
|Deposited By:||Import Account|
|Deposited On:||02 Jul 2004 17:00|
|Last Modified:||23 Dec 2008 09:44|
Available Versions of this Item
- Using Feature Conjunctions across Examples for Learning Pairwise Classifiers. (deposited 27 Apr 2004 17:00)
- Using Feature Conjunctions across Examples for Learning Pairwise Classifiers. (deposited 02 Jul 2004 17:00) [Currently Displayed]
Repository Staff Only: item control page