Levente Kocsis

According to our database1, Levente Kocsis authored at least 28 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Reinforcement Learning, Unsupervised Methods, and Concept Drift in Stream Learning.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Recommender Systems Over Data Streams.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Online Machine Learning in Big Data Streams: Overview.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Online Machine Learning Algorithms over Data Streams.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Online ranking combination.
Proceedings of the 13th ACM Conference on Recommender Systems, 2019

2017
Location-aware online learning for top-k recommendation.
Pervasive and Mobile Computing, 2017

Online Ranking Prediction in Non-stationary Environments.
Proceedings of the 1st Workshop on Temporal Reasoning in Recommender Systems co-located with 11th International Conference on Recommender Systems (RecSys 2017), 2017

Alpenglow: Open Source Recommender Framework with Time-aware Learning and Evaluation.
Proceedings of the Poster Track of the 11th ACM Conference on Recommender Systems (RecSys 2017), 2017

2016
Robust Decentralized Low-Rank Matrix Decomposition.
ACM TIST, 2016

2015
Solving RecSys Challenge 2015 by Linear Models, Gradient Boosted Trees and Metric Optimization.
Proceedings of the 2015 International ACM Recommender Systems Challenge, 2015

Location-Aware Online Learning for Top-k Hashtag Recommendation.
Proceedings of the Workshop on Location-Aware Recommendations, 2015

2014
Exploiting temporal influence in online recommendation.
Proceedings of the Eighth ACM Conference on Recommender Systems, 2014

Fully distributed robust singular value decomposition.
Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing, 2014

2013
BoostingTree: parallel selection of weak learners in boosting, with application to ranking.
Machine Learning, 2013

2012
The grand challenge of computer Go: Monte Carlo tree search and extensions.
Commun. ACM, 2012

2011
Efficient Multi-Start Strategies for Local Search Algorithms.
J. Artif. Intell. Res., 2011

2009
Efficient Multi-start Strategies for Local Search Algorithms.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2009

2008
Transpositions and move groups in Monte Carlo tree search.
Proceedings of the 2008 IEEE Symposium on Computational Intelligence and Games, 2008

2007
Continuous Time Associative Bandit Problems.
Proceedings of the IJCAI 2007, 2007

2006
Universal parameter optimisation in games based on SPSA.
Machine Learning, 2006

Bandit Based Monte-Carlo Planning.
Proceedings of the Machine Learning: ECML 2006, 2006

RSPSA: Enhanced Parameter Optimization in Games.
Proceedings of the Advances in Computer Games, 11th International Conference, 2006

2003
Two Learning Algorithms for Forward Pruning.
ICGA Journal, 2003

2002
Learning in Lines of Action.
Proceedings of the 3rd International Conference on Intelligent Games and Simulation (GAME-ON 2002), 2002

The Neural MoveMap Heuristic in Chess.
Proceedings of the Computers and Games, Third International Conference, CG 2002, Edmonton, 2002

2001
Move Ordering Using Neural Networks.
Proceedings of the Engineering of Intelligent Systems, 2001

2000
Learning Time Allocation Using Neural Networks.
Proceedings of the Computers and Games, Second International Conference, 2000

1998
An Unsupervised Training Connectionist Network with Lateral Inhibition.
Proceedings of the Tasks and Methods in Applied Artificial Intelligence, 1998


  Loading...