Abstract
In previous INEX years we presented an XML component ranking algorithm that was based on separation of nested XML elements to different indices. This worked fine for the IEEE collection which has a small number of potential component types that can be returned as query results. However, such an assumption doesn't scale to this year Wikipedia collection where there is a large set of potential component types that can be returned. We show a new version of the Component ranking algorithm that does not assume any knowledge on the set of component types. We then show some preliminary work we did to exploit the connectivity of the Wikipedia collection to improve ranking. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Mass, Y. (2007). IBM HRL at INEX 06. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4518 LNCS, pp. 151–159). Springer Verlag. https://doi.org/10.1007/978-3-540-73888-6_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
