Sciweavers

169 search results - page 17 / 34
» Constraint-Based Multidimensional Data Mining
Sort
View
ICDT
2001
ACM
124views Database» more  ICDT 2001»
13 years 12 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
11 years 10 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
DAWAK
2001
Springer
14 years 4 hour ago
Determining the Convex Hull in Large Multidimensional Databases
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
Christian Böhm, Hans-Peter Kriegel
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
11 years 10 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
KDD
2008
ACM
110views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining preferences from superior and inferior examples
Mining user preferences plays a critical role in many important applications such as customer relationship management (CRM), product and service recommendation, and marketing camp...
Bin Jiang, Jian Pei, Xuemin Lin, David W. Cheung, ...