Sciweavers

4085 search results - page 475 / 817
» Benchmarking Data Mining Algorithms
Sort
View
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
16 years 1 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
179
Voted
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
16 years 6 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
CIDM
2009
IEEE
16 years 1 months ago
Density-based clustering of polygons
– Clustering is an important task in spatial data mining and spatial analysis. We propose a clustering algorithm P-DBSCAN to cluster polygons in space. PDBSCAN is based on the we...
Deepti Joshi, Ashok Samal, Leen-Kiat Soh
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
SAC
2006
ACM
16 years 9 days ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev