Sciweavers

1399 search results - page 128 / 280
» New Algorithms for k-Center and Extensions
Sort
View
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
11 years 11 months ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
CVPR
2005
IEEE
14 years 11 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 2 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
14 years 18 days ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
BMCBI
2007
200views more  BMCBI 2007»
13 years 9 months ago
BNDB - The Biochemical Network Database
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored ...
Jan Küntzer, Christina Backes, Torsten Blum, ...