Sciweavers

4039 search results - page 188 / 808
» A Method for Dynamic Clustering of Data
Sort
View
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
16 years 5 months ago
Querying Multi-dimensional Data Indexed Using the Hilbert Space-filling Curve
Mapping to one-dimensional values and then using a onedimensional indexing method has been proposed as a way of indexing multi-dimensional data. Most previous related work uses th...
Jonathan K. Lawder, Peter J. H. King
WILF
2007
Springer
98views Fuzzy Logic» more  WILF 2007»
15 years 11 months ago
Possibilistic Clustering in Feature Space
In this paper we propose the Possibilistic C-Means in Feature Space and the One-Cluster Possibilistic C-Means in Feature Space algorithms which are kernel methods for clustering in...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
CLUSTER
2002
IEEE
15 years 10 months ago
Supermon: A High-Speed Cluster Monitoring System
Supermon is a flexible set of tools for high speed, scalable cluster monitoring. Node behavior can be monitored much faster than with other commonly used methods (e.g., rstatd). ...
Matthew J. Sottile, Ronald Minnich
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
15 years 8 months ago
On semi-supervised clustering via multiobjective optimization
Semi-supervised classification uses aspects of both unsupervised and supervised learning to improve upon the performance of traditional classification methods. Semi-supervised clu...
Julia Handl, Joshua D. Knowles
CSE
2009
IEEE
15 years 11 months ago
A Network-Aware Distributed Membership Protocol for Collaborative Defense
— To counteract current trends in network malware, distributed solutions have been developed that harness the power of collaborative end-host sensors. While these systems greatly...
David Zage, Carl Livadas, Eve M. Schooler