Sciweavers

862 search results - page 149 / 173
» Regularized Learning with Networks of Features
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 4 days ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
LSSC
2001
Springer
15 years 4 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
16 years 9 days ago
Network anomaly detection based on Eigen equation compression
This paper addresses the issue of unsupervised network anomaly detection. In recent years, networks have played more and more critical roles. Since their outages cause serious eco...
Shunsuke Hirose, Kenji Yamanishi, Takayuki Nakata,...
CIKM
2011
Springer
13 years 11 months ago
Exploiting longer cycles for link prediction in signed networks
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
Kai-Yang Chiang, Nagarajan Natarajan, Ambuj Tewari...
PAM
2010
Springer
15 years 1 months ago
OpenTM: Traffic Matrix Estimator for OpenFlow Networks
Abstract. In this paper we present OpenTM, a traffic matrix estimation system for OpenFlow networks. OpenTM uses built-in features provided in OpenFlow switches to directly and acc...
Amin Tootoonchian, Monia Ghobadi, Yashar Ganjali