Sciweavers

1093 search results - page 57 / 219
» Clustering from Constraint Graphs
Sort
View
ECAI
2006
Springer
14 years 1 months ago
Compact Representation of Sets of Binary Constraints
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
Jussi Rintanen
ICML
2006
IEEE
14 years 10 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
14 years 2 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
JIIS
2006
147views more  JIIS 2006»
13 years 10 months ago
Mining sequential patterns from data streams: a centroid approach
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream pro...
Alice Marascu, Florent Masseglia
ISCI
2007
170views more  ISCI 2007»
13 years 9 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke