Date
Thu, 29 May 2003
Time
14:00 - 15:00
Location
Comlab
Speaker
Prof Des Higham
Organisation
University of Strathclyde

From the point of view of a numerical analyst, I will describe some algorithms for:

  • clustering data points based on pairwise similarity,
  • reordering a sparse matrix to reduce envelope, two-sum or bandwidth,
  • reordering nodes in a range-dependent random graph to reflect the range-dependency,

and point out some connections between seemingly disparate solution techniques. These datamining problems arise across a range of disciplines. I will mention a particularly new and important application from bioinformatics concerning the analysis of gene or protein interaction data.

Please contact us with feedback and comments about this page. Last updated on 03 Apr 2022 01:32.