Sciweavers

24 search results - page 4 / 5
» Complexity of Pattern Classes and Lipschitz Property
Sort
View
ICA
2012
Springer
12 years 3 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
IJCAI
1989
13 years 8 months ago
Training Feedforward Neural Networks Using Genetic Algorithms
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
David J. Montana, Lawrence Davis
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
PR
2007
293views more  PR 2007»
13 years 7 months ago
Mean shift-based clustering
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
Kuo-Lung Wu, Miin-Shen Yang