Sciweavers

321 search results - page 27 / 65
» A view selection algorithm with performance guarantee
Sort
View
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
15 years 4 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
PR
2007
205views more  PR 2007»
14 years 10 months ago
Active learning for image retrieval with Co-SVM
In relevance feedback algorithms, selective sampling is often used to reduce the cost of labeling and explore the unlabeled data. In this paper, we proposed an active learning alg...
Jian Cheng, Kongqiao Wang
COLT
2008
Springer
15 years 23 days ago
Relating Clustering Stability to Properties of Cluster Boundaries
In this paper, we investigate stability-based methods for cluster model selection, in particular to select the number K of clusters. The scenario under consideration is that clust...
Shai Ben-David, Ulrike von Luxburg
ISER
2000
Springer
80views Robotics» more  ISER 2000»
15 years 2 months ago
Robot Navigation for Automatic Model Construction Using Safe Regions
: Automatic model construction is a core problem in mobile robotics. To solve this task efficiently, we need a motion strategy to guide a robot equipped with a range sensor through...
Héctor H. González-Baños, Jea...
IMC
2006
ACM
15 years 5 months ago
Rarest first and choke algorithms are enough
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...
Arnaud Legout, Guillaume Urvoy-Keller, Pietro Mich...