Unsupervised relation extraction by mining Wikipedia texts using information from the web
Published 1 January 2009Open access
Yulan Yan, Naoaki Okazaki, Yutaka Matsuo, Zhenglu Yang, Mitsuru Ishizuka
Citations103
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents an unsupervised relation extraction method for discovering and enhancing relations in which a specified concept in Wikipedia participates using respective characteristics of Wikipedia articles and Web corpus, and develops a clustering approach based on combinations of patterns.
Abstract
This paper presents an unsupervised relation extraction method for discovering and enhancing relations in which a specified concept in Wikipedia participates. Using respective characteristics of Wikipedia articles and Web corpus, we develop a clustering approach based on combinations of patterns: dependency patterns from dependency analysis of texts in Wikipedia, and surface patterns generated from highly redundant information related to the Web. Evaluations of the proposed approach on two different domains demonstrate the superiority of the pattern combination over existing approaches. Fundamentally, our method demonstrates how deep linguistic patterns contribute complementarily with Web surface patterns to the generation of various relations.
Keywords
Computer ScienceSocial Sciences
NatureInternet encyclopaedias go head to head
1,985 Citations2005Jim Giles
Jimmy Wales' Wikipedia comes close to Britannica in terms of the accuracy of its science entries, a Nature investigation finds.
Open information extraction from the web
1,323 Citations2007Michele Banko, Michael Cafarella +3 more
Communications of the ACMOpen information extraction from the web
1,014 Citations2008Oren Etzioni, Michele Banko +2 more
Open IE (OIE), a new extraction paradigm where the system makes a single data-driven pass over its corpus and extracts a large set of relational tuples without requiring any human input, is introduced.
A shortest path dependency kernel for relation extraction
971 Citations2005Răzvan Bunescu, Raymond J. Mooney
Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel outperforms a recent approach based on dependency tree kernels.
Dependency tree kernels for relation extraction
825 Citations2004Aron Culotta, Jeffrey Sorensen
This work extends previous work on tree kernels to estimate the similarity between the dependency trees of sentences, and uses this kernel within a Support Vector Machine to detect and classify relations between entities in the Automatic Content Extraction (ACE) corpus of news articles.
Combining lexical, syntactic, and semantic features with maximum entropy models for extracting relations
608 Citations2004Nanda Kambhatla
This work employs Maximum Entropy models to combine diverse lexical, syntactic and semantic features derived from the text to obtain competitive results in the Automatic Content Extraction (ACE) evaluation.
Measuring semantic similarity between words using web search engines
544 Citations2007
A robust semantic similarity measure that uses the information available on the Web to measure similarity between words or entities and a novel approach to compute semantic similarity using automatically extracted lexico-syntactic patterns from text snippets is proposed.
Espresso
535 Citations2006Patrick Pantel, Marco Pennacchiotti
Experimental results show that the exploitation of generic patterns substantially increases system recall with small effect on overall precision, and a principled measure of pattern and instance reliability enabling the filtering algorithm.
Semantic Wikipedia
479 Citations2006Max Völkel, Markus Krötzsch +3 more
This paper provides an extension to be integrated in Wikipedia, that allows the typing of links between articles and the specification of typed data inside the articles in an easy-to-use manner, and presents the design, implementation, and possible uses of this extension.
Efficiently mining frequent trees in a forest
467 Citations2002Mohammed J. Zaki
This work presents TREEMinER, a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list, and finds that TREEMINER outperforms the pattern matching approach by a factor of 4 to 20, and has good scaleup properties.
Overcoming the brittleness bottleneck using wikipedia: enhancing text categorization with encyclopedic knowledge
404 Citations2006Evgeniy Gabrilovich, Shaul Markovitch
It is proposed to enrich document representation through automatic use of a vast compendium of human knowledge--an encyclopedia, and empirical results confirm that this knowledge-intensive representation brings text categorization to a qualitatively new level of performance across a diverse collection of datasets.
Discovering relations among named entities from large corpora
403 Citations2004Takaaki Hasegawa, Satoshi Sekine +1 more
Using one year of newspapers reveals not only that the relations among named entities could be detected with high recall and precision, but also that appropriate labels could be automatically provided for the relations.
A composite kernel to extract relations between entities with both flat and structured features
243 Citations2006Min Zhang, Jie Zhang +2 more
This study illustrates that the composite kernel can effectively capture both flat and structured features without the need for extensive feature engineering, and can also easily scale to include more features.
Direct mining of discriminative and essential frequent patterns via model-based search tree
103 Citations2008Wei Fan, Kun Zhang +6 more
This paper proposes a new and different method for frequent pattern mining that builds a decision tree that partitions the data onto different nodes, and directly discovers a discriminative pattern at each node to further divide its examples into purer subsets.
National Conference on Artificial IntelligenceRelation extraction from wikipedia using subtree mining
96 Citations2007Dat Nguyen, Yutaka Matsuo +1 more
This study addresses the problem of extracting relations among entities from Wikipedia's English articles, which in turn can serve for intelligent systems to satisfy users' information needs.
Expressing implicit semantic relations without supervision
94 Citations2006Peter D. Turney
An unsupervised learning algorithm that mines large text corpora for patterns that express implicit semantic relations, and achieves state-of-the-art results, performing significantly better than several alternative pattern ranking algorithms, based on tf-idf.
Unsupervised Feature Selection for Relation Extraction
70 Citations2005Jinxiu Chen, Donghong Ji +2 more
An unsupervised relation extraction algorithm, which induces relations between entity pairs by grouping them into a “natural” number of clusters based on the similarity of their contexts by employing a discriminative category matching (DCM).
Clustering for unsupervised relation identification
63 Citations2007Benjamin Rosenfeld, Ronen Feldman
A clustering evaluation metric is developed, specifically adapted for the relation identification task, and it is found that using both kinds of features with the best of the algorithms produces very high-precision results, significantly improving over the previous work.
Fully Unsupervised Discovery of Concept-Specific Relationships by Web Mining
62 Citations2007Dmitry Davidov, Ari Rappoport +1 more
A web mining method based on clustering patterns that contain concept words and other words related to them that discovers a whole range of relationships focused on the given concept, rather than generic known relationships as in most previous work.
International Joint Conference on Artificial IntelligenceShallow semantics for relation extraction
56 Citations2005Sanda M. Harabagiu, Cosmin A. Bejan +1 more
A new method for extracting meaningful relations from unstructured natural language sources based on information made available by shallow semantic parsers that surpassed the results of kernel-based models employing only semantic class information.
Classification of Semantic Relationships between Nominals Using Pattern Clusters
50 Citations2008Dmitry Davidov, Ari Rappoport
This work proposes a novel pattern clusters method for nominal relationship (NR) classification that strictly follows the ACL SemEval-07 Task 4 datasets and protocol, obtaining an f-score of 70.6, as opposed to 64.8 of the best previous work.
URES
36 Citations2006Benjamin Rosenfeld, Ronen Feldman
URES (Unsupervised Relation Extraction System), which extracts relations from the Web in a totally unsupervised way and demonstrates that using simple noun phrase tagger is sufficient as a base for accurate patterns and compares the approach with KnowItAll's fixed generic patterns.