Sciweavers

5603 search results - page 1054 / 1121
» Feature Selection for Clustering
Sort
View
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
14 years 8 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 8 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
CHI
2004
ACM
14 years 8 months ago
Interactive Comprehensible Data Mining
This paper discusses a novel data mining system devised and developed at Birmingham, which attempts to provide a more effective data mining system. It ties in with the workshop go...
Andy Pryke, Russell Beale
SIGMOD
2004
ACM
151views Database» more  SIGMOD 2004»
14 years 7 months ago
Highly-Available, Fault-Tolerant, Parallel Dataflows
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...
Mehul A. Shah, Joseph M. Hellerstein, Eric A. Brew...
« Prev « First page 1054 / 1121 Last » Next »