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

Fangfang Feng

dblp:57/931 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 2Applied, interdisciplinary, general and emerging computing · 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
2 papers
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › information filtering
topic tracking
0.012004
Language-specific models in multilingual topic tracking · SIGIR 2004
Information retrieval
retrieval models
0.012001
Modeling Score Distributions for Combining the Outputs of Search Engines · SIGIR 2001
Information retrieval
score distribution
0.012001
Modeling Score Distributions for Combining the Outputs of Search Engines · SIGIR 2001
Information retrieval
score distribution modeling
0.012001
Modeling Score Distributions for Combining the Outputs of Search Engines · SIGIR 2001

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

machine translation · 0.0normal distribution · 0.0exponential distribution · 0.0
YearPublicationVenuePosition
2004 Chinese Segmentation and New Word Detection using Conditional Random Fields
Fuchun Peng, Fangfang Feng, Andrew McCallum
COLING2
2004 Language-specific models in multilingual topic tracking
abstract
Topic tracking is complicated when the stories in the stream occur in multiple languages. Typically, researchers have trained only English topic models because the training stories have been provided in English. In tracking, non-English test stories are then machine translated into English to compare them with the topic models. We propose a native language hypothesis stating that comparisons would be more effective in the original language of the story. We first test and support the hypothesis for story link detection. For topic tracking the hypothesis implies that it should be preferable to build separate language-specific topic models for each language in the stream. We compare different methods of incrementally building such native language topic models.
Leah S. Larkey, Fangfang Feng, Margaret E. Connell, Victor Lavrenko
SIGIR2
2001 Modeling Score Distributions for Combining the Outputs of Search Engines
abstract
In this paper the score distributions of a number of text search engines are modeled. It is shown empirically that the score distributions on a per query basis may be fitted using an exponential distribution for the set of non-relevant documents and a normal distribution for the set of relevant documents. Experiments show that this model fits TREC-3 and TREC-4 data for not only probabilistic search engines like INQUERY but also vector space search engines like SMART for English. We have also used this model to fit the output of other search engines like LSI search engines and search engines indexing other languages like Chinese.
R. Manmatha, Toni M. Rath, Fangfang Feng
SIGIR3
2001 Probabilistic techniques for phrase extraction
Fangfang Feng, W. Bruce Croft
Inf. Process. Manag.1
1999 Research Paper: Ad Hoc Classification of Radiology Reports
abstract
OBJECTIVE: The task of ad hoc classification is to automatically place a large number of text documents into nonstandard categories that are determined by a user. The authors examine the use of statistical information retrieval techniques for ad hoc classification of dictated mammography reports. DESIGN: The authors' approach is the automated generation of a classification algorithm based on positive and negative evidence that is extracted from relevance-judged documents. Test documents are sorted into three conceptual bins: membership in a user-defined class, exclusion from the user-defined class, and uncertain. Documentation of absent findings through the use of negation and conjunction, a hallmark of interpretive test results, is managed by expansion and tokenization of these phrases. MEASUREMENTS: Classifier performance is evaluated using a single measure, the F measure, which provides a weighted combination of recall and precision of document sorting into true positive and true negative bins. RESULTS: Single terms are the most effective text feature in the classification profile, with some improvement provided by the addition of pairs of unordered terms to the profile. Excessive iterations of automated classifier enhancement degrade performance because of overtraining. Performance is best when the proportions of relevant and irrelevant documents in the training collection are close to equal. Special handling of negation phrases improves performance when the number of terms in the classification profile is limited. CONCLUSIONS: The ad hoc classifier system is a promising approach for the classification of large collections of medical documents. NegExpander can distinguish positive evidence from negative evidence when the negative evidence plays an important role in the classification.
David Aronow, Fangfang Feng, W. Bruce Croft
J. Am. Medical Informatics Assoc.2
1995 Inductive text classification for medical applications
abstract
Text classification poses a significant challenge for knowledge-based technologies because it touches on all the familiar demons of artificial intelligence: the knowledge engineering bottleneck, problems of scale, easy portability across multiple applications, and cost-effective system construction. Information retrieval (IR) technologies traditionally avoid all of these issues by defining a document in terms of a statistical profile of its lexical items. The IR community is willing to exploit a superficial type of knowledge found in dictionaries and thesaurae, but anything that requires customization, application-specific engineering, or any amount of manual tinkering is thought to be incompatible with practical cost-effective system designs. In this paper those assumptions are challenged and it is shown how machine learning techniques can operate as an effective method for automated knowledge acquisition when it is applied to a representative training corpus, and leveraged against a few hours of routine work by a domain expert. A fully implemented text classification system operating on a medical testbed is described and experimental results based on that testbed are reported.
Wendy G. Lehnert, Stephen Soderland, David Aronow, Fangfang Feng, Avinoam Shmueli
J. Exp. Theor. Artif. Intell.4