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

Eric Mackie

dblp:41/5493 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Databases, data management, data science and information retrieval · 1

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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › document retrieval › structured document retrieval
hypertext retrieval
0.011993
Coherent Answers for a Large Structured Document Collection · SIGIR 1993
Information retrieval
retrieval models
0.011993
Coherent Answers for a Large Structured Document Collection · SIGIR 1993
Information retrieval › document retrieval
structured document retrieval
0.011993
Coherent Answers for a Large Structured Document Collection · SIGIR 1993
Information retrieval › document processing › document analysis
document structure
0.011993
Coherent Answers for a Large Structured Document Collection · SIGIR 1993

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

node similarity · 0.0document structure exploitation · 0.0
YearPublicationVenuePosition
1993 Coherent Answers for a Large Structured Document Collection
abstract
There is a simple method for integrating information retrieval and hypertext. This consists of treating nodes as isolated documents and retrieving them in order of similarity. If the nodes are structured, in particular, if sets of nodes collectively constitute documents, we can do better. This paper shows how the formation of the hypertext, the retrieval of nodes in response to content based queries, and the presentation of the nodes can be achieved in a way that exploits the knowledge encoded as the structure of the documents. The ideas are then exemplified in an SGML based hypertext information retrieval system.
Michael Fuller, Eric Mackie, Ron Sacks-Davis, Ross Wilkinson
SIGIR2