Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Róbert Ormándi"'
Publikováno v:
Applied Stochastic Models in Business and Industry. 32:340-353
We consider the problem of estimating occurrence rates of rare events for extremely sparse data using pre-existing hierarchies and selected features to perform inference along multiple dimensions. In particular, we focus on the problem of estimating
Publikováno v:
ICDM Workshops
Look-alike models, which are efficient tools for finding similar users from a smaller user set, are quickly revolutionizing the online programmatic advertising industry. The datasets in these contexts exhibit extremely sparse feature spaces on a mass
Publikováno v:
Concurrency and Computation: Practice and Experience. 25:556-571
Machine learning over fully distributed data poses an important problem in peer-to-peer (P2P) applications. In this model we have one data record at each network node, but without the possibility to move raw data due to privacy considerations. For ex
Autor:
Attila Almási, Veronika Vincze, Róbert Busa-Fekete, István Hegedűs, Róbert Ormándi, Richárd Farkas, György Szarvas
Publikováno v:
Journal of the American Medical Informatics Association. 16:601-605
OBJECTIVE In this study the authors describe the system submitted by the team of University of Szeged to the second i2b2 Challenge in Natural Language Processing for Clinical Data. The challenge focused on the development of automatic systems that an
Massively distributed data mining in large networks such as smart device platforms and peer-to-peer systems is a rapidly developing research area. One important problem here is concept drift, where global data patterns (movement, preferences, activit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc976dc3233dfedd5c925875631c044b
http://publicatio.bibl.u-szeged.hu/3769/
http://publicatio.bibl.u-szeged.hu/3769/
Publikováno v:
Applied Stochastic Models in Business and Industry. 32:357-357
Publikováno v:
SISY
Applying sophisticated machine learning techniques on fully distributed data is increasingly important in many applications like distributed recommender systems or spam filters. In this type of networked environment the data model can change dynamica
Publikováno v:
SASO
In fully distributed networks data mining is an important tool for monitoring, control, and for offering personalized services to users. The underlying data model can change as a function of time according to periodic (daily, weakly) patterns, sudden
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1adee6b7b211245834ad80a67445d080
Publikováno v:
Euro-Par 2011 Parallel Processing ISBN: 9783642233999
Euro-Par (1)
Euro-Par (1)
Fully distributed data mining algorithms build global models over large amounts of data distributed over a large number of peers in a network, without moving the data itself. In the area of peer-to-peer (P2P) networks, such algorithms have various ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b115d3f6c55e2545b6ce2cc3eab95c6
https://doi.org/10.1007/978-3-642-23400-2_49
https://doi.org/10.1007/978-3-642-23400-2_49