Sciweavers

2638 search results - page 312 / 528
» Extracting Approximate Patterns
Sort
View
ISCI
2008
137views more  ISCI 2008»
15 years 6 months ago
Stochastic dominance-based rough set model for ordinal classification
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has...
Wojciech Kotlowski, Krzysztof Dembczynski, Salvato...
IPM
2002
102views more  IPM 2002»
15 years 6 months ago
Problems of music information retrieval in the real world
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
Donald Byrd, Tim Crawford
NECO
2010
136views more  NECO 2010»
15 years 4 months ago
Learning to Represent Spatial Transformations with Factored Higher-Order Boltzmann Machines
To allow the hidden units of a restricted Boltzmann machine to model the transformation between two successive images, Memisevic and Hinton (2007) introduced three-way multiplicat...
Roland Memisevic, Geoffrey E. Hinton
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 1 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 6 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...