Sciweavers

1701 search results - page 112 / 341
» Providing k-anonymity in data mining
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
15 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
DOLAP
2006
ACM
15 years 3 months ago
HYPE: mining hierarchical sequential patterns
Mining data warehouses is still an open problem as few approaches really take the specificities of this framework into account (e.g. multidimensionality, hierarchies, historized ...
Marc Plantevit, Anne Laurent, Maguelonne Teisseire
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
15 years 2 months ago
Knowledge mining with genetic programming methods for variable selection in flavor design
This paper presents a novel approach for knowledge mining from a sparse and repeated measures dataset. Genetic programming based symbolic regression is employed to generate multip...
Katya Vladislavleva, Kalyan Veeramachaneni, Matt B...
KDD
2009
ACM
219views Data Mining» more  KDD 2009»
15 years 10 months ago
Structured correspondence topic models for mining captioned figures in biological literature
A major source of information (often the most crucial and informative part) in scholarly articles from scientific journals, proceedings and books are the figures that directly pro...
Amr Ahmed, Eric P. Xing, William W. Cohen, Robert ...
VLDB
2005
ACM
180views Database» more  VLDB 2005»
15 years 3 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...