Sciweavers

808 search results - page 131 / 162
» Pattern Discovery and Computational Mechanics
Sort
View
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
15 years 1 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
TKDE
2008
153views more  TKDE 2008»
14 years 9 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
PODS
2009
ACM
134views Database» more  PODS 2009»
15 years 10 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
15 years 10 months ago
Indexing multi-dimensional time-series with support for multiple distance measures
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
Michail Vlachos, Marios Hadjieleftheriou, Dimitrio...
CAV
2007
Springer
166views Hardware» more  CAV 2007»
15 years 4 months ago
Fast and Accurate Static Data-Race Detection for Concurrent Programs
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...
Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, A...