Sciweavers

953 search results - page 163 / 191
» Using Clustering and Blade Clusters in the Terabyte Task
Sort
View
JIIS
2000
111views more  JIIS 2000»
14 years 9 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
JUCS
2010
135views more  JUCS 2010»
14 years 8 months ago
Web Context Classification Based on Information Quality Factors
: The fact that the World Wide Web is being used for various purposes also implies that users may have various information quality factors to consider according to their current co...
Jinhyuk Choi, Geehyuk Lee, Junghoon Moon
EMNLP
2009
14 years 7 months ago
The infinite HMM for unsupervised PoS tagging
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
Jurgen Van Gael, Andreas Vlachos, Zoubin Ghahraman...
98
Voted
SNAM
2011
246views more  SNAM 2011»
14 years 4 months ago
Market basket analysis with networks
The field of market basket analysis, the search for meaningful associations in customer purchase data, is one of the oldest areas of data mining. The typical solution involves th...
Troy Raeder, Nitesh V. Chawla
CVPR
2008
IEEE
15 years 11 months ago
Graph commute times for image representation
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of...
Nikos Paragios, Regis Behmo, Véronique Prin...