Sciweavers

4791 search results - page 123 / 959
» Clustering with partial information
Sort
View
FLAIRS
2000
15 years 7 months ago
Graph-Based Hierarchical Conceptual Clustering
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
ICDE
2012
IEEE
309views Database» more  ICDE 2012»
13 years 9 months ago
Evaluation of Clusterings - Metrics and Visual Support
—When comparing clustering results, any evaluation metric breaks down the available information to a single number. However, a lot of evaluation metrics are around, that are not ...
Elke Achtert, Sascha Goldhofer, Hans-Peter Kriegel...
DATAMINE
2007
110views more  DATAMINE 2007»
15 years 6 months ago
The complexity of non-hierarchical clustering with instance and cluster level constraints
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
Ian Davidson, S. S. Ravi
IJHPCA
2006
77views more  IJHPCA 2006»
15 years 6 months ago
An Interoperability Approach to System Software, Tools, and Libraries for Clusters
Systems software for clusters typically derives from a multiplicity of sources: the kernel itself, software associated with a particular distribution, site-specific purchased or o...
Ewing L. Lusk, Narayan Desai, Rick Bradshaw, Andre...
KBSE
2005
IEEE
16 years 2 days ago
Optimized run-time race detection and atomicity checking using partial discovered types
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott...