Sciweavers

102291 search results - page 19887 / 20459
» Computing
Sort
View
ICLP
2010
Springer
15 years 8 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 8 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 8 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
15 years 8 months ago
Ensemble pruning via individual contribution ordering
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
Zhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 8 months ago
Direct mining of discriminative patterns for classifying uncertain data
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
Chuancong Gao, Jianyong Wang
« Prev « First page 19887 / 20459 Last » Next »