32545 search results - page 509 / 6509 » Data Structures and Algorithms |
187
click to vote
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
220
click to vote
ENTCS
2008
15 years 7 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
319
click to vote
ICDE
1997
IEEE
16 years 8 months ago
1997
IEEE
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
192
click to vote
MLDM
1999
Springer
15 years 11 months ago
1999
Springer
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
209
click to vote
UAI
2008
15 years 8 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...