1913 search results - page 129 / 383 » Using Data Mining in MURA Graphic Problems |
171
click to vote
NIPS
2008
15 years 5 months ago
2008
Covariance estimation for high dimensional vectors is a classically difficult problem in statistical analysis and machine learning. In this paper, we propose a maximum likelihood ...
138
click to vote
GBRPR
2005
Springer
15 years 9 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
127
click to vote
ICANN
2005
Springer
15 years 9 months ago
2005
Springer
This work proposes a theoretical guideline in the specific area of Frequent Itemset Mining (FIM). It supports the hypothesis that the use of neural network technology for the prob...
118
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
136
click to vote
PKDD
1999
Springer
15 years 8 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...