University of Minnesota
University Relations
http://www.umn.edu/urelate
612-624-6868

Minnesota Supercomputing Institute


Log out of MyMSI
KarypisG

Research Abstracts Online
January - December 2011

Main TOC ...... Next Abstract

University of Minnesota Twin Cities
College of Science and Engineering
Department of Computer Science and Engineering

PI: George Karypis, Associate Fellow

Scalable Algorithms for Graph Partitioning, Data Mining, Bioinformatics, and Cheminformatics

The Karypis group is developing computational techniques in a number of fields. Their research in developing algorithms for graph partitioning includes developing memory-efficient formulations of the multilevel graph-partitioning paradigm and developing hybrid parallel formulations of parallel graph partitioning that combines shared-memory and distributed memory.

The researchers are also developing computational techniques in computational biology, bioinformatics, and cheminformatics, which focuses on five areas: developing better machine learning algorithms based on support vector machines by designing kernel functions that capture the characteristics of proteins and chemical compounds and improving their scalability; developing better scoring methods for sequence alignment, sequence-structure search methods, and statistically derived potential functions that are designed to capture the sequence-structure conservation present in protein sequences; developing better feature extraction algorithms for chemical compounds that utilize topological and geometric substructures; developing better machine learning algorithms for chemical compound classification, structure-activity relationship modeling, target fishing, and target hopping; and developing machine-learning and data-mining algorithms for compound synthesizability prediction and compound library design.

The group’s data-mining research focuses on: developing efficient and novel algorithms for recommender systems with constraints; developing better collaborative filtering algorithms that utilize multi-task learning and other complicated learning schemes; and developing pattern discovery algorithms for mining dynamic complex relational graphs.

Group Members

Rezwan Ahmed, Graduate Student
Kevin DeRonne, Graduate Student
Jeremy Lee Iverson, Graduate Student
Zhonghua Jiang, Graduate Student
Santosh Kabbur, Graduate Student
Christopher D. Kauffman, Graduate Student
Xia Ning, Graduate Student
Yevgeniy Podolyan, Graduate Student