Sciweavers

2932 search results - page 202 / 587
» Higher order mining
Sort
View
ICDE
2006
IEEE
108views Database» more  ICDE 2006»
16 years 8 months ago
On the Inverse Classification Problem and its Applications
In this paper, we discuss the inverse classification problem, in which we desire to define the features of an incomplete record in such a way that will result in a desired class l...
Charu C. Aggarwal, Chen Chen, Jiawei Han
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
16 years 26 days ago
Subgraph Support in a Single Large Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
ICDM
2005
IEEE
134views Data Mining» more  ICDM 2005»
16 years 4 days ago
A Preference Model for Structured Supervised Learning Tasks
The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, su...
Fabio Aiolli
KDD
1997
ACM
106views Data Mining» more  KDD 1997»
15 years 10 months ago
Clustering Sequences of Complex Objects
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
A. Ketterlin
KDD
1994
ACM
140views Data Mining» more  KDD 1994»
15 years 10 months ago
A Comparison of Pruning Methods for Relational Concept Learning
Pre-Pruning and Post-Pruning are two standard methods of dealing with noise in concept learning. Pre-Pruning methods are very efficient, while Post-Pruning methods typically are m...
Johannes Fürnkranz