Matches in SemOpenAlex for { <https://semopenalex.org/work/W1979963107> ?p ?o ?g. }
- W1979963107 endingPage "92" @default.
- W1979963107 startingPage "54" @default.
- W1979963107 abstract "A standard approach to Information Retrieval (IR) is to model text as a bag of words. Alternatively, text can be modelled as a graph, whose vertices represent words, and whose edges represent relations between the words, defined on the basis of any meaningful statistical or linguistic relation. Given such a text graph, graph theoretic computations can be applied to measure various properties of the graph, and hence of the text. This work explores the usefulness of such graph-based text representations for IR. Specifically, we propose a principled graph-theoretic approach of (1) computing term weights and (2) integrating discourse aspects into retrieval. Given a text graph, whose vertices denote terms linked by co-occurrence and grammatical modification, we use graph ranking computations (e.g. PageRank Page et al. in The pagerank citation ranking: Bringing order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998) to derive weights for each vertex, i.e. term weights, which we use to rank documents against queries. We reason that our graph-based term weights do not necessarily need to be normalised by document length (unlike existing term weights) because they are already scaled by their graph-ranking computation. This is a departure from existing IR ranking functions, and we experimentally show that it performs comparably to a tuned ranking baseline, such as BM25 (Robertson et al. in NIST Special Publication 500-236: TREC-4, 1995). In addition, we integrate into ranking graph properties, such as the average path length, or clustering coefficient, which represent different aspects of the topology of the graph, and by extension of the document represented as a graph. Integrating such properties into ranking allows us to consider issues such as discourse coherence, flow and density during retrieval. We experimentally show that this type of ranking performs comparably to BM25, and can even outperform it, across different TREC (Voorhees and Harman in TREC: Experiment and evaluation in information retrieval, MIT Press, 2005) datasets and evaluation measures." @default.
- W1979963107 created "2016-06-24" @default.
- W1979963107 creator A5021439660 @default.
- W1979963107 creator A5045425016 @default.
- W1979963107 date "2011-06-28" @default.
- W1979963107 modified "2023-10-09" @default.
- W1979963107 title "Graph-based term weighting for information retrieval" @default.
- W1979963107 cites W1509141413 @default.
- W1979963107 cites W1570914598 @default.
- W1979963107 cites W1599207601 @default.
- W1979963107 cites W1971421925 @default.
- W1979963107 cites W1976320242 @default.
- W1979963107 cites W1976969221 @default.
- W1979963107 cites W1979076595 @default.
- W1979963107 cites W1980318031 @default.
- W1979963107 cites W1983202741 @default.
- W1979963107 cites W1985313309 @default.
- W1979963107 cites W1989921625 @default.
- W1979963107 cites W1990280147 @default.
- W1979963107 cites W1991382440 @default.
- W1979963107 cites W1994517162 @default.
- W1979963107 cites W1999713929 @default.
- W1979963107 cites W2005181355 @default.
- W1979963107 cites W2006052322 @default.
- W1979963107 cites W2006163720 @default.
- W1979963107 cites W2010526455 @default.
- W1979963107 cites W2012453466 @default.
- W1979963107 cites W2013614800 @default.
- W1979963107 cites W2027359109 @default.
- W1979963107 cites W2027881554 @default.
- W1979963107 cites W2032516423 @default.
- W1979963107 cites W2033316778 @default.
- W1979963107 cites W2037705937 @default.
- W1979963107 cites W2038195874 @default.
- W1979963107 cites W2039976898 @default.
- W1979963107 cites W2042881492 @default.
- W1979963107 cites W2043909051 @default.
- W1979963107 cites W2044340178 @default.
- W1979963107 cites W2049709809 @default.
- W1979963107 cites W2052562589 @default.
- W1979963107 cites W2055518963 @default.
- W1979963107 cites W2060464767 @default.
- W1979963107 cites W2070722739 @default.
- W1979963107 cites W2071721277 @default.
- W1979963107 cites W2076196860 @default.
- W1979963107 cites W2078875869 @default.
- W1979963107 cites W2079641356 @default.
- W1979963107 cites W2081375810 @default.
- W1979963107 cites W2085904853 @default.
- W1979963107 cites W2086790337 @default.
- W1979963107 cites W2090618725 @default.
- W1979963107 cites W2091362531 @default.
- W1979963107 cites W2092552912 @default.
- W1979963107 cites W2105544934 @default.
- W1979963107 cites W2106154218 @default.
- W1979963107 cites W2112090702 @default.
- W1979963107 cites W2114082868 @default.
- W1979963107 cites W2114484738 @default.
- W1979963107 cites W2120061223 @default.
- W1979963107 cites W2124637492 @default.
- W1979963107 cites W2125053512 @default.
- W1979963107 cites W2125297759 @default.
- W1979963107 cites W2126184790 @default.
- W1979963107 cites W2128084896 @default.
- W1979963107 cites W2130476447 @default.
- W1979963107 cites W2138621811 @default.
- W1979963107 cites W2140556333 @default.
- W1979963107 cites W2142063041 @default.
- W1979963107 cites W2142120379 @default.
- W1979963107 cites W2144211451 @default.
- W1979963107 cites W2145337444 @default.
- W1979963107 cites W2147236181 @default.
- W1979963107 cites W2148606196 @default.
- W1979963107 cites W2149055390 @default.
- W1979963107 cites W2153853264 @default.
- W1979963107 cites W2153974476 @default.
- W1979963107 cites W2160885631 @default.
- W1979963107 cites W2769133055 @default.
- W1979963107 cites W3101913037 @default.
- W1979963107 cites W3103786587 @default.
- W1979963107 cites W4206012007 @default.
- W1979963107 cites W4206765718 @default.
- W1979963107 cites W4210731599 @default.
- W1979963107 cites W4214502461 @default.
- W1979963107 cites W4234200495 @default.
- W1979963107 cites W4312512934 @default.
- W1979963107 cites W950821216 @default.
- W1979963107 doi "https://doi.org/10.1007/s10791-011-9172-x" @default.
- W1979963107 hasPublicationYear "2011" @default.
- W1979963107 type Work @default.
- W1979963107 sameAs 1979963107 @default.
- W1979963107 citedByCount "154" @default.
- W1979963107 countsByYear W19799631072012 @default.
- W1979963107 countsByYear W19799631072013 @default.
- W1979963107 countsByYear W19799631072014 @default.
- W1979963107 countsByYear W19799631072015 @default.
- W1979963107 countsByYear W19799631072016 @default.
- W1979963107 countsByYear W19799631072017 @default.