Sciweavers

297 search results - page 33 / 60
» The Statistical Learning of Accurate Heuristics
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 5 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ICDCS
2002
IEEE
15 years 6 months ago
A Fully Distributed Framework for Cost-Sensitive Data Mining
Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach is to apply machine learning algorithms to ...
Wei Fan, Haixun Wang, Philip S. Yu, Salvatore J. S...
124
Voted
IWCMC
2010
ACM
15 years 3 months ago
On the use of random neural networks for traffic matrix estimation in large-scale IP networks
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
Pedro Casas, Sandrine Vaton
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
14 years 11 months ago
Realtime Classification for Encrypted Traffic
Classifying network flows by their application type is the backbone of many crucial network monitoring and controlling tasks, including billing, quality of service, security and tr...
Roni Bar-Yanai, Michael Langberg, David Peleg, Lia...
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
15 years 6 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...