Difference between revisions of "Understanding Graph Structure of Wikipedia for Query Expansion"
(+ links) |
(Infobox work) |
||
Line 1: | Line 1: | ||
+ | {{Infobox work | ||
+ | | title = Understanding Graph Structure of Wikipedia for Query Expansion | ||
+ | | date = 2015 | ||
+ | | authors = [[Joan Guisado-Gámez]]<br />[[Arnau Prat-Pérez]] | ||
+ | | doi = 10.1145/2764947.2764953 | ||
+ | | link = https://dl.acm.org/citation.cfm?id=2764953 | ||
+ | | plink = https://arxiv.org/pdf/1505.01306v1 | ||
+ | }} | ||
'''Understanding Graph Structure of Wikipedia for Query Expansion''' - scientific work related to [[Wikipedia quality]] published in 2015, written by [[Joan Guisado-Gámez]] and [[Arnau Prat-Pérez]]. | '''Understanding Graph Structure of Wikipedia for Query Expansion''' - scientific work related to [[Wikipedia quality]] published in 2015, written by [[Joan Guisado-Gámez]] and [[Arnau Prat-Pérez]]. | ||
== Overview == | == Overview == | ||
Knowledge bases are very good sources for knowledge extraction, the ability to create knowledge from structured and unstructured sources and use it to improve automatic processes as query expansion. However, extracting knowledge from unstructured sources is still an open challenge [9]. In this respect, understanding the structure of knowledge bases can provide significant benefits for the effectiveness of such purpose. In particular, [[Wikipedia]] has become a very popular knowledge base in the last years because it is a general encyclopedia that has a large amount of information and thus, covers a large amount of different topics. In this piece of work, authors analyze how articles and [[categories]] of Wikipedia relate to each other and how these relationships can support a query expansion technique. In particular, authors show that the structures in the form of dense cycles with a minimum amount of categories tend to identify the most relevant information. | Knowledge bases are very good sources for knowledge extraction, the ability to create knowledge from structured and unstructured sources and use it to improve automatic processes as query expansion. However, extracting knowledge from unstructured sources is still an open challenge [9]. In this respect, understanding the structure of knowledge bases can provide significant benefits for the effectiveness of such purpose. In particular, [[Wikipedia]] has become a very popular knowledge base in the last years because it is a general encyclopedia that has a large amount of information and thus, covers a large amount of different topics. In this piece of work, authors analyze how articles and [[categories]] of Wikipedia relate to each other and how these relationships can support a query expansion technique. In particular, authors show that the structures in the form of dense cycles with a minimum amount of categories tend to identify the most relevant information. |
Revision as of 13:53, 21 December 2019
Authors | Joan Guisado-Gámez Arnau Prat-Pérez |
---|---|
Publication date | 2015 |
DOI | 10.1145/2764947.2764953 |
Links | Original Preprint |
Understanding Graph Structure of Wikipedia for Query Expansion - scientific work related to Wikipedia quality published in 2015, written by Joan Guisado-Gámez and Arnau Prat-Pérez.
Overview
Knowledge bases are very good sources for knowledge extraction, the ability to create knowledge from structured and unstructured sources and use it to improve automatic processes as query expansion. However, extracting knowledge from unstructured sources is still an open challenge [9]. In this respect, understanding the structure of knowledge bases can provide significant benefits for the effectiveness of such purpose. In particular, Wikipedia has become a very popular knowledge base in the last years because it is a general encyclopedia that has a large amount of information and thus, covers a large amount of different topics. In this piece of work, authors analyze how articles and categories of Wikipedia relate to each other and how these relationships can support a query expansion technique. In particular, authors show that the structures in the form of dense cycles with a minimum amount of categories tend to identify the most relevant information.