Sciweavers

588 search results - page 99 / 118
» Mining Soft-Matching Rules from Textual Data
Sort
View
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 8 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
ECAI
2000
Springer
14 years 1 months ago
Data Set Editing by Ordered Projection
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
Jesús S. Aguilar-Ruiz, José Crist&oa...
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 10 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
BMCBI
2005
106views more  BMCBI 2005»
13 years 8 months ago
Thesaurus-based disambiguation of gene symbols
Background: Massive text mining of the biological literature holds great promise of relating disparate information and discovering new knowledge. However, disambiguation of gene s...
Bob J. A. Schijvenaars, Barend Mons, Marc Weeber, ...
EMNLP
2008
13 years 10 months ago
Automatic Set Expansion for List Question Answering
This paper explores the use of set expansion (SE) to improve question answering (QA) when the expected answer is a list of entities belonging to a certain class. Given a small set...
Richard C. Wang, Nico Schlaefer, William W. Cohen,...