Sciweavers

4085 search results - page 645 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ILP
2004
Springer
15 years 11 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
COCOON
2008
Springer
15 years 8 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
141
Voted
AIA
2007
15 years 8 months ago
Incremental classifier based on a local credibility criterion
In this paper we propose the Local Credibility Concept (LCC), a novel technique for incremental classifiers. It measures the classification rate of the classifier’s local mod...
Herward Prehn, Gerald Sommer
SGAI
2009
Springer
16 years 1 months ago
Parallel Rule Induction with Information Theoretic Pre-Pruning
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to indu...
Frederic T. Stahl, Max Bramer, Mo Adda
151
Voted
DIS
2003
Springer
15 years 11 months ago
Extraction of Coverings as Monotone DNF Formulas
Abstract. In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but al...
Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao