Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2007
DOI: 10.1145/1281192.1281205
|View full text |Cite
|
Sign up to set email alerts
|

Real-time ranking with concept drift using expert advice

Abstract: In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of computer networks, one might want to generate lists of nodes ranked according to their susceptibility to attack. In addition, real-world data streams often exhibit concept drift, making the learning task even more challenging. We present an online learning approach to ranking with concept drift, using weighted majority techniques. By cont… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 42 publications
0
15
0
Order By: Relevance
“…To address this challenge, ODDS creates a new model every 4 hours on the current dataset. (See also [20,21,22]. )…”
Section: Feeder Ranking In Nycmentioning
confidence: 99%
“…To address this challenge, ODDS creates a new model every 4 hours on the current dataset. (See also [20,21,22]. )…”
Section: Feeder Ranking In Nycmentioning
confidence: 99%
“…The paper proposes nine key factors to be considered by any search engine while ranking research papers. Becker [6] proposes a weighted majority algorithm, to rank electrical feeders based on their susceptibility to failure with real-time time-varying data gathered from electricity distribution system. As per the survey performed by Gama [7], concept-drift adaptation technique adopted in one application domain varies from the one adopted for another.…”
Section: Related Workmentioning
confidence: 99%
“…Given this, and the inability to exactly compute a classifier's expected error, they propose a weight estimation procedure based on the classifier's performance on the previous batch. Two other approaches to weighting are due to Kolter and Maloof [50][51][52] and Becker and Arias [5]. In their weighting schemes, classifiers have their weights updated based on a constant multiplicative factor.…”
Section: Accuracy Weighted Ensemblesmentioning
confidence: 99%