https://oldena.lpnu.ua/handle/ntb/52489| Title: | Online Ranking Learning on Clusters |
| Authors: | Lyubchyk, Leonid Grinberg, Galyna |
| Affiliation: | National Technical University “Kharkiv Polytechnic Institute” |
| Bibliographic description (Ukraine): | Lyubchyk L. Online Ranking Learning on Clusters / Leonid Lyubchyk, Galyna Grinberg // Data stream mining and processing : proceedings of the IEEE second international conference, 21-25 August 2018, Lviv. — Львів : Lviv Politechnic Publishing House, 2018. — P. 193–197. — (Dynamic Data Mining & Data Stream Mining). |
| Bibliographic description (International): | Lyubchyk L. Online Ranking Learning on Clusters / Leonid Lyubchyk, Galyna Grinberg // Data stream mining and processing : proceedings of the IEEE second international conference, 21-25 August 2018, Lviv. — Lviv Politechnic Publishing House, 2018. — P. 193–197. — (Dynamic Data Mining & Data Stream Mining). |
| Is part of: | Data stream mining and processing : proceedings of the IEEE second international conference, 2018 |
| Conference/Event: | IEEE second international conference "Data stream mining and processing" |
| Issue Date: | 28-Feb-2018 |
| Publisher: | Lviv Politechnic Publishing House |
| Place of the edition/event: | Львів |
| Temporal Coverage: | 21-25 August 2018, Lviv |
| Keywords: | data stream kernel function online learning ranking learning recurrent estimation regularization utility function |
| Number of pages: | 5 |
| Page range: | 193-197 |
| Start page: | 193 |
| End page: | 197 |
| Abstract: | Online data stream ranking learning problem is considered using training data in the form of a sequence of identical items series, described by a number of features and relative rank within the series. It is assumed that feature values and relative ranks of the same items may vary slightly for different series of observations, and there are stable groups of items with similar properties. In this regard, the problem of learning to rank on clusters is stated, while training dataset consist of estimates of centers of clusters and average rank of the items inside each cluster. A unified approach to ranking learning on clusters using kernel models of utility function is proposed. Recurrent algorithms for estimating the parameters of a utility function model as well as recurrent ranking learning algorithm in the space of conjugate variables are developed. |
| URI: | https://ena.lpnu.ua/handle/ntb/52489 |
| ISBN: | © Національний університет „Львівська політехніка“, 2018 © Національний університет „Львівська політехніка“, 2018 |
| Copyright owner: | © Національний університет “Львівська політехніка”, 2018 |
| References (Ukraine): | [1] . Figueira, S. Greco and M. Ehrgott, Multiple criteria decision analysis: state of the art surveys. Springer, Switzerland, 2005. [2] H. Li, Learning to rank for information retrieval and natural language processing. Morgan & Claypool, Toronto, 2011. [3] T. Y. Liu, “Learning to rank for information retrieval,” Foundations and trends in information retrieval, vol. 3, no. 3, pp.225–331, 2009. [4] L. Hang, “A Short Introduction to Learning to Rank,” IEICE Trans. Information & Systrems, vol. E94-D, no.10, October 2011. [5] J. Furnkranz and E. Hullermeier, “Pairwise preference learning and ranking,” Lecture Notes in Computer Science, vol. 2837, pp. 145-156, 2003. [6] V. Noghin, “Relative importance of criteria: a quantitative approach,” Journal Multi-Criteria Decision Analysis, v. 6, pp. 355-363, 1997. [7] J. Barzilai, “Measurement and preference function modeling”, Intern. Trans. in Operational Research, vol. 12, pp. 173-183, 2005. [8] V. Podvezko, and A. Podviezko, “Dependence of multicriteria evaluation result on choice of preference functions and their parameters,” Technological and Economic Development of Economy. Baltic Jornal of Sustainability,16(1), pp.143–158, 2010. [9] L. Lyubchyk and G. Grinberg, “Preference function reconstruction for multiple criteria decision making dased on machine learning Approach,” Recent developments and new directions in Soft Computing, L.A. Zadeh et al. (Eds), Springer, pp. 53-63, 2014. [10] M. Espinoza, J. Suykens, and B. Moor, “Kernel based partially linear models and nonlinear identification,” IEEE Transactions on Automatic Control, 2005, vol. 50 (10), pp. 1602–1606. [11] J. A. Papini, S. de Amo, A. Kardec and S. Soares, “FPS Mining: A fast algorithm for mining user preferences in data streams,” Journal of Information and Data Management, vol. 5, no. 1, pp. 4–15, February 2014. [12] K. Hofmann, S. Whiteson, and M. de Rijke, “Balancing exploration and exploitation in learning to rank online”, In ECIR 2011: 33-rd European Conference on Information Retrieval. Springer, pp, 251-263, April 2011. [13] K. Hofmann, A. Schuth, S. Whiteson, and M. de Rijke, “Reusing historical interaction data for faster online learning to rank for information retrieval”, In WSDM 2013: International Conference on Web Search and Data Mining, ACM, 2013. [14] L. Lyubchyk and G. Grinberg, “Real time recursive preference learning to rank from data stream,” 1-th IEEE International Conference on Data Stream Mining & Processing, Lviv, Ukraine, pp. 280=285, 2016. [15] V. Strijov, and V. Shakin, “Index construction: the expert-statistical method,” Environmental research, engineering and management, no. 4 (26), pp.51-55, 2003. [16] L. Lyubchyk, V. Kolbasin and R. Shafeev, “Nonlinear signal reconstruction based on recursive moving window kernel method,” 8- th International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS’2015), Warsaw, Poland, pp. 298-302, 2015. |
| References (International): | [1] . Figueira, S. Greco and M. Ehrgott, Multiple criteria decision analysis: state of the art surveys. Springer, Switzerland, 2005. [2] H. Li, Learning to rank for information retrieval and natural language processing. Morgan & Claypool, Toronto, 2011. [3] T. Y. Liu, "Learning to rank for information retrieval," Foundations and trends in information retrieval, vol. 3, no. 3, pp.225–331, 2009. [4] L. Hang, "A Short Introduction to Learning to Rank," IEICE Trans. Information & Systrems, vol. E94-D, no.10, October 2011. [5] J. Furnkranz and E. Hullermeier, "Pairwise preference learning and ranking," Lecture Notes in Computer Science, vol. 2837, pp. 145-156, 2003. [6] V. Noghin, "Relative importance of criteria: a quantitative approach," Journal Multi-Criteria Decision Analysis, v. 6, pp. 355-363, 1997. [7] J. Barzilai, "Measurement and preference function modeling", Intern. Trans. in Operational Research, vol. 12, pp. 173-183, 2005. [8] V. Podvezko, and A. Podviezko, "Dependence of multicriteria evaluation result on choice of preference functions and their parameters," Technological and Economic Development of Economy. Baltic Jornal of Sustainability,16(1), pp.143–158, 2010. [9] L. Lyubchyk and G. Grinberg, "Preference function reconstruction for multiple criteria decision making dased on machine learning Approach," Recent developments and new directions in Soft Computing, L.A. Zadeh et al. (Eds), Springer, pp. 53-63, 2014. [10] M. Espinoza, J. Suykens, and B. Moor, "Kernel based partially linear models and nonlinear identification," IEEE Transactions on Automatic Control, 2005, vol. 50 (10), pp. 1602–1606. [11] J. A. Papini, S. de Amo, A. Kardec and S. Soares, "FPS Mining: A fast algorithm for mining user preferences in data streams," Journal of Information and Data Management, vol. 5, no. 1, pp. 4–15, February 2014. [12] K. Hofmann, S. Whiteson, and M. de Rijke, "Balancing exploration and exploitation in learning to rank online", In ECIR 2011: 33-rd European Conference on Information Retrieval. Springer, pp, 251-263, April 2011. [13] K. Hofmann, A. Schuth, S. Whiteson, and M. de Rijke, "Reusing historical interaction data for faster online learning to rank for information retrieval", In WSDM 2013: International Conference on Web Search and Data Mining, ACM, 2013. [14] L. Lyubchyk and G. Grinberg, "Real time recursive preference learning to rank from data stream," 1-th IEEE International Conference on Data Stream Mining & Processing, Lviv, Ukraine, pp. 280=285, 2016. [15] V. Strijov, and V. Shakin, "Index construction: the expert-statistical method," Environmental research, engineering and management, no. 4 (26), pp.51-55, 2003. [16] L. Lyubchyk, V. Kolbasin and R. Shafeev, "Nonlinear signal reconstruction based on recursive moving window kernel method," 8- th International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS’2015), Warsaw, Poland, pp. 298-302, 2015. |
| Content type: | Conference Abstract |
| Appears in Collections: | Data stream mining and processing : proceedings of the IEEE second international conference |
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2018_Lyubchyk_L-Online_Ranking_Learning_193-197.pdf | 231.77 kB | Adobe PDF | View/Open | |
| 2018_Lyubchyk_L-Online_Ranking_Learning_193-197__COVER.png | 598.73 kB | image/png | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.