Sciweavers

694 search results - page 84 / 139
» On the Dimensions of Data Complexity through Synthetic Data ...
Sort
View
DATAMINE
2002
104views more  DATAMINE 2002»
13 years 8 months ago
Cubegrades: Generalizing Association Rules
Cubegrades are generalization of association rules which represent how a set of measures (aggregates) is affected by modifying a cube through specialization (rolldown), generaliza...
Tomasz Imielinski, Leonid Khachiyan, Amin Abdulgha...
BMCBI
2007
145views more  BMCBI 2007»
13 years 9 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
SAC
2006
ACM
14 years 2 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
ITCC
2005
IEEE
14 years 2 months ago
Design Theoretic Approach to Replicated Declustering
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
Ali Saman Tosun
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 3 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang