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

Satya Mahesh Rachakonda

dblp:32/4658 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—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 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › query reformulation › query expansion
automatic query expansion
0.011999
A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases · ACM Trans. Inf. Syst. 1999
Information retrieval › search engines › semantic search
conceptual retrieval
0.011999
A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases · ACM Trans. Inf. Syst. 1999
Information retrieval
query reformulation
0.011999
A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases · ACM Trans. Inf. Syst. 1999
Information retrieval
ranking
0.011999
A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases · ACM Trans. Inf. Syst. 1999
Information retrieval
retrieval models
0.011999
A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases · ACM Trans. Inf. Syst. 1999
Information retrieval › distributed information retrieval
resource selection
0.011999
A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases · ACM Trans. Inf. Syst. 1999
Information retrieval
search engines
0.011999
A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases · ACM Trans. Inf. Syst. 1999

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

similarity matrix · 0.0corpus analysis · 0.0
YearPublicationVenuePosition
1999 A Corpus Analysis Approach for Automatic Query Expansion and Its Extension to Multiple Databases
abstract
Searching online text collections can be both rewarding and frustrating. While valuable information can be found, typically many irrelevant documents are also retrieved, while many relevant ones are missed. Terminology mismatches between the user's query and document contents are a main cause of retrieval failures. Expanding a user's query with related words can improve search performances, but finding and using related words is an open problem. This research uses corpus analysis techniques to automatically discover similar words directly from the contents of the databases which are not tagged with part-of-speech labels. Using these similarities, user queries are automatically expanded, resulting in conceptual retrieval rather than requiring exact word matches between queries and documents. We are able to achieve a 7.6% improvement for TREC 5 queries and up to a 28.5% improvement on the narrow-domain Cystic Fibrosis collection. This work has been extended to multidatabase collections where each subdatabase has a collection-specific similarity matrix associated with it. If the best matrix is selected, substantial search improvements are possible. Various techniques to select the appropriate matrix for a particular query are analyzed, and a 4.8% improvement in the results is validated.
Susan Gauch, Satya Mahesh Rachakonda
ACM Trans. Inf. Syst.3