default search action
Data Mining and Knowledge Discovery, Volume 17
Volume 17, Number 1, August 2008
- Walter Daelemans, Bart Goethals, Katharina Morik:
Guest Editors' Introduction: Special issue of Selected Papers from ECML PKDD 2008. 1-2 - Petteri Hintsanen, Hannu Toivonen:
Finding reliable subgraphs from large probabilistic graphs. 3-23 - Adrian Kügel, Enno Ohlebusch:
A space efficient solution to the frequent string mining problem for many databases. 24-38 - Pauli Miettinen:
The Boolean column and column-row matrix decompositions. 39-56 - Apostolos N. Papadopoulos, Apostolos Lyritsis, Yannis Manolopoulos:
SkyGraph: an algorithm for important subgraph discovery in relational graphs. 57-76 - Chedy Raïssi, Toon Calders, Pascal Poncelet:
Mining conjunctive sequential patterns. 77-93 - Arnaud Soulet, Bruno Crémilleux:
Adequate condensed representations of patterns. 94-110 - Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke, Christos Faloutsos, Tina Eliassi-Rad:
Two heads better than one: pattern discovery in time-evolving multi-aspect data. 111-128
Volume 17, Number 2, October 2008
- Gary M. Weiss, Bianca Zadrozny, Maytal Saar-Tsechansky:
Guest editorial: special issue on utility-based data mining. 129-135 - Prithviraj Sen, Lise Getoor:
Cost-sensitive learning with conditional Markov networks. 136-163 - George Forman:
Quantifying counts and costs via classification. 164-206 - Tom Fawcett:
PRIE: a system for generating rulelists to maximize ROC performance. 207-224 - Nitesh V. Chawla, David A. Cieslak, Lawrence O. Hall, Ajay Joshi:
Automatically countering imbalance and its empirical relationship to cost. 225-252 - Gary M. Weiss, Ye Tian:
Maximizing classifier utility when there are data acquisition and modeling costs. 253-282 - Lior Rokach, Lihi Naamani, Armin Shmilovici:
Pessimistic cost-sensitive active learning of decision trees for profit maximizing targeting campaigns. 283-316 - Michael Brydon, Andrew Gemino:
Classification trees and decision-analytic feedforward control: a case study from the video game industry. 317-342
Volume 17, Number 3, December 2008
- Li Wei, Eamonn J. Keogh, Xiaopeng Xi, Melissa Yoder:
Efficiently finding unusual shapes in large image databases. 343-376 - Parvathi Chundi, Daniel J. Rosenkrantz:
Efficient algorithms for segmentation of item-set time series. 377-401 - Shumeet Baluja, Michele Covell:
Learning to hash: forgiving hash functions and applications. 402-430 - Jukka Corander, Magnus Ekdahl, Timo Koski:
Parallell interacting MCMC for learning of topologies of graphical models. 431-456 - Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, Mohammed Javeed Zaki:
An integrated, generic approach to pattern mining: data mining template library. 457-495
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.