Sciweavers

321 search results - page 20 / 65
» A view selection algorithm with performance guarantee
Sort
View
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
15 years 11 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
AAAI
2008
15 years 1 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan
113
Voted
EURONGI
2008
Springer
15 years 21 days ago
Performance Evaluation of DTSN in Wireless Sensor Networks
The guaranteed delivery of critical data is an essential requirement in most Wireless Sensor Network (WSN) applications. The paucity of energy, communication, processing and storag...
Francisco Rocha, António Grilo, Paulo Rog&e...
BMCBI
2010
113views more  BMCBI 2010»
14 years 11 months ago
Gene prioritization and clustering by multi-view text mining
Background: Text mining has become a useful tool for biologists trying to understand the genetics of diseases. In particular, it can help identify the most interesting candidate g...
Shi Yu, Léon-Charles Tranchevent, Bart De M...
114
Voted
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 2 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing