Net partitions yield better module partitions
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Image segmentation by unsupervised sparse clustering
Pattern Recognition Letters
Signal Processing
Possibilistic approach for biclustering microarray data
Computers in Biology and Medicine
A spectral approach to clustering numerical vectors as nodes in a network
Pattern Recognition
Spectral clustering with density sensitive similarity function
Knowledge-Based Systems
Variational mesh decomposition
ACM Transactions on Graphics (TOG)
Proceedings of the 49th Annual Design Automation Conference
Clustered embedding of massive social networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
A framework for exploring organizational structure in dynamic social networks
Decision Support Systems
Unsupervised sparse matrix co-clustering for marketing and sales intelligence
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Fast semi-supervised clustering with enhanced spectral embedding
Pattern Recognition
Granules of words to represent text: an approach based on fuzzy relations and spectral clustering
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Sparse spectral clustering method based on the incomplete Cholesky decomposition
Journal of Computational and Applied Mathematics
Hypergraph based information-theoretic feature selection
Pattern Recognition Letters
A novel similarity-based modularity function for graph partitioning
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Enhancing community detection using a network weighting strategy
Information Sciences: an International Journal
A survey of graph theoretical approaches to image segmentation
Pattern Recognition
A spanning tree-based encoding of the MAX CUT problem for evolutionary search
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Discrete Applied Mathematics
Fast fixed-outline 3-D IC floorplanning with TSV co-placement
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Robust clustering for social annotated images
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
3D point of interest detection via spectral irregularity diffusion
The Visual Computer: International Journal of Computer Graphics
Finding critical blocks of information diffusion in social networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Non-negative and sparse spectral clustering
Pattern Recognition
A spectral approach to detecting subtle anomalies in graphs
Journal of Intelligent Information Systems
Graph Partitioning by Correspondence Analysis and Taxicab Correspondence Analysis
Journal of Classification
RoClust: Role discovery for graph clustering
Web Intelligence and Agent Systems
| Hi-index | 0.03 |
Partitioning of circuit netlists in VLSI design is considered. It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approximation of the optimal ratio cut partition cost. It is also demonstrated that fast Lanczos-type methods for the sparse symmetric eigenvalue problem are a robust basis for computing heuristic ratio cuts based on the eigenvector of this second eigenvalue. Effective clustering methods are an immediate by-product of the second eigenvector computation and are very successful on the difficult input classes proposed in the CAD literature. The intersection graph representation of the circuit netlist is considered, as a basis for partitioning, a heuristic based on spectral ratio cut partitioning of the netlist intersection graph is proposed. The partitioning heuristics were tested on industry benchmark suites, and the results were good in terms of both solution quality and runtime. Several types of algorithmic speedups and directions for future work are discussed