1913 search results - page 54 / 383 » Using Data Mining in MURA Graphic Problems |
171
Voted
WSDM
2012
ACM
13 years 11 months ago
2012
ACM
We describe a open-domain information extraction method for extracting concept-instance pairs from an HTML corpus. Most earlier approaches to this problem rely on combining cluste...
141
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
In this paper, we explore the discriminating subsequencebased clustering problem. First, several effective optimization techniques are proposed to accelerate the sequence mining p...
153
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
147
Voted
PODS
2003
ACM
16 years 3 months ago
2003
ACM
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
147
click to vote
KDD
2004
ACM
15 years 8 months ago
2004
ACM
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...