Sciweavers

670 search results - page 83 / 134
» Intractability and clustering with constraints
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
14 years 7 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
ECAI
2008
Springer
14 years 11 months ago
Heuristics for Dynamically Adapting Propagation
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
Kostas Stergiou
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
15 years 10 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
15 years 10 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
ALIFE
2005
14 years 9 months ago
State Aggregation and Population Dynamics in Linear Systems
We consider complex systems that are composed of many interacting elements, evolving under some dynamics. We are interested in characterizing the ways in which these elements may b...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright