1314 search results - page 67 / 263 » Approximate data mining in very large relational data |
132
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
131
click to vote
DASFAA
2003
IEEE
15 years 7 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
118
click to vote
PKDD
2010
Springer
15 years 1 days ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
129
click to vote
ICDM
2010
IEEE
14 years 11 months ago
2010
IEEE
The problem of finding outliers in data has broad applications in areas as diverse as data cleaning, fraud detection, network monitoring, invasive species monitoring, etc. While th...
ICDM
2008
IEEE
15 years 8 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...