Sciweavers

654 search results - page 98 / 131
» Mining the Most Interesting Rules
Sort
View
CLUSTER
2005
IEEE
15 years 5 months ago
A pipelined data-parallel algorithm for ILP
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
Nuno A. Fonseca, Fernando M. A. Silva, Víto...
ECAI
2000
Springer
15 years 4 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...
NLUCS
2008
15 years 1 months ago
Ontology-driven Vaccination Information Extraction
Increasingly, medical institutions have access to clinical information through computers. The need to process and manage the large amount of data is motivating the recent interest ...
Liliana Ferreira, António Teixeira, Jo&atil...
JDA
2008
84views more  JDA 2008»
14 years 11 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
16 years 5 days ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...