Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jun Wang 0032

dblp:125/8189-32 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Information retrieval · 89% Data models and query languages · 11%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
retrieval models
0.232008
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes · VLDB J. 2008
TF-IDF uncovered: a study of theories and probabilities · SIGIR 2008
A parallel derivation of probabilistic information retrieval models · SIGIR 2006
Information retrieval › retrieval models
probabilistic retrieval model
0.122008
TF-IDF uncovered: a study of theories and probabilities · SIGIR 2008
A parallel derivation of probabilistic information retrieval models · SIGIR 2006
Data models and query languages › uncertain data
probabilistic relational algebra
0.112008
Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes · VLDB J. 2008
Information retrieval
relevance feedback
0.112008
TF-IDF uncovered: a study of theories and probabilities · SIGIR 2008
Information retrieval › retrieval models › term weighting
TF-IDF
0.112008
TF-IDF uncovered: a study of theories and probabilities · SIGIR 2008
Information retrieval › retrieval models › probabilistic retrieval model
binary independence model
0.112006
A parallel derivation of probabilistic information retrieval models · SIGIR 2006
Information retrieval › retrieval models
language model
0.012008
TF-IDF uncovered: a study of theories and probabilities · SIGIR 2008

Methods — techniques the papers use, named apart from their topics

relational bayes operator · 0.1probabilistic relational algebra · 0.1poisson model · 0.1information theory · 0.1binary independence retrieval · 0.1mathematical derivation · 0.1
YearPublicationVenuePosition
2008 TF-IDF uncovered: a study of theories and probabilities
abstract
Interpretations of TF-IDF are based on binary independence retrieval, Poisson, information theory, and language modelling. This paper contributes a review of existing interpretations, and then, TF-IDF is systematically related to the probabilities P(q|d) and P(d|q). Two approaches are explored: a space of independent, and a space of disjoint terms. For independent terms, an "extreme" query/non-query term assumption uncovers TF-IDF, and an analogy of P(d|q) and the probabilistic odds O(r|d, q) mirrors relevance feedback. For disjoint terms, a relationship between probability theory and TF-IDF is established through the integral + 1/x dx = log x. This study uncovers components such as divergence from randomness and pivoted document length to be inherent parts of a document-query independence (DQI) measure, and interestingly, an integral of the DQI over the term occurrence probability leads to TF-IDF.
Thomas Roelleke, Jun Wang 0032
SIGIR2
2008 Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes
Thomas Roelleke, Hengzhi Wu, Jun Wang 0032, Hany Azzam
VLDB J.3
2006 Context-Specific Frequencies and Discriminativeness for the Retrieval of Structured Documents
Jun Wang 0032, Thomas Roelleke
ECIR1
2006 A parallel derivation of probabilistic information retrieval models
abstract
This paper investigates in a stringent athematical formalism the parallel derivation of three grand probabilistic retrieval models: binary independent retrieval (BIR), Poisson model (PM), and language modelling (LM).The investigation has been motivated by a number of questions. Firstly, though sharing the same origin, namely the probability of relevance, the models differ with respect to event spaces. How can this be captured in a consistent notation, and can we relate the event spaces? Secondly, BIR and PM are closely related, but how does LM fit in? Thirdly, how are tf-idf and probabilistic models related? .The parallel investigation of the models leads to a number of formalised results:
Thomas Roelleke, Jun Wang 0032
SIGIR2