Sciweavers

3395 search results - page 659 / 679
» A Statistical Clustering Model and Algorithm
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
ACSAC
2004
IEEE
15 years 5 months ago
RACOON: Rapidly Generating User Command Data For Anomaly Detection From Customizable Templates
One of the biggest obstacles faced by user command based anomaly detection techniques is the paucity of data. Gathering command data is a slow process often spanning months or yea...
Ramkumar Chinchani, Aarthie Muthukrishnan, Madhusu...
ATAL
2010
Springer
15 years 3 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 2 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
CCR
2008
118views more  CCR 2008»
15 years 2 months ago
A generic language for application-specific flow sampling
Flow records gathered by routers provide valuable coarse-granularity traffic information for several measurement-related network applications. However, due to high volumes of traf...
Harsha V. Madhyastha, Balachander Krishnamurthy