Jump to content

EU Centre of ExcellenceISO 9001

ERCIMW3C MemberFraunhofer Project Center

Informatics Laboratory

Head of department

András Benczúr
András Benczúr
Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L 412
Phone: +36 1 279 6172
Fax: +36 1 209 5269
E-mail: benczur.andrasEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu
Homepage: http://datamining.sztaki.hu/


Sub-groups of this department

Data Mining and Search Group
Research Group for Human Language Technologies
Research Group for Parameterized Algorithms and Complexity
Data Warehousing and Business Intelligence Group


Society has reached a point of no return, one that leaves us completely reliant on omnipresent ICT-mediated communication. Mobile and sensor-rich portable devices connect millions of humans with Petabytes of data and numerous on-line services. However, tearing down the physical-digital barrier in a scalable fashion requires both radically novel algorithmic knowledge and in-depth understanding of humans and societies. We will deliver major theoretical advances in real-time intelligent information management of large datasets including online social networks, mobile devices and humans in physical space by delivering three functions: “alert”, by real-time location-aware knowledge acquisition, analysis and visualization; “response”, through on-demand composition and coordination of large teams; and effective “communication”, through recommendation and personalization.

“Big Data” is an emerging new research area for the methodologies of extreme large scale problems in business intelligence, e-science and Web mining. We concentrate on applications for social network mining, graph clustering, personalized and similarity search, recommendation and spam filtering, as well as security problems ranging from financial risk analysis or insurance fraud to people trafficking or organized crime.

We plan to conduct research ranging from theory to experimentation by building on the unique nature of our research lab. We cover the full chain from core research to industrial deployment, including unique access to data ranging from telecommunication logs to large scale Web crawls. As a particular strength in our previous results, we design algorithms that handle the explosive growth in data sizes and impose no artificial size limits for real-world applications. The highlights of our proposed research with both novel areas as well as related fields where we have the strongest existing results are listed next.

Research areas

• Theory of algorithms
• Complexity
• Computer science
• Data Mining
• Search technologies
• Visual Analytics
• Big data
• Business Intelligence

Selected achievements

The Laboratory hosts the ERC Starting Grant winner Dániel Marx and the winner of the Momentum Grant of the Hungarian Academy of Sciences, András Benczúr. The R&D results of the laboratory focus on data mining and search solutions for community and link analysis, custom solutions for extreme large systems (large Intranets, high traffic portals) as well as for languages with particularly complex syntax in collaboration with computational linguistic groups. For the quality of our research results we were awarded a Yahoo! Faculty Research Grant in the academic year 2006/2007. In 2007 the Group achieved First Prize on the prestigious KDD Cup, a competition involving the best data mining groups around the world. Several of our former PhD students work now at the research centers of the leading internet search companies
Know-how and industrial solutions
Major software products include a customer relation management software capable of visualizing the connection between entities (persons, objects, contracts) as well as in a search engine with integrated linguistic tools for the Hungarian language that serves the Intranet of national branches of multinational companies (T-Mobile, Vodafone, AEGON). We led several customer relation management and risk assessment projects for AEGON Hungary.


• Hungarian Telecom: Intranet and portal search solutions, fully operational since 2004.
• Web server and IT log analytics system, T-Online, AEGON Hungary.
• Hungarian Telecom: Call community and customer analysis tool.
• AEGON Hungary: Desktop search engine, data warehousing, customer network analysis, fraud detection, car insurance campaign toolkit, 2006-.

More information:



Zsolt Both
Zsolt Both
Address: 1111 Budapest, Lágymányosi u. 11
Mail address: 1111 Budapest, Kende u. 13-17.
Room number: L 109
E-mail: both.zsoltEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu
Zsolt Fekete
Zsolt Fekete
Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L 112
Phone: +36 1 279 6283
E-mail: fekete.zsoltEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu
István Miklós
István Miklós
Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L412
Phone: 279-6172
E-mail: miklos.istvanEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu
Homepage: www.renyi.hu/~miklosi/
Csaba István Sidló
Csaba István Sidló
Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L 101
Phone: +36 1 279 6281
E-mail: sidlo.csaba.istvanEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu
Homepage: http://dms.sztaki.hu/hu/tagunk/sidlo-csaba-istvan
Gabriella Takács
Gabriella Takács
Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L412
Phone: + 36 1 279 6172
Fax: + 36 1 279 6108
E-mail: takacs.gabriellaEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu

Important publications


Hidden translation and translating coset in quantum computing
Authors: Friedl, Katalin; Ivanyos, Gábor; Magniez, F.; Santha, M.; Sen, P.
Date: 2014.
Deterministic polynomial factoring and association schemes
Authors: Arora, Manuel; Karpinski, Marek; Saxena, Nitin
Date: 2014.
Quantum computation of discrete logarithms in semigroups
Authors: Childs, Andrew M.; Ivanyos, Gábor
Date: 2014. 07. 08.


Hidden symmetry subgroup problems
Authors: Decker, Thomas; Ivanyos, Gábor; Santha, Miklos; Wocjan, Pawel
Date: 2013.
Miből lesz a robot MÁV-pénztáros
Authors: Nemeskey, Dávid; Recski, Gábor; Zséder, Attila
Date: 2013. 01. 07.


Trading GRH for algebra: algorithms for factoring polynomials and related structures
Authors: Ivanyos, Gábor; Karpinski, Marek; Rónyai, Lajos; Saxena, Nitin
Date: 2012.
The grand challenge of computer Go: Monte Carlo Tree Search and Extensions
Authors: Gelly, Sylvain; Kocsis, Levente; Schoenauer, Marc; Sebag, Michèle; Silver, David; Szepesvári, Csaba; Teytaud, Olivier
Date: 2012. 03.


Multivalued generalizations of the Frankl-Pach Theorem
Authors: Rónyai, Lajos; Hegedűs, Gábor
Date: 2011. 08. 04.


A Hungarian NP Chunker
Authors: Recski, Gábor; Varga, Dániel
Date: 2010.


Algebraic properties of modulo q complete l-wide families
Authors: Felszeghy, Bálint; Hegedűs, Gábor; Rónyai, Lajos
Date: 2009.


Constructions for quantum computing with symmetrized gates
Authors: Ivanyos, Gábor; Nagy, Attila B.; Rónyai, Lajos
Date: 2008.
Graphs representimg sets of functional dependencies
Authors: Demetrovics, János; Molnár, András; Thalheim, Berhard
Date: 2008.