| Autor: | Rebecca Gore, Paul Helman |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Computational complexity theory
Computer Networks and Communications Computer science business.industry Rank (computer programming) Machine learning computer.software_genre Class (biology) Ranking (information retrieval) Knowledge extraction Artificial Intelligence Hardware and Architecture Ranking SVM Anomaly detection Learning to rank Artificial intelligence business computer Software Information Systems |
| Zdroj: | Journal of Intelligent Information Systems. 11:99-138 |
| ISSN: | 0925-9902 |
| DOI: | 10.1023/a:1008628802726 |
| Popis: | We consider the problem of prioritizing a collection of discrete pieces of information, or transactions. The goal is to rank the transactions in such a way that the user can best pursue a subset of the transactions in hopes of discovering those which were generated by an interesting source. The problem is shown to differ from traditional classification in several fundamental ways. Ranking algorithms are divided into classes, depending on the amount of information they may utilize. We demonstrate that while ranking by the least constrained algorithm class is consistent with classification, such is not the case for a more constrained class of algorithms. We demonstrate also that while optimal ranking by the former class is “easy”, optimal ranking by the latter class is NP-hard. Finally, we present detectors which solve optimally restricted versions of the ranking problem, including symmetric anomaly detection. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink