Sciweavers

2836 search results - page 427 / 568
» Parsing Algorithms and Metrics
Sort
View
KCAP
2005
ACM
15 years 10 months ago
Relaxed Precision and Recall for Ontology Matching
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
Marc Ehrig, Jérôme Euzenat
SIGIR
2005
ACM
15 years 10 months ago
Predicting query difficulty on the web by learning visual clues
We describe a method for predicting query difficulty in a precision-oriented web search task. Our approach uses visual features from retrieved surrogate document representations (...
Eric C. Jensen, Steven M. Beitzel, David A. Grossm...
CANS
2005
Springer
134views Cryptology» more  CANS 2005»
15 years 10 months ago
A New Unsupervised Anomaly Detection Framework for Detecting Network Attacks in Real-Time
Abstract. In this paper, we propose a new unsupervised anomaly detection framework for detecting network intrusions online. The framework consists of new anomalousness metrics name...
Wei Lu, Issa Traoré
FCT
2005
Springer
15 years 10 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
15 years 10 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi