Sciweavers

8294 search results - page 359 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
CMSB
2006
Springer
15 years 10 months ago
Possibilistic Approach to Biclustering: An Application to Oligonucleotide Microarray Data Analysis
Abstract. The important research objective of identifying genes with similar behavior with respect to different conditions has recently been tackled with biclustering techniques. I...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
ISNN
2011
Springer
14 years 9 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
16 years 7 days ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
ML
2006
ACM
121views Machine Learning» more  ML 2006»
15 years 6 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
CIDM
2007
IEEE
16 years 1 months ago
Incremental Local Outlier Detection for Data Streams
Outlier detection has recently become an important problem in many industrial and financial applications. This problem is further complicated by the fact that in many cases, outlie...
Dragoljub Pokrajac, Aleksandar Lazarevic, Longin J...