1314 search results - page 159 / 263 » Approximate data mining in very large relational data |
123
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
136
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
167
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
145
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
146
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...