Sciweavers

942 search results - page 168 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 1 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 1 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
BMCBI
2006
116views more  BMCBI 2006»
14 years 9 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...
APPT
2007
Springer
14 years 11 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
ICDE
2009
IEEE
202views Database» more  ICDE 2009»
15 years 11 months ago
Tracking High Quality Clusters over Uncertain Data Streams
Recently, data mining over uncertain data streams has attracted a lot of attentions because of the widely existed imprecise data generated from a variety of streaming applications....
Chen Zhang, Ming Gao, Aoying Zhou