Sciweavers

291 search results - page 29 / 59
» Clustering and the Biclique Partition Problem
Sort
View
EOR
2010
99views more  EOR 2010»
13 years 9 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
ALGOSENSORS
2006
Springer
14 years 24 days ago
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
Colette Johnen, Le Huy Nguyen
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 10 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 9 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
EMNLP
2008
13 years 10 months ago
Seeded Discovery of Base Relations in Large Corpora
Relationship discovery is the task of identifying salient relationships between named entities in text. We propose novel approaches for two sub-tasks of the problem: identifying t...
Nicholas Andrews, Naren Ramakrishnan