Sciweavers

245 search results - page 42 / 49
» Efficient Algorithms for Discovering Association Rules
Sort
View
IHI
2010
197views Healthcare» more  IHI 2010»
14 years 4 months ago
Beyond safe harbor: automatic discovery of health information de-identification policy alternatives
Regulations in various countries permit the reuse of health information without patient authorization provided the data is "de-identified". In the United States, for ins...
Kathleen Benitez, Grigorios Loukides, Bradley Mali...
89
Voted
IJNSEC
2010
112views more  IJNSEC 2010»
14 years 4 months ago
Detecting Connection-Chains: A Data Mining Approach
A connection-chain refers to a mechanism in which someone recursively logs into a host, then from there logs into another host, and so on. Connection-chains represent an important...
Ahmad Almulhem, Issa Traoré
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 9 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
94
Voted
IJAIT
2007
180views more  IJAIT 2007»
14 years 9 months ago
Detection and Prediction of Rare Events in Transaction Databases
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
Christos Berberidis, Ioannis P. Vlahavas
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 1 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh