Sciweavers

276 search results - page 23 / 56
» Frequent Submap Discovery
Sort
View
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
14 years 2 months ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold
BMCBI
2011
13 years 4 months ago
Sequential Interim Analyses of Survival Data in DNA Microarray Experiments
Background: Discovery of biomarkers that are correlated with therapy response and thus with survival is an important goal of medical research on severe diseases, e.g. cancer. Freq...
Andreas Leha, Tim Beißbarth, Klaus Jung
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
14 years 1 months ago
Mining Various Patterns in Sequential Data in an SQL-like Manner
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
Marek Wojciechowski
COMPSAC
2005
IEEE
13 years 11 months ago
A Novel Method for Protecting Sensitive Knowledge in Association Rules Mining
Discovering frequent patterns from huge amounts of data is one of the most studied problems in data mining. However, some sensitive patterns with security policies may cause a thr...
En Tzu Wang, Guanling Lee, Yu Tzu Lin
SSD
2001
Springer
218views Database» more  SSD 2001»
14 years 2 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos