1314 search results - page 16 / 263 » Approximate data mining in very large relational data |
SIGMOD
2000
ACM
13 years 11 months ago
2000
ACM
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
SC
2005
ACM
14 years 29 days ago
2005
ACM
Parallel applications running on high-end computer systems manifest a complexity of performance phenomena. Tools to observe parallel performance attempt to capture these phenomena...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
ICDE
1999
IEEE
14 years 8 months ago
1999
IEEE
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...