1913 search results - page 144 / 383 » Using Data Mining in MURA Graphic Problems |
139
Voted
PAKDD
2005
ACM
15 years 9 months ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
117
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
Analyzing data to find trends, correlations, and stable patterns is an important problem for many industrial applications. In this paper, we propose a new technique based on paral...
126
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we propose and develop a novel approach to the problem of optimally managing the tax, and more generally debt, collections processes at financial institutions. Our...
146
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
135
click to vote
PG
1999
IEEE
15 years 8 months ago
1999
IEEE
The objective of this research is to apply the subdivision surface for surface fitting problems when generating surfaces from data points or polyhedral models. The basic idea is t...