The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Background: We present an approach designed to identify gene regulation patterns using sequence and expression data collected for Saccharomyces cerevisae. Our main goal is to rela...
Bartek Wilczynski, Torgeir R. Hvidsten, Andriy Kry...
This study extends the web classification approach through a proximity-based fuzzy clustering sensible to the influence of the page. The proximity-based fuzzy clustering works in ...
The assessment of chemical similarity between molecules is a basic operation in chemoinformatics, a computational area concerning with the manipulation of chemical structural info...
Abstract. We propose an association analysis-based strategy for exploration of multi-attribute spatial datasets possessing naturally arising classification. Proposed strategy, EST...
Tomasz F. Stepinski, Josue Salazar, Wei Ding 0003,...