Sciweavers

1599 search results - page 112 / 320
» Theoretical Frameworks for Data Mining
Sort
View
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
15 years 10 months ago
An association analysis approach to biclustering
The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...
Gaurav Pandey, Gowtham Atluri, Michael Steinbach, ...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
14 years 11 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
FIMI
2003
88views Data Mining» more  FIMI 2003»
14 years 11 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
SIGIR
2012
ACM
13 years 10 days ago
Learning to suggest: a machine learning framework for ranking query suggestions
We consider the task of suggesting related queries to users after they issue their initial query to a web search engine. We propose a machine learning approach to learn the probab...
Umut Ozertem, Olivier Chapelle, Pinar Donmez, Emre...
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
15 years 10 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou