An integrated two-stage model for intelligent information routing
Decision Support SystemsPublished 8 March 2005
Weiguo Fan, Michael D. Gordon, Praveen Pathak
Citations24
SJR quartileQ1
SJR score2.37
SNIP2.59
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An integrated model that combines query expansion with ranking function adaptation for online information routing is proposed and tested using two different large scale corpora and results show that this new model can deliver much better quality information than existing models.
Abstract
A recent surge of subscriptions to online news services exemplifies the fact that people and organizations constantly need up-to-date information to stay competitive and make better informed decisions. However, many of these news services often require users to either manually input their profiles or subscribe to existing news channels. This results in lack of intelligence and personalization, and thus make these services less attractive to users. In this paper, an integrated model that combines query expansion with ranking function adaptation for online information routing is proposed and tested using two different large scale corpora. The experimental results show that this new model can deliver much better quality information than existing models.
Keywords
Computer Science
Information Processing & ManagementTerm-weighting approaches in automatic text retrieval
9,532 Citations1988Gerard Salton, Chris Buckley
This paper summarizes the insights gained in automatic term weighting, and provides baseline single term indexing models with which other more elaborate content analysis procedures can be compared.
Artificial IntelligenceWrappers for feature subset selection
8,925 Citations1997Ron Kohavi, George H. John
The wrapper method searches for an optimal feature subset tailored to a particular algorithm and a domain and compares the wrapper approach to induction without feature subset selection and to Relief, a filter approach tofeature subset selection.
Text REtrieval ConferenceOkapi at TREC
2,229 Citations1994Stephen Robertson, Steve Walker +3 more
Much of the work involved investigating plausible methods of applying Okapi-style weighting to phrases, and expansion using terms from the top documents retrieved by a pilot search on topic terms was used.
Feature Selection for Knowledge Discovery and Data Mining
2,191 Citations1998Huan Liu, Hiroshi Motoda
Feature Selection for Knowledge Discovery and Data Mining offers an overview of the methods developed since the 1970's and provides a general framework in order to examine these methods and categorize them and suggests guidelines for how to use different methods under various circumstances.
Communications of the ACMThe vocabulary problem in human-system communication
1,497 Citations1987George W. Furnas, Thomas K. Landauer +2 more
It is shown how this fundamental property of language limits the success of various design methodologies for vocabulary-driven interaction, and an optimal strategy, unlimited aliasing, is derived and shown to be capable of several-fold improvements.
Information Processing & ManagementVariations in relevance judgments and the measurement of retrieval effectiveness
505 Citations2000Ellen M. Voorhees
WebMate
458 Citations1998Liren Chen, Katia Sycara
z Searching enhancement y Parallel search, searching keywords refinement, relevant feedback z Browsing assistant y Learning, Recommending, Alias, Monitoring bookmarks, More like, Sending page to friends, Prefetching hiperlinks z Offline browsing y downloading following pages, getting references and printing it out.
Feature selection, perception learning, and a usability case study for text categorization
446 Citations1997Hwee Tou Ng, Wei Boon Goh +1 more
An automated learning approach to text categorization based on perception learning and a new feature selection metric, called correlation coefficient, is described and empirical results indicate that this approach outperforms the best published results on this % uters collection.
ACM SIGIR ForumExploring the similarity space
386 Citations1998Justin Zobel, Alistair Moffat
It is demonstrated that it is surprisingly difficult to identify which techniques work best, and comment on the experimental methodology required to support any claims as to the superiority of one method over another.
Communications of the ACMPersonalized search
330 Citations2002James E. Pitkow, Hinrich Schütze +6 more
Journal of DocumentationON TERM SELECTION FOR QUERY EXPANSION
318 Citations1990Stephen Robertson
A quantitative argument is sketches a quantitative argument which suggests that the two purposes of relevance feedback system and retrieval purposes require different weighting formulae.
Ontology based personalized search
302 Citations2003Alexander Pretschner, Susan Gauch
This paper explores ways of incorporating users' interests into the search process to improve the results and shows that fully automatic creation of large hierarchical user profiles is possible.
Personalized web search by mapping user queries to categories
238 Citations2002Fang Liu, Clement Yu +1 more
A novel technique to map a user query to a set of categories, which represent the user's search intention, is proposed, which can serve as a context to disambiguate the words in the users' query.
Text REtrieval ConferenceOverview of the Fourth Text REtrieval Conference (TREC-4)
205 Citations1996Donna Harman
Un resume of cette conference (TREC-4), une description des collections tests utilisees pour les recherches mises en place lors ofertains, and il en souligne les resultats.
Information Processing & ManagementDocument length normalization
202 Citations1996Amit Singhal, Gerard Salton +2 more
A modified technique is presented that attempts to match the likelihood of retrieving a document of a certain length to thelihood of documents of that length being judged relevant, and it is shown that this technique yields significant improvements in retrieval effectiveness.
ACM SIGIR ForumFeature selection, perceptron learning, and a usability case study for text categorization
140 Citations1997Hwee Tou Ng, Wei Boon Goh +1 more
Journal of the American Society for Information Science and TechnologyThe effects of fitness functions on genetic programming‐based ranking discovery for Web search
127 Citations2004Weiguo Fan, Edward A. Fox +2 more
This article reports the experience in contrasting different fitness function designs on GP-based learning using a very large Web corpus and indicates that the design of fitness functions is instrumental in performance improvement.
Knowledge-Based SystemsInformation access in context
123 Citations2001Jay Budzik, Kristian J. Hammond +1 more
Watson is presented, a system which gathers contextual information in the form of the text of the document the user is manipulating, in order to proactively retrieve documents from distributed information repositories related to task at hand, as well as process explicit requests in the context of this task.
Information Processing & ManagementA generic ranking function discovery framework by genetic programming for information retrieval
117 Citations2003Weiguo Fan, Michael D. Gordon +1 more
This paper proposes a novel ranking function discovery framework based on Genetic Programming and shows through various experiments how this new framework helps automate the ranking function design/discovery process.
Decision Support SystemsEffective profiling of consumer information retrieval needs: a unified framework and empirical comparison
92 Citations2004Weiguo Fan, Michael D. Gordon +1 more
A new method for profile generation is introduced and compared against other well-known methods based on statistical contingency theory and promising results are found.
IEEE Transactions on Knowledge and Data EngineeringDiscovery of context-specific ranking functions for effective information retrieval using genetic programming
87 Citations2004Weiguo Fan, Michael D. Gordon +1 more
It is argued that the ranking strategy should be context specific and a new systematic method that can automatically generate ranking strategies for different contexts based on genetic programming (GP) is proposed.
Communications of the ACMPersonalization in business-to-customer interaction
80 Citations2002Liliana Ardissono, Anna Goy +2 more
The amount of information presented is tailored to the user’s interests and receptivity, showing only the most relevant data and hiding other details that the user can reach on demand as supplementary information.
Journal of DocumentationON RELEVANCE WEIGHT ESTIMATION AND QUERY EXPANSION
65 Citations1986Stephen Robertson
A Bayesian argument is used to suggest modifications to the Robertson/Sparck Jones relevance weighting formula, to accommodate the addition to the query of terms taken from the relevant documents identified during the search.
ACM Transactions on Information SystemsThe use of dynamic contexts to improve casual internet searching
39 Citations2003Gondy Leroy, Ann Lally +1 more
The genetic algorithm with negative expansion tripled recall and doubled precision for low achievers, but high achievers displayed an opposed trend and seemed to be hindered in this condition, and the effect of other conditions was less substantial.
The Vocabulary Problem in Human-System Communication: an Analysis and a Solution
38 Citations1987George W. Furnas, Thomas K. Landauer +2 more
Many, many alternative access words are needed for users to get what they want from large and complex systems and an optimal strategy, unlimited aliasing, is derived and shown to be capable of several-fold improvements.