Sciweavers

1998 search results - page 110 / 400
» Basic Association Rules
Sort
View
PODS
1998
ACM
134views Database» more  PODS 1998»
14 years 2 months ago
A New Framework For Itemset Generation
The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknessesof the large itemset...
Charu C. Aggarwal, Philip S. Yu
KDD
2005
ACM
163views Data Mining» more  KDD 2005»
14 years 3 months ago
Web mining from competitors' websites
This paper presents a framework for user-oriented text mining. It is then illustrated with an example of discovering knowledge from competitors’ websites. The knowledge to be di...
Xin Chen, Yi-fang Brook Wu
CIKM
2006
Springer
14 years 1 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios

Publication
700views
15 years 6 months ago
Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
David Mumford and Jayant Shah
CCGRID
2002
IEEE
14 years 3 months ago
Overcoming the Problems Associated with the Existence of Too Many DSM APIs
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
Martin Schulz