Sciweavers

1215 search results - page 150 / 243
» Numbers in Multi-relational Data Mining
Sort
View
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
16 years 5 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 5 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
ICDM
2008
IEEE
160views Data Mining» more  ICDM 2008»
15 years 11 months ago
Direct Zero-Norm Optimization for Feature Selection
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
Kaizhu Huang, Irwin King, Michael R. Lyu
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 11 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
15 years 10 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan