Sciweavers

1701 search results - page 169 / 341
» Providing k-anonymity in data mining
Sort
View
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
15 years 4 months ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 4 months ago
Exploiting Recurring Usage Patterns to Enhance Filesystem and Memory Subsystem Performance
In many cases, normal uses of a system form patterns that will repeat. The most common patterns can be collected into a prediction model which will essentially predict that usage p...
Benjamin Rutt, Srinivasan Parthasarathy
KDD
1998
ACM
113views Data Mining» more  KDD 1998»
15 years 2 months ago
Targeting Business Users with Decision Table Classifiers
Business users and analysts commonly use spreadsheets and 2D plots to analyze and understand their data. On-line Analytical Processing (OLAP) provides these users with added flexi...
Ron Kohavi, Dan Sommerfield
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
15 years 2 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb
OSDI
2000
ACM
14 years 12 months ago
Towards Higher Disk Head Utilization: Extracting "Free" Bandwidth from Busy Disk Drives
Freeblock scheduling is a new approach to utilizing more of disks' potential media bandwidths. By filling rotational latency periods with useful media transfers, 20{50% of a ...
Christopher R. Lumb, Jiri Schindler, Gregory R. Ga...