Sciweavers

178 search results - page 30 / 36
» Extension of the Generalization Complexity Measure to Real V...
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
SIGADA
2001
Springer
13 years 12 months ago
Automating software module testing for FAA certification
Automatic software testing is gradually becoming accepted practice in the software industry. The shrinking development cycle and higher expectation of software quality are forcing...
Usha Santhanam
QRE
2008
140views more  QRE 2008»
13 years 7 months ago
Discrete mixtures of kernels for Kriging-based optimization
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....
David Ginsbourger, Céline Helbert, Laurent ...
BMCBI
2008
110views more  BMCBI 2008»
13 years 7 months ago
Determining significance of pairwise co-occurrences of events in bursty sequences
Background: Event sequences where different types of events often occur close together arise, e.g., when studying potential transcription factor binding sites (TFBS, events) of ce...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
IS
2010
13 years 6 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...