8294 search results - page 392 / 1659 » Presenting Data from Experiments in Algorithmics |
172
click to vote
UAI
1993
15 years 8 months ago
1993
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL ...
196
click to vote
PAMI
2006
15 years 6 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
187
Voted
EOR
2007
15 years 6 months ago
2007
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
214
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
186
click to vote
TOIS
2010
15 years 5 months ago
2010
We propose a new unsupervised learning technique for extracting information about authors and topics from large text collections. We model documents as if they were generated by a...