Sciweavers

728 search results - page 99 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
SDM
2007
SIAM
117views Data Mining» more  SDM 2007»
13 years 9 months ago
Summarizing Review Scores of "Unequal" Reviewers
A frequently encountered problem in decision making is the following review problem: review a large number of objects and select a small number of the best ones. An example is sel...
Hady Wirawan Lauw, Ee-Peng Lim, Ke Wang
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
14 years 1 months ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao
ICDM
2009
IEEE
141views Data Mining» more  ICDM 2009»
14 years 2 months ago
Scalable Algorithms for Distribution Search
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
Yasuko Matsubara, Yasushi Sakurai, Masatoshi Yoshi...
ICDM
2009
IEEE
126views Data Mining» more  ICDM 2009»
14 years 2 months ago
Convex Non-negative Matrix Factorization in the Wild
Abstract—Non-negative matrix factorization (NMF) has recently received a lot of attention in data mining, information retrieval, and computer vision. It factorizes a non-negative...
Christian Thurau, Kristian Kersting, Christian Bau...
DEXA
2005
Springer
110views Database» more  DEXA 2005»
14 years 1 months ago
Intensional Encapsulations of Database Subsets via Genetic Programming
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
Aybar C. Acar, Amihai Motro