Sciweavers

912 search results - page 108 / 183
» Inductive Databases as Ranking
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 9 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2004
ACM
330views Data Mining» more  KDD 2004»
14 years 9 months ago
Learning to detect malicious executables in the wild
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
Jeremy Z. Kolter, Marcus A. Maloof
PKDD
2009
Springer
148views Data Mining» more  PKDD 2009»
14 years 3 months ago
Feature Selection by Transfer Learning with Linear Regularized Models
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
Thibault Helleputte, Pierre Dupont
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
14 years 2 months ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
PAKDD
1998
ACM
103views Data Mining» more  PAKDD 1998»
14 years 1 months ago
Discovering Case Knowledge Using Data Mining
The use of Data Mining in removing current bottlenecks within Case-based Reasoning (CBR) systems is investigated along with the possible role of CBR in providing a knowledge manag...
Sarabjot S. Anand, David W. Patterson, John G. Hug...