Sciweavers

728 search results - page 104 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
13 years 11 months ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 7 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
12 years 10 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
KDD
1994
ACM
113views Data Mining» more  KDD 1994»
13 years 12 months ago
Exploration of Simulation Experiments by Discovery
: Weexemplify in this paper, howa discovery system is applied to the analysis of simulation experimentsin practical political planning, andshowwhatkind of newknowledgecan be discov...
Willi Klösgen
DMIN
2009
142views Data Mining» more  DMIN 2009»
13 years 5 months ago
Efficient Record Linkage using a Double Embedding Scheme
Record linkage is the problem of identifying similar records across different data sources. The similarity between two records is defined based on domain-specific similarity functi...
Noha Adly