Sciweavers

276 search results - page 50 / 56
» Frequent Submap Discovery
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2004
ACM
171views Data Mining» more  KDD 2004»
14 years 10 months ago
Integrating Web Conceptual Modeling and Web Usage Mining
We present a case study about the application of the inductive database approach to the analysis of Web logs. We consider rich XML Web logs ? called conceptual logs ? that are gen...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Robe...
KDD
2002
ACM
112views Data Mining» more  KDD 2002»
14 years 10 months ago
From run-time behavior to usage scenarios: an interaction-pattern mining approach
A key challenge facing IT organizations today is their evolution towards adopting e-business practices that gives rise to the need for reengineering their underlying software syst...
Mohammad El-Ramly, Eleni Stroulia, Paul G. Sorenso...
RECOMB
2007
Springer
14 years 10 months ago
Framework for Identifying Common Aberrations in DNA Copy Number Data
High-resolution array comparative genomic hybridization (aCGH) provides exon-level mapping of DNA aberrations in cells or tissues. Such aberrations are central to carcinogenesis an...
Amir Ben-Dor, Doron Lipson, Anya Tsalenko, Mark Re...
MOBIHOC
2002
ACM
14 years 9 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...