Sciweavers

571 search results - page 70 / 115
» Testing homogeneity of a large data set by bootstrapping
Sort
View
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 5 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
DAWAK
2006
Springer
15 years 3 months ago
Priority-Based k-Anonymity Accomplished by Weighted Generalisation Structures
Abstract. Biobanks are gaining in importance by storing large collections of patient's clinical data (e.g. disease history, laboratory parameters, diagnosis, life style) toget...
Konrad Stark, Johann Eder, Kurt Zatloukal
ASSETS
2007
ACM
15 years 3 months ago
Corpus studies in word prediction
Word prediction can be used to enhance the communication rate of people with disabilities who use Augmentative and Alternative Communication (AAC) devices. We use statistical meth...
Keith Trnka, Kathleen F. McCoy
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
15 years 3 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
BMCBI
2006
116views more  BMCBI 2006»
14 years 12 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...