Sciweavers

971 search results - page 112 / 195
» Mining Several Data Bases with an Ensemble of Classifiers
Sort
View
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
14 years 1 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 7 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
ECAI
2000
Springer
14 years 1 months ago
Data Set Editing by Ordered Projection
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
Jesús S. Aguilar-Ruiz, José Crist&oa...
CIKM
2008
Springer
13 years 11 months ago
Information shared by many objects
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
Chong Long, Xiaoyan Zhu, Ming Li, Bin Ma
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 10 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis