4542 search results - page 230 / 909 » Design patterns for data structures |
183
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
163
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
159
click to vote
SSPR
2004
Springer
15 years 11 months ago
2004
Springer
We present a tutorial survey on some recent approaches to unsupervised machine learning in the context of statistical pattern recognition. In statistical PR, there are two classica...
165
click to vote
FIMI
2004
15 years 7 months ago
2004
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
168
click to vote
IFIP12
2004
15 years 7 months ago
2004
Latent class models (LCM) represent the high dimensional data in a smaller dimensional space in terms of latent variables. They are able to automatically discover the patterns from...