Discovering Relations to Augment a Web-scale Knowledge Base Constructed from the Web
Article No.: 16, Pages 1 - 12
Abstract
We propose a method for automatically discovering new knowledge from a knowledge base consisting of entity-relation-entity triples, constructed automatically from the Web. This method infers new relations between entity pairs by exploiting the structure of massive graphs, which can be obtained by linking existing entity-relation-entity triples. After identifying an unlinked entity pair likely to have a strong association from the graphs and a connected component around it, the method learns a new relation name from a similar structure. More precisely, it retrieves other connected components containing a similar structure and finds a new relation between the entities. The process can be considered a simple form of analogical reasoning, followed by identifying an additional relation in the searched connected component in the knowledge base. We used two datasets to evaluate the performance of this method. The ReVerb dataset, a large-scale knowledge base constructed from an Open Information Extraction method, was used to demonstrate its scalability and accuracy in comparison with SHERLOCK and other baselines. Our evaluation with the YAGO dataset showed the proposed method is applicable to other types of knowledge bases that are not from the Open Information Extraction paradigm.
References
[1]
Banko, M., Cafarella, M. and Soderland, S. 2007. Open information extraction from the web. IJCAI. (2007), 2670--2676.
[2]
Berant, J., Dagan, I. and Goldberger, J. 2010. Global learning of focused entailment graphs. Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics. July (2010), 1220--1229.
[3]
Bollacker, K., Evans, C., Paritosh, P., Sturge, T. and Taylor, J. 2008. Freebase: a collaboratively created graph database for structuring human knowledge. SIGMOD 08 Proceedings of the 2008 ACM SIGMOD international conference on Management of data. (2008), 1247--1250.
[4]
Carlson, A., Betteridge, J. and Kisiel, B. 2010. Toward an Architecture for Never-Ending Language Learning. AAAI. (2010).
[5]
Chen, Y. and Wang, D.Z. 2014. Knowledge expansion over probabilistic knowledge bases. Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14. (2014), 649--660.
[6]
Corro, L. Del and Gemulla, R. 2013. ClausIE: Clause-Based Open Information Extraction. Proceedings of the 22nd international conference on World Wide Web (2013), 355--365.
[7]
Dong, L., Li, Y., Yin, H., Le, H. and Rui, M. 2013. The Algorithm of Link Prediction on Social Network. Mathematical Problems in Engineering. 2013, (2013), 1--7.
[8]
Dong, L., Li, Y., Yin, H., Le, H. and Rui, M. 2013. The algorithm of link prediction on social network. Mathematical Problems in Engineering. 2013, (2013).
[9]
Dong, X.L., Gabrilovich, E., Heitz, G., Horn, W., Lao, N., Murphy, K., Strohmann, T., Sun, S. and Zhang, W. 2014. Knowledge Vault: A Web-Scale Approach to Probabilistic Knowledge Fusion. Kdd. (2014), 601--610.
[10]
Fabian, M., Gjergji, K. and Gerhard, W. 2007. YAGO: A core of semantic knowledge unifying wordnet and wikipedia. 16th International World Wide Web Conference, (2007), 697--706.
[11]
Fader, A., Soderland, S. and Etzioni, O. 2011. Identifying relations for open information extraction. Proceedings of the Conference on Empirical Methods in Natural Language Processing (2011), 1535--1545.
[12]
Kossinets, G. 2006. Effects of missing data in social networks. Social Networks. 28, 3 (2006), 247--268.
[13]
Lin, T., Mausam and Etzioni, O. 2012. Entity Linking at Web Scale. AKBC-WEKEX '12 Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction. 2012, (2012), 84--88.
[14]
Manning, C.D., Surdeanu, M., Bauer, J., Finkel, J., Bethard, S.J. and McClosky, D. 2014. The {Stanford} {CoreNLP} Natural Language Processing Toolkit. Proceedings of 52nd Annual Meeting of the Association for Computational Linguistics: System Demonstrations (2014), 55--60.
[15]
Mitchell, T., William, W. and Cohen, W. 2011. Random Walk Inference and Learning in A Large Scale Knowledge Base. Proceedings of the Conference on Empirical Methods in Natural Language Processing. March (2011), 529--539.
[16]
Nakashole, N., Weikum, G. and Suchanek, F. 2012. PATTY: a taxonomy of relational patterns with semantic types. Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (2012).
[17]
O'Madadhain, J., Fisher, D., White, S. and Boey, Y. 2003. The JUNG (Java Universal Network/Graph) Framework.
[18]
Saeger, S. De and Torisawa, K. 2011. Relation acquisition using word classes and partial patterns. Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics (2011), 825--835.
[19]
Schmitz, M., Bart, R., Soderland, S. and Etzioni, O. 2012. Open language learning for information extraction. Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. (2012), 523--534.
[20]
Schoenmackers, S. and Etzioni, O. 2010. Learning firstorder horn clauses from web text. Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing. (2010), 1088--1098.
[21]
Vrandečić, D. 2012. Wikidata: a new platform for collaborative data collection. Proceedings of the 21st international conference companion on World Wide Web (2012), 4503.
[22]
Wu, F. and Weld, D. 2010. Open information extraction using Wikipedia. Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (2010), 118--127.
[23]
Zhou, T., Lü, L. and Zhang, Y.C. 2009. Predicting missing links via local information. European Physical Journal B. 71, 4 (2009), 623--630.
- Discovering Relations to Augment a Web-scale Knowledge Base Constructed from the Web
Recommendations
Determining Relation Semantics by Mapping Relation Phrases to Knowledge Base
ACPR '13: Proceedings of the 2013 2nd IAPR Asian Conference on Pattern RecognitionOpen Information Extraction (Open IE) recognizes domain-independent relational triples from natural language texts but does not recognize the exact semantics of the triples. Nevertheless, relations in existing knowledge bases, like manually edited ...
A Rule-Based Approach to Extracting Relations from Music Tidbits
WWW '15 Companion: Proceedings of the 24th International Conference on World Wide WebThis paper presents a rule based approach to extracting relations from unstructured music text sources. The proposed approach identifies and disambiguates musical entities in text, such as songs, bands, persons, albums and music genres. Candidate ...
Canonicalizing Open Knowledge Bases
CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge ManagementOpen information extraction approaches have led to the creation of large knowledge bases from the Web. The problem with such methods is that their entities and relations are not canonicalized, leading to redundant and ambiguous facts. For example, they ...
Comments
Information & Contributors
Information
Published In
June 2016
309 pages
ISBN:9781450340564
DOI:10.1145/2912845
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 June 2016
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
WIMS '16
WIMS '16: International Conference on Web Intelligence, Mining and Semantics
June 13 - 15, 2016
Nîmes, France
Acceptance Rates
WIMS '16 Paper Acceptance Rate 36 of 53 submissions, 68%;
Overall Acceptance Rate 140 of 278 submissions, 50%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 77Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in