Sciweavers

291 search results - page 6 / 59
» Clustering and the Biclique Partition Problem
Sort
View
DMIN
2006
151views Data Mining» more  DMIN 2006»
13 years 9 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 1 days ago
A clustering- and probability-based approach for time-multiplexed FPGA partitioning
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...
Mango Chia-Tso Chao, Guang-Ming Wu, Iris Hui-Ru Ji...
JMLR
2006
108views more  JMLR 2006»
13 years 7 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan
MP
1998
117views more  MP 1998»
13 years 7 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
ICALP
2011
Springer
12 years 11 months ago
Clustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Daniel Lokshtanov, Dániel Marx