Sciweavers

2229 search results - page 19 / 446
» Comparative analysis of biclustering algorithms
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
SMI
2006
IEEE
164views Image Analysis» more  SMI 2006»
14 years 1 months ago
Mesh Segmentation - A Comparative Study
Mesh segmentation has become an important component in many applications in computer graphics. In the last several years, many algorithms have been proposed in this growing area, ...
Marco Attene, S. Katz, Michela Mortara, Giuseppe P...
ICARIS
2005
Springer
14 years 1 months ago
A Comparative Study of Real-Valued Negative Selection to Statistical Anomaly Detection Techniques
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
Thomas Stibor, Jonathan Timmis, Claudia Eckert
BMCBI
2011
13 years 2 months ago
A novel approach to the clustering of microarray data via nonparametric density estimation
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
Riccardo De Bin, Davide Risso
INFOCOM
2011
IEEE
12 years 11 months ago
A comparative study of two network-based anomaly detection methods
—Modern networks are complex and hence, network operators often rely on automation to assist in assuring the security, availability, and performance of these networks. At the cor...
Kaustubh Nyalkalkar, Sushant Sinha, Michael Bailey...