Sciweavers

2988 search results - page 205 / 598
» Business applications of data mining
Sort
View
SISAP
2010
IEEE
149views Data Mining» more  SISAP 2010»
13 years 8 months ago
On applications of parameterized hyperplane partitioning
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
Jakub Lokoc, Tomás Skopal
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
13 years 1 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
JSAI
2001
Springer
14 years 2 months ago
Basket Analysis on Meningitis Data
Basket Analysis is the most representative approach in recent study of data mining. However, it cannot be directly applied to the data including numeric data. In this paper, we cl...
Takayuki Ikeda, Takashi Washio, Hiroshi Motoda
KDD
2007
ACM
138views Data Mining» more  KDD 2007»
14 years 4 months ago
High-quantile modeling for customer wallet estimation and other applications
In this paper we discuss the important practical problem of customer wallet estimation, i.e., estimation of potential spending by customers (rather than their expected spending). ...
Claudia Perlich, Saharon Rosset, Richard D. Lawren...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 4 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan