Sciweavers

256 search results - page 37 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
89
Voted
NIPS
2008
14 years 11 months ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...
ECML
2006
Springer
15 years 1 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
ACISICIS
2009
IEEE
15 years 28 days ago
A Parallel Algorithm for Computer Simulation of Electrocardiogram Based on MPI
—This paper presents a parallel algorithm for computer simulation of Electrocardiogram (ECG) based on a 3-dimensional (3D) whole-heart model. The computer heart model includes ap...
Wenfeng Shen, Weijia Lu, Daming Wei, Weimin Xu, Xi...
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
15 years 3 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...
ICASSP
2011
IEEE
14 years 1 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...