Incremental learning with ordinal bounded example memory
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 0302-9743, Vol: 5809 LNAI, Page: 323-337
2009
- 1Citations
- 3Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
A Bounded Example Memory learner is a learner that operates incrementally and maintains a memory of finitely many data items. The paradigm is well-studied and known to coincide with set-driven learning. A hierarchy of stronger and stronger learning criteria is obtained when one considers, for each k ∈ N, iterative learners that can maintain a memory of at most k previously processed data items. We report on recent investigations of extensions of the Bounded Example Memory model where a constructive ordinal notation is used to bound the number of times the learner can ask for proper global memory extensions. © 2009 Springer.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=77952023189&origin=inward; http://dx.doi.org/10.1007/978-3-642-04414-4_27; http://link.springer.com/10.1007/978-3-642-04414-4_27; http://link.springer.com/content/pdf/10.1007/978-3-642-04414-4_27; http://www.springerlink.com/index/10.1007/978-3-642-04414-4_27; http://www.springerlink.com/index/pdf/10.1007/978-3-642-04414-4_27; https://dx.doi.org/10.1007/978-3-642-04414-4_27; https://link.springer.com/chapter/10.1007/978-3-642-04414-4_27
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know