Sciweavers

661 search results - page 107 / 133
» Generalized clustering, supervised learning, and data assign...
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
CIKM
2009
Springer
14 years 3 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
KDD
2007
ACM
237views Data Mining» more  KDD 2007»
14 years 8 months ago
Knowledge discovery of multiple-topic document using parametric mixture model with dirichlet prior
Documents, such as those seen on Wikipedia and Folksonomy, have tended to be assigned with multiple topics as a meta-data. Therefore, it is more and more important to analyze a re...
Issei Sato, Hiroshi Nakagawa
ICML
1994
IEEE
13 years 12 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 8 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...