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

Michael D. Gordon

dblp:g/MichaelDGordon · DBLP profile ↗
← Back
28ranked-venue papers
17as first author
0since 2021 · last 2010
—ORCID · none

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

Databases, data management, data science and information retrieval · 21 · 15 first-authorArtificial intelligence and machine learning · 6Computer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Artificial intelligence
1 paper
Optimization for machine learning · 100%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › statistical estimation › regression › robust regression
least absolute deviations
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Mathematical optimization
parameter tuning
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Mathematical optimization › regularization
regularization path
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Mathematical optimization › statistical estimation › regression
regularized regression
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Information retrieval
document organization
0.012004
Collaborative filing in a document repository · SIGIR 2004
Collaborative and social computing › social computing
social tagging
0.012004
Collaborative filing in a document repository · SIGIR 2004

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

genetic programming · 0.1context-specific ranking · 0.1lasso · 0.1l1-norm penalty · 0.1
YearPublicationVenuePosition
2010 Collective taxonomizing: A collaborative approach to organizing document repositories
Harris Wu, Michael D. Gordon, Weiguo Fan
Decis. Support Syst.2
2006 Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning
abstract
Linear regression is one of the most important and widely used techniques for data analysis. However, sometimes people are not satisfied with it because of the following two limitations: 1) its results are sensitive to outliers, so when the error terms are not normally distributed, especially when they have heavy-tailed distributions, linear regression often works badly; 2) its estimated coefficients tend to have high variance, although their bias is low. To reduce the influence of outliers, robust regression models were developed. Least absolute deviation (LAD) regression is one of them. LAD minimizes the mean absolute errors, instead of mean squared errors, so its results are more robust. To address the second limitation, shrinkage methods were proposed, which add a penalty on the size of the coefficients. The LASSO is one of these methods and it uses the L1-norm penalty, which not only reduces the prediction error and the variance of estimated coefficients, but also provides an automatic feature selection function. In this paper, we propose the regularized least absolute deviation (RLAD) regression model, which combines the nice features of the LAD and the LASSO together. The RLAD is a regularization method, whose objective function has the form of "loss + penalty." The "loss" is the sum of the absolute deviations and the "penalty" is the L1-norm of the coefficient vector. Furthermore, to facilitate parameter tuning, we develop an efficient algorithm which can solve the entire regularization path in one pass. Simulations with various settings are performed to demonstrate its performance. Finally, we apply the algorithm to solve the image reconstruction problem and find interesting results.
Li Wang 0007, Michael D. Gordon
ICDM2
2006 An Empirical Investigation of Innovation and Community Development through Information and Communication Technology
abstract
Recently, discussion has begun to consider serving the base of the economic pyramid for business and societal benefit. Suggestions for so doing have focused on business model innovation, improving internal capabilities, promoting stronger governance, and providing leapfrog technologies (such as ICT) to promote effective change. We consider the questions of what types of innovation are occurring when businesses and other organizations enter the base of the pyramid and what types of social, economic, and consumer benefits they bring to local communities. We base our findings on an analysis of more than 1,000 cases describing base of the pyramid activities
Michael D. Gordon, Vijay Dakshinamoorthy, Li Wang 0007, Allen Hammond
ICTD1
2006 An integrated two-stage model for intelligent information routing
Weiguo Fan, Michael D. Gordon, Praveen Pathak
Decis. Support Syst.2
2006 On linear mixture of expert approaches to information retrieval
Weiguo Fan, Michael D. Gordon, Praveen Pathak
Decis. Support Syst.2
2006 Mining web navigations for intelligence
Harris Wu, Michael D. Gordon, Kurt DeMaagd, Weiguo Fan
Decis. Support Syst.2
2005 Effective profiling of consumer information retrieval needs: a unified framework and empirical comparison
Weiguo Fan, Michael D. Gordon, Praveen Pathak
Decis. Support Syst.2
2004 Collaborative filing in a document repository
abstract
We introduce an emergent, collaborative filing system. In such a system, an individual is allowed to organize a subset of documents in a repository into a personal hierarchy and share the hierarchy with others. The system generates a "consensus" hierarchy from all users' personal hierarchies, which provides a full, common, and emergent view of all documents. We believe that collaborative filing helps translate personal, tacit knowledge into sharable structures, which help the user as well a community of which he or she is a part. Our filing system is suitable for any documents from text to multimedia files. Initial results on an experimental website show promise. For a knowledge task involving extensive document retrieval, hierarchies are not only used frequently but are also effective in identifying high quality documents. One surprising finding is how often subjects use others' personal hierarchies, and upon close examination, social networks play a key role as well.
Harris Wu, Michael D. Gordon
SIGIR2
2004 A generic ranking function discovery framework by genetic programming for information retrieval
Weiguo Fan, Michael D. Gordon, Praveen Pathak
Inf. Process. Manag.2
2004 Discovery of Context-Specific Ranking Functions for Effective Information Retrieval Using Genetic Programming
abstract
The Internet and corporate intranets have brought a lot of information. People usually resort to search engines to find required information. However, these systems tend to use only one fixed ranking strategy regardless of the contexts. This poses serious performance problems when characteristics of different users, queries, and text collections are taken into account. We argue that the ranking strategy should be context specific and we propose a , new systematic method that can automatically generate ranking strategies for different contexts based on genetic programming (GP). The new method was tested on TREC data and the results are very promising.
Weiguo Fan, Michael D. Gordon, Praveen Pathak
IEEE Trans. Knowl. Data Eng.2
2002 Literature-based discovery on the World Wide Web
abstract
Previous research has shown that researchers can generate medical hypotheses by using computers to analyze several, seemingly unrelated, medical literatures. In this work we suggest broader application for the ideas of literature-based discovery. Specifically, we suggest that literature-based discovery can be fruitful in areas other than medicine; that in addition to finding "cures" for "problems," literature-based discovery offers the possibility of finding new problems for existing technologies; that the analysis of a single literature may be sufficient for literature-based discovery; and that literature-based discovery can support individuals seeking to draw together ideas from various areas of inquiry, even if such connections have been previously made by others.We describe literature-based discovery experiments conducted on the World Wide Web that support these ideas.
Michael D. Gordon, Robert K. Lindsay, Weiguo Fan
ACM Trans. Internet Techn.1
1999 Finding Information on the World Wide Web: The Retrieval Effectiveness of Search Engines
Michael D. Gordon, Praveen Pathak
Inf. Process. Manag.1
1999 Literature-Based Discovery by Lexical Statistics
abstract
We report experiments that use lexical statistics, such as word frequency counts, to discover hidden connections in the medical literature. Hidden connections are those that are unlikely to be found by examination of bibliographic citations or the use of standard indexing methods and yet establish a relationship between topics that might profitably be explored by scientific research. Our experiments were conducted with the MEDLINE medical literature database and follow and extend the work of Swanson.
Robert K. Lindsay, Michael D. Gordon
J. Am. Soc. Inf. Sci.2
1998 Using Latent Semantic Indexing for Literature Based Discovery
abstract
Latent semantic indexing (LSI) is a statistical technique for improving information retrieval effectiveness. Here, we use LSI to assist in literature-based discoveries. The idea behind literature-based discoveries is that different authors have already published certain underlying scientific ideas that, when taken together, can be connected to hypothesize a new discovery, and that these connections can be made by exploring the scientific literature. We explore latent semantic indexing's effectiveness on two discovery processes: uncovering “nearby” relationships that are necessary to initiate the literature based discovery process; and discovering more distant relationships that may genuinely generate new discovery hypotheses. © 1998 John Wiley & Sons, Inc.
Michael D. Gordon, Susan T. Dumais
J. Am. Soc. Inf. Sci.1
1997 It's 10 A.M. - Do You Know Where Your Documents Are? The Nature and Scope of Information Retrieval Problems in Business
Michael D. Gordon
Inf. Process. Manag.1
1996 Toward Discovery Support Systems: A Replication, Re-Examination, and Extension of Swanson's Work on Literature-Based Discovery of a Connection between Raynaud's and Fish Oil
abstract
Don R. Swanson has undertaken a program of research to use the published medical literature as a source of discoveries. We have attempted to replicate his discovery of a connection between Raynaud's disease and dietary fish oil, as well as develop computer-based searching methods that could usefully support literature-based discoveries. We have been successful in replicating Swanson's discovery and have developed a method of discovery support based on the complete text of MEDLINE records. From these, we compute statistics based both on the frequency of tokens within a literature and on the number of records containing various tokens. We discuss the use of these statistics, suggesting that token and record frequencies are good indicators of literatures profitably related to some source literature, and that relative record frequencies are useful in isolating literatures with the potential of containing a discovery. © 1996 John Wiley & Sons, Inc.
Michael D. Gordon, Robert K. Lindsay
J. Am. Soc. Inf. Sci.1
1992 When Is the Probability Ranking Principle Suboptimal?
abstract
The probability ranking principle retrieves documents in decreasing order of their predictive probabilities of relevance. Gordon and Lenk (1991) demonstrated that this principal is optimal within a signal detection—decision theory framework, and it maximizes the inquirer's expected utility for relevant documents. These results hold under three conditions: calibration, independent assessment of relevance by the inquirer, and certainty about the computed probabilities of relevance. We demonstrate that the probability ranking principle can be suboptimal with respect to expected utility when one of these conditions fails to hold. © 1992 John Wiley & Sons, Inc.
Michael D. Gordon, Peter Lenk
J. Am. Soc. Inf. Sci.1
1991 The management and control of written information: Growing concern amid the failure of traditional methods
David C. Blair, Michael D. Gordon
Inf. Manag.2
1991 Ranking large document collections by a state space search
Michael D. Gordon
Inf. Process. Manag.1
1991 User-based document clustering by redescribing subject descriptions with a genetic algorithm
abstract
Information retrieval systems have used clustering of documents and queries to improve both retrieval efficiency and retrieval effectiveness. Normally, clustering involves grouping together static descriptions of documents by their similarity to each other, though user-based clustering suggests that usage patterns concerning co-relevance can form a basis for clustering. This article reports that clusters of co-relevant documents obtain increasingly similar descriptions when a genetic algorithm is used to adapt subject descriptions so that documents become more effective in matching relevant queries and failing to match nonrelevant queries. As a result of the increased similarity, clustering algorithms can more accurately group documents into useful clusters. The findings of this work were reached through simulation experiments. © 1991 John Wiley & Sons, Inc.
Michael D. Gordon
J. Am. Soc. Inf. Sci.1
1991 A utility theoretic examination of the probability ranking principle in information retrieval
abstract
We challenge the probability ranking principle in information retrieval from the perspectives of (1) signal detection-decision theory and (2) utility theory. If three conditions are not met by an IR system that is producing predictive probabilities of relevance, then inquirers may incur costs that are too great by selecting first those documents that the system predicts have the highest probabilities of relevance. These three conditions are that predictive probabilities are well calibrated (predictively accurate); that they are reported with certainty; and that an inquirer independently assesses the relevance of all documents he or she retrieves. When these conditions are met, signal detection analysis with fixed decision-theoretic costs shows that the probability ranking principle is advisable. More generally, retrieval in adherence with the probability ranking principle is also advisable even when utility-theoretic costs (or benefits) that vary with the number of relevant documents retrieved are associated with retrieval. Specifically, we prove that the utility an inquirer receives from the relevant documents he or she retrieves is maximized by selecting those documents with the largest predictive probabilities of relevance. © 1991 John Wiley & Sons, Inc.
Michael D. Gordon, Peter Lenk
J. Am. Soc. Inf. Sci.1
1990 Evaluating the effectiveness of information retrieval systems using simulated queries
abstract
Simulation is a widely used investigative tool for exploring proposed systems without incurring the costs of actually building them. Studying the effectiveness of document retrieval systems by means of simulation, however, has remained elusive because of the guesswork involved in deciding whether a document with a given (simulated) description will be relevant to the information need of an inquirer expressed by a given (simulated) query. In this article, a simulation method is described for estimating recall and fallout in a document retrieval system. Examples are presented to illustrate the method, and it is justified probabilistically. By using this method, we may compare the effectiveness of employing various indexing procedures, compare the effectiveness of employing various matching functions, or obtain absolute effectiveness measures for a proposed system. © 1990 John Wiley & Sons, Inc.
Michael D. Gordon
J. Am. Soc. Inf. Sci.1
1989 Novel applications of information retrieval to the storage and management of computer models
Michael D. Gordon, James P. Fry
Inf. Process. Manag.1
1989 Manfred Kochen 1928-1989: Remembrances of a scholar and a gentle man
Michael D. Gordon, David C. Blair, Robert K. Lindsay
JASIS1
1989 Recall-precision trade-off: A derivation
Michael D. Gordon, Manfred Kochen
JASIS1
1988 The necessity for adaptation in modified boolean document retrieval systems
Michael D. Gordon
Inf. Process. Manag.1
1982 Citation ranking versus subjective evaluation in the determination of journal hierachies in the social sciences
abstract
Abstract Considerable interest has been shown in problems associated with ranking journals in accord with their relative importance. With the publication of Journal Citation Reports, regularly updated ranking indicators, based on citation analysis, are made readily available. These indicators have been shown to have significant correlations with scientists' evaluations of the relative importance of journals in the biomedical sciences, but not the physical sciences. This article examines the situation in the social sciences, and finds a strong association between sociologists' evaluations of journal rank and particular citation rank indicators. This suggests that Social Science Journal Citation Reports could prove a valuable aid to journal selection for libraries and information systems.
Michael D. Gordon
J. Am. Soc. Inf. Sci.1
1979 Deficiencies of scientific information access and output in less developed countries
abstract
Abstract The problems of scientists working in “less developed countries” (LDCs) have recently attracted considerable attention, as has their low level of scientific output This article presents an examination of the editorial evaluation of papers which LDC authors are able to produce, in an attempt to illuminate their problems through analysis of their output. LDC authors are shown to experience far higher rejection rates than authors in developed countries (57% vs. 17%) and to be faulted on specific points which tend to indicate that their major problems are those of maintaining current awareness. It is thus indicated that the problems LDC researchers experience in accessing scientific information are a major factor in inhibiting the quality and quantity of their own scientific information output.
Michael D. Gordon
J. Am. Soc. Inf. Sci.1