Sciweavers

109 search results - page 14 / 22
» A Thorough Experimental Study of Datasets for Frequent Items...
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
BMCBI
2008
138views more  BMCBI 2008»
13 years 7 months ago
Combining transcriptional datasets using the generalized singular value decomposition
Background: Both microarrays and quantitative real-time PCR are convenient tools for studying the transcriptional levels of genes. The former is preferable for large scale studies...
Andreas W. Schreiber, Neil J. Shirley, Rachel A. B...
WAIM
2010
Springer
13 years 6 months ago
Mining Contrast Inequalities in Numeric Dataset
Finding relational expressions which exist frequently in one class of data while not in the other class of data is an interesting work. In this paper, a relational expression of th...
Lei Duan, Jie Zuo, Tianqing Zhang, Jing Peng, Jie ...
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
BMCBI
2006
90views more  BMCBI 2006»
13 years 7 months ago
The PowerAtlas: a power and sample size atlas for microarray experimental design and research
Background: Microarrays permit biologists to simultaneously measure the mRNA abundance of thousands of genes. An important issue facing investigators planning microarray experimen...
Grier P. Page, Jode W. Edwards, Gary L. Gadbury, P...