Sciweavers

8695 search results - page 1437 / 1739
» Making the Complex Simple
Sort
View
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 4 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
16 years 4 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
16 years 4 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
CHI
2007
ACM
16 years 4 months ago
A cognitive constraint model of dual-task trade-offs in a highly dynamic driving task
The paper describes an approach to modeling the strategic variations in performing secondary tasks while driving. In contrast to previous efforts that are based on simulation of a...
Duncan P. Brumby, Andrew Howes, Dario D. Salvucci
RECOMB
2006
Springer
16 years 4 months ago
New Methods for Detecting Lineage-Specific Selection
Abstract. So far, most methods for identifying sequences under selection based on comparative sequence data have either assumed selectional pressures are the same across all branch...
Adam C. Siepel, Katherine S. Pollard, David Haussl...
« Prev « First page 1437 / 1739 Last » Next »