Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Data Intensive Systems"'
Autor:
Kampers, Olaf, Qahtan, Abdulhakim, Mathur, Swati, Velegrakis, Yannis, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, SAC 2022, 326. Association for Computing Machinery (ACM)
STARTPAGE=326;TITLE=Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, SAC 2022
STARTPAGE=326;TITLE=Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, SAC 2022
As a financial asset, cryptocurrencies innovated the financial industry in different ways. However, the lack of regulations and transparency in cryptocurrency markets is hindering the industry from reaching its full potential. There is a need for ext
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6eb1c6e28272a1734fb663b68db4d26a
https://dspace.library.uu.nl/handle/1874/423155
https://dspace.library.uu.nl/handle/1874/423155
Autor:
Preti, Giulia, Lissandrini, Matteo, Mottin, Davide, Velegrakis, Yannis, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Preti, G, Lissandrini, M, Mottin, D & Velegrakis, Y 2019, ' Mining Patterns in Graphs with Multiple Weights ', Distributed and Parallel Databases, vol. 39 . https://doi.org/10.1007/s10619-019-07259-w
Distributed and Parallel Databases, 39(2), 281. Springer Netherlands
Preti, G, Lissandrini, M, Mottin, D & Velegrakis, Y 2021, ' Mining patterns in graphs with multiple weights ', Distributed and Parallel Databases, vol. 39, no. 2, pp. 281-319 . https://doi.org/10.1007/s10619-019-07259-w
Distributed and Parallel Databases, 39(2), 281. Springer Netherlands
Preti, G, Lissandrini, M, Mottin, D & Velegrakis, Y 2021, ' Mining patterns in graphs with multiple weights ', Distributed and Parallel Databases, vol. 39, no. 2, pp. 281-319 . https://doi.org/10.1007/s10619-019-07259-w
Graph pattern mining aims at identifying structures that appear frequently in large graphs, under the assumption that frequency signifies importance.In real life, there are many graphs with weights on nodes and/or edges.For these graphs, it is fair t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::890f4905976180c962e6c9f5cf7aefee
https://dspace.library.uu.nl/handle/1874/407656
https://dspace.library.uu.nl/handle/1874/407656
Autor:
Qahtan, A.A.A., Tang, Nan, Ouzzani, Mourad, Cao, Yang, Stonebraker, Michael, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Qahtan, A, Tang, N, Ouzzani, M, Cao, Y & Stonebraker, M 2020, ' Pattern Functional Dependencies for Data Cleaning ', Proceedings of the VLDB Endowment (PVLDB), vol. 13, no. 5, pp. 684-697 . https://doi.org/10.14778/3377369.3377377
VLDB Endowment
Proceedings of the VLDB Endowment, 13(5). Very Large Data Base Endowment Inc.
VLDB Endowment
Proceedings of the VLDB Endowment, 13(5). Very Large Data Base Endowment Inc.
Patterns (or regex-based expressions) are widely used to constrain the format of a domain (or a column), e.g. , a Year column should contain only four digits, and thus a value like "1980-" might be a typo. Moreover, integrity constraints (ICs) define
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7feb22ced13b0da639371864342d40c3
https://www.pure.ed.ac.uk/ws/files/128877365/Pattern_Functional_QAHTAN_DOA16122019_AFV.pdf
https://www.pure.ed.ac.uk/ws/files/128877365/Pattern_Functional_QAHTAN_DOA16122019_AFV.pdf
Autor:
Paganelli, Matteo, Guerra, Francesco, Sottovia, Paolo, Velegrakis, Yannis, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
CIKM 2019-Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2945. Association for Computing Machinery (ACM)
STARTPAGE=2945;TITLE=CIKM 2019-Proceedings of the 28th ACM International Conference on Information and Knowledge Management
CIKM
STARTPAGE=2945;TITLE=CIKM 2019-Proceedings of the 28th ACM International Conference on Information and Knowledge Management
CIKM
A rule-based entity matching task requires the definition of an effective set of rules, which is a time-consuming and error-prone process. The typical approach adopted for its resolution is a trial and error method, where the rules are incrementally
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::683d49f768d2bfde172b3e0494d5cfa3
https://dspace.library.uu.nl/handle/1874/389912
https://dspace.library.uu.nl/handle/1874/389912
Autor:
Rozenshtein, Polina, Preti, Giulia, Gionis, Aristides, Velegrakis, Yannis, Hutter, Frank, Kersting, Kristian, Lijffijt, Jefrey, Valera, Isabel, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Machine Learning and Knowledge Discovery in Databases-European Conference, ECML PKDD 2020, Ghent, Belgium, September 14–18, 2020, Proceedings, Part III
Machine Learning and Knowledge Discovery in Databases ISBN: 9783030676636
ECML/PKDD (3)
Machine Learning and Knowledge Discovery in Databases, 12459(1), 20. Springer Cham
Machine Learning and Knowledge Discovery in Databases ISBN: 9783030676636
ECML/PKDD (3)
Machine Learning and Knowledge Discovery in Databases, 12459(1), 20. Springer Cham
When searching for interesting structures in graphs, it is often important to take into account not only the graph connectivity, but also the metadata available, such as node and edge labels, or temporal information. In this paper we are interested i
Autor:
Radstok, Wessel, Chekol, Mel, Schaefer, Mirko, ICON - Media and Performance Studies, Sub Data Intensive Systems
Publikováno v:
Wikidata Workshop 2021 co-located with the 20th International Semantic Web Conference (ISWC 2021)
Recent studies on bias analysis of knowledge graph (KG) embedding models focus primarily on altering the models such that sensitive features are dealt with differently from other features. The underlying implication is that the models cause bias, or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::274db08b617f8913b25659786effd09d
https://dspace.library.uu.nl/handle/1874/415645
https://dspace.library.uu.nl/handle/1874/415645
Autor:
Lissandrini, Matteo, Mottin, Davide, Palpanas, Themis, Velegrakis, Yannis, Huang, Yennun, King, Irwin, Liu, Tie-Yan, van Steen, Maarten, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Lissandrini, M, Mottin, D, Palpanas, T & Velegrakis, Y 2020, Graph-Query Suggestions for Knowledge Graph Exploration . in The Web Conference 2020-Proceedings of the World Wide Web Conference, WWW 2020 . Association for Computing Machinery, pp. 2549-2555, 29th International World Wide Web Conference, WWW 2020, Taipei, Taiwan, Province of China, 20/04/2020 . https://doi.org/10.1145/3366423.3380005
WWW
WWW '20: Proceedings of The Web Conference 2020, 2549. Association for Computing Machinery
STARTPAGE=2549;TITLE=WWW '20: Proceedings of The Web Conference 2020
Lissandrini, M, Mottin, D, Palpanas, T & Velegrakis, Y 2020, Graph-Query Suggestions for Knowledge Graph Exploration . in Y Huang, I King, T-Y Liu & M van Steen (eds), WWW '20: Proceedings of The Web Conference 2020 . Association for Computing Machinery, New York, pp. 2549-2555, WWW '20, Taipei, Taiwan, 20/04/2020 . https://doi.org/10.1145/3366423.3380005
WWW
WWW '20: Proceedings of The Web Conference 2020, 2549. Association for Computing Machinery
STARTPAGE=2549;TITLE=WWW '20: Proceedings of The Web Conference 2020
Lissandrini, M, Mottin, D, Palpanas, T & Velegrakis, Y 2020, Graph-Query Suggestions for Knowledge Graph Exploration . in Y Huang, I King, T-Y Liu & M van Steen (eds), WWW '20: Proceedings of The Web Conference 2020 . Association for Computing Machinery, New York, pp. 2549-2555, WWW '20, Taipei, Taiwan, 20/04/2020 . https://doi.org/10.1145/3366423.3380005
We consider the task of exploratory search through graph queries on knowledge graphs. We propose to assist the user by expanding the query with intuitive suggestions to provide a more informative (full) query that can retrieve more detailed and relev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96ea7eaf88913f191d9383172b2f6ba7
https://vbn.aau.dk/da/publications/41d61c65-81d2-4155-b8af-2186ec520e22
https://vbn.aau.dk/da/publications/41d61c65-81d2-4155-b8af-2186ec520e22
Autor:
Gallo, Denis, Lissandrini, Matteo, Velegrakis, Yannis, Bonifati, Angela, Zhou, Yongluan, Vaz Salles, Marcos Antonio, Bohm, Alexander, Olteanu, Dan, Fletcher, George, Khan, Arijit, Yang, Bin, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Advances in Database Technology-EDBT 2020, 2020-March, 447. OpenProceedings.org
Graphs are everywhere. Personalized Page Rank (PPR) is a particularly important task to support search and exploration within such datasets. PPR computes the proximity between query nodes and other nodes in the graph. This is used, among others, for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::a8e769aac61b78d71607c0ff522103cd
https://dspace.library.uu.nl/handle/1874/396780
https://dspace.library.uu.nl/handle/1874/396780
Autor:
Consonni, Cristian, Sottovia, Paolo, Montresor, Alberto, Velegrakis, Yannis, Kaoudi, Zoi, Galhardas, Helena, Fundulaki, Irini, Reinwald, Berthold, Herschel, Melanie, Binnig, Carsten, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Advances in Database Technology-EDBT 2019, 2019-March, 409. OpenProceedings.org
A relevant task in the exploration and understanding of large datasets is the discovery of hidden relationships in the data. In particular, functional dependencies have received considerable attention in the past. However, there are other kinds of re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::e4b43c3d22be91f6cab878ea62365b15
https://dspace.library.uu.nl/handle/1874/384380
https://dspace.library.uu.nl/handle/1874/384380
Autor:
Bergamaschi, Sonia, Domnori, Elton, Guerra, Francesco, Orsini, Mirko, Lado, Raquel Trillo, Velegrakis, Yannis, Sub Data Intensive Systems, Data Intensive Systems
Publikováno v:
Scopus-Elsevier
Proceedings of the VLDB Endowment, 3(2), 1637. Very Large Data Base Endowment Inc.
Proceedings of the VLDB Endowment, 3(2), 1637. Very Large Data Base Endowment Inc.
We propose the demonstration of Keymantic , a system for keyword-based searching in relational databases that does not require a-priori knowledge of instances held in a database. It finds numerous applications in situations where traditional keyword-