Sciweavers

93 search results - page 6 / 19
» Extracting k most important groups from data efficiently
Sort
View
WWW
2004
ACM
15 years 10 months ago
Automatic web news extraction using tree edit distance
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant infor...
Davi de Castro Reis, Paulo Braz Golgher, Altigran ...
BMCBI
2007
173views more  BMCBI 2007»
14 years 9 months ago
Recursive Cluster Elimination (RCE) for classification and feature selection from gene expression data
Background: Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that a...
Malik Yousef, Segun Jung, Louise C. Showe, Michael...
DMSN
2006
ACM
15 years 1 months ago
Efficient handling of sensor failures
Sensors provide unprecedented access to a wealth of information from the physical environment in real-time. However, they suffer from a variety of resource limitations, most impor...
Andreea Berfield, Panos K. Chrysanthis, Alexandros...
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
14 years 9 months ago
Discover gene specific local co-regulations from time-course gene expression data
Discovering gene co-regulatory relationships is one of most important research in DNA microarray data analysis. The problem of gene specific co-regulation discovery is to, for a p...
Ji Zhang, Qigang Gao, Hai H. Wang
APPINF
2003
14 years 10 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo