Sciweavers

2180 search results - page 15 / 436
» Algorithms for discovering bucket orders from data
Sort
View
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
ICWS
2008
IEEE
13 years 10 months ago
A Temporal Data-Mining Approach for Discovering End-to-End Transaction Flows
Effective management of Web Services systems relies on accurate understanding of end-to-end transaction flows, which may change over time as the service composition evolves. This ...
Ting Wang, Chang-Shing Perng, Tao Tao, Chunqiang T...
SSD
2005
Springer
173views Database» more  SSD 2005»
14 years 1 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
ER
2006
Springer
112views Database» more  ER 2006»
14 years 3 days ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 8 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor