Clustering for bioinformatics via matrix optimization

Authors:
Suely Oliveira;David E. Stewart
Affiliations:
University of Iowa, Iowa City, Iowa;University of Iowa, Iowa City, Iowa
Venue:
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Year:
2011

Citing 17
Cited 0

A finite algorithm for finding the projection of a point onto the Canonical simplex of Rn

Journal of Optimization Theory and Applications
Semidefinite programming

SIAM Review
Cluster analysis and mathematical programming

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Semidefinite programming relaxations for the graph partitioning problem

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering

SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices

SIAM Journal on Optimization
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization

SIAM Journal on Optimization
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems

Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
Semidefinite programming for discrete optimization and matrix completion problems

Discrete Applied Mathematics
A local search approximation algorithm for k-means clustering

Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Approximating K-means-type Clustering via Semidefinite Programming

SIAM Journal on Optimization
Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

SIAM Journal on Optimization
Multidimensional cluster stability analysis from a Brazilian Bradyrhizobium sp. RFLP/PCR data set

Journal of Computational and Applied Mathematics
On optimum choice of k in nearest neighbor classification

Computational Statistics & Data Analysis
Semidefinite programming for graph partitioning with preferences in data distribution

VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

SIAM Review
Genetic algorithm based k-means fast learning artificial neural network

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new matrix-based clustering method is presented that is able to handle medium to large data sets that is related to semi-definite programming techniques. The method proposed involves solving a non-convex optimization problem. The problem of local minima that are far from global minima, however, does not appear to be a great difficulty. The method was applied to a well known biological clustering problem, and appears to produce consistent clusterings that are close to the original claimed clustering.