Sciweavers

166 search results - page 26 / 34
» Mining High Utility Itemsets in Big Data
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 1 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
14 years 8 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
WWW
2005
ACM
15 years 11 months ago
Hybrid semantic tagging for information extraction
The semantic web is expected to have an impact at least as big as that of the existing HTML based web, if not greater. However, the challenge lays in creating this semantic web an...
Ronen Feldman, Binyamin Rosenfeld, Moshe Fresko, B...
KDD
2007
ACM
138views Data Mining» more  KDD 2007»
15 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...
SIGMOD
2012
ACM
220views Database» more  SIGMOD 2012»
13 years 25 days ago
GUPT: privacy preserving data analysis made easy
It is often highly valuable for organizations to have their data analyzed by external agents. However, any program that computes on potentially sensitive data risks leaking inform...
Prashanth Mohan, Abhradeep Thakurta, Elaine Shi, D...