Sciweavers

1749 search results - page 68 / 350
» An ICA algorithm for analyzing multiple data sets
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Learning a meta-level prior for feature relevance from multiple related tasks
In many prediction tasks, selecting relevant features is essential for achieving good generalization performance. Most feature selection algorithms consider all features to be a p...
Su-In Lee, Vassil Chatalbashev, David Vickrey, Dap...
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
14 years 1 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
SG
2010
Springer
13 years 7 months ago
Event Line View: Interactive Visual Analysis of Irregular Time-Dependent Data
Abstract. In this paper we present a novel approach to visualize irregularly occurring events. We introduce the event line view designed specifically for such events data (a subset...
Kresimir Matkovic, Alan Lez, Denis Gracanin, Andre...
BMCBI
2007
166views more  BMCBI 2007»
13 years 9 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
CORR
2011
Springer
229views Education» more  CORR 2011»
13 years 4 months ago
"Improved FCM algorithm for Clustering on Web Usage Mining"
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
K. Suresh