Lab Home | Phone | Search
	Center for Nonlinear Studies
	Home  ▶ People   Current   Executive Committee   Postdocs   Visitors   Students   Research   Publications  ▶ Conferences   Workshops   Sponsorship  ▶ Talks   Seminars   Postdoc Seminars Archive   Quantum Lunch   Quantum Lunch Archive   P/T Colloquia   Archive   Ulam Scholar     Postdoc Nominations  ▶ Student Requests   Student Program  ▶ Visitor Requests   Description   Past Visitors  ▶ Services   General     History of CNLS     Maps, Directions   CNLS Office   T-Division   LANL				Monday, April 04, 201111:00 AM - 12:00 PMCNLS Conference Room (TA-3, Bldg 1690) Seminar Multi-way Clustering and Biclustering by Graph Partitioning Approaches Neng FanD-6 and Department of Industrial and Systems Engineering, University of Florida Both clustering and biclustering are widely-used techniques in data mining, and have found many applications in pattern recognition, image analysis, information retrieval, text mining, bioinformatics, etc. In this talk, we use graph partitioning approaches for clustering and biclustering. For different proposes of clustering and biclustering, three kinds of cuts for graph partitioning, including minimum cut, ratio cut and normalized cut, are formulated by mathematical programming approaches. Many optimization methods, such as integer programming, spectral and semidefinite programming relaxations, are proposed for solving real problems. Numerical experiments based on randomly generated data sets are performed for comparing these methods. Host: Sasha Gutfraind, T-5, CNLS, gutfraind@lanl.gov