Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-73888-6_15 | COMPARATIVE EVALUATION OF XML INFORMATION RETRIEVAL SYSTEMS |
Field | DocType | Volume |
Small number,IBM,Information retrieval,XML,Ranking,Computer science,Exploit | Conference | 4518 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
4 | 1 | |