Sciweavers

1913 search results - page 173 / 383
» Using Data Mining in MURA Graphic Problems
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 4 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ICDE
2008
IEEE
114views Database» more  ICDE 2008»
16 years 5 months ago
On Unifying Privacy and Uncertain Data Models
The problem of privacy-preserving data mining has been studied extensively in recent years because of the increased amount of personal information which is available to corporation...
Charu C. Aggarwal
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 4 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
15 years 10 months ago
Multi-task Feature Selection Using the Multiple Inclusion Criterion (MIC)
Abstract. We address the problem of joint feature selection in multiple related classification or regression tasks. When doing feature selection with multiple tasks, usually one c...
Paramveer S. Dhillon, Brian Tomasik, Dean P. Foste...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 9 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...