Sciweavers

5046 search results - page 314 / 1010
» Non-redundant data clustering
Sort
View
BMCBI
2005
112views more  BMCBI 2005»
15 years 6 months ago
Visualization methods for statistical analysis of microarray clusters
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
Matthew A. Hibbs, Nathaniel C. Dirksen, Kai Li, Ol...
SOSP
2009
ACM
16 years 3 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
HIS
2001
15 years 8 months ago
An Automated Report Generation Tool for the Data Understanding Phase
To successfully prepare and model data, the data miner needs to be aware of the properties of the data manifold. In this chapter, the outline of a tool for automatically generating...
Juha Vesanto, Jaakko Hollmén
ISMIS
2009
Springer
16 years 1 months ago
Novelty Detection from Evolving Complex Data Streams with Time Windows
Abstract. Novelty detection in data stream mining denotes the identification of new or unknown situations in a stream of data elements flowing continuously in at rapid rate. This...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
IJCAI
2007
15 years 8 months ago
Detecting Changes in Unlabeled Data Streams Using Martingale
The martingale framework for detecting changes in data stream, currently only applicable to labeled data, is extended here to unlabeled data using clustering concept. The one-pass...
Shen-Shyang Ho, Harry Wechsler