Sciweavers

1701 search results - page 71 / 341
» Providing k-anonymity in data mining
Sort
View
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 20 days ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
KDD
2012
ACM
257views Data Mining» more  KDD 2012»
13 years 8 days ago
Aggregating web offers to determine product prices
Historical prices are important information that can help consumers decide whether the time is right to buy a product. They provide both a context to the users, and facilitate the...
Rakesh Agrawal, Samuel Ieong
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
15 years 1 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
AUSDM
2006
Springer
160views Data Mining» more  AUSDM 2006»
15 years 1 months ago
Extraction of Flat and Nested Data Records from Web Pages
This paper deals with studies the problem of identification and extraction of flat and nested data records from a given web page. With the explosive growth of information sources ...
Siddu P. Algur, P. S. Hiremath
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
15 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...