2017
[1]
A. Abujabal, R. S. Roy, M. Yahya, and G. Weikum, “QUINT: Interpretable Question Answering over Knowledge Bases,” in The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017), Copenhagen, Denmark, 2017.
Export
BibTeX
@inproceedings{AbujabalENMLP2017, TITLE = {{QUINT}: {I}nterpretable Question Answering over Knowledge Bases}, AUTHOR = {Abujabal, Abdalghani and Roy, Rishiraj Saha and Yahya, Mohamed and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-945626-97-5}, URL = {http://aclweb.org/anthology/D17-2011}, PUBLISHER = {ACL}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017)}, PAGES = {61--66}, ADDRESS = {Copenhagen, Denmark}, }
Endnote
%0 Conference Proceedings %A Abujabal, Abdalghani %A Roy, Rishiraj Saha %A Yahya, Mohamed %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T QUINT: Interpretable Question Answering over Knowledge Bases : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-F97C-E %U http://aclweb.org/anthology/D17-2011 %D 2017 %B Conference on Empirical Methods in Natural Language Processing %Z date of event: 2017-09-09 - 2017-09-11 %C Copenhagen, Denmark %B The Conference on Empirical Methods in Natural Language Processing %P 61 - 66 %I ACL %@ 978-1-945626-97-5 %U http://aclweb.org/anthology/D17-2011
[2]
A. Abujabal, M. Yahya, M. Riedewald, and G. Weikum, “Automated Template Generation for Question Answering over Knowledge Graphs,” in WWW’17, 26th International Conference on World Wide Web, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{AbujabalWWW2017, TITLE = {Automated Template Generation for Question Answering over Knowledge Graphs}, AUTHOR = {Abujabal, Abdalghani and Yahya, Mohamed and Riedewald, Mirek and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-4503-4913-0}, DOI = {10.1145/3038912.3052583}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17, 26th International Conference on World Wide Web}, PAGES = {1191--1200}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Abujabal, Abdalghani %A Yahya, Mohamed %A Riedewald, Mirek %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Automated Template Generation for Question Answering over Knowledge Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4F9C-E %R 10.1145/3038912.3052583 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 %P 1191 - 1200 %I ACM %@ 978-1-4503-4913-0
[3]
P. Agarwal and J. Strötgen, “Tiwiki: Searching Wikipedia with Temporal Constraints,” in WWW ’17 Companion, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{AgarwalStroetgen2017_TempWeb, TITLE = {Tiwiki: Searching {W}ikipedia with Temporal Constraints}, AUTHOR = {Agarwal, Prabal and Str{\"o}tgen, Jannik}, LANGUAGE = {eng}, ISBN = {978-1-4503-4914-7}, DOI = {10.1145/3041021.3051112}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW '17 Companion}, PAGES = {1595--1600}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Agarwal, Prabal %A Strötgen, Jannik %+ International Max Planck Research School, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Tiwiki: Searching Wikipedia with Temporal Constraints : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-53AE-9 %R 10.1145/3041021.3051112 %D 2017 %B 26th International Conference on World Wide Web Companion %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW '17 Companion %P 1595 - 1600 %I ACM %@ 978-1-4503-4914-7
[4]
R. Andrade and J. Strötgen, “All Dates Lead to Rome: Extracting and Explaining Temporal References in Street Names,” in WWW’17 Companion, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{AndradeWWW2017, TITLE = {All Dates Lead to {R}ome: {E}xtracting and Explaining Temporal References in Street Names}, AUTHOR = {Andrade, Rosita and Str{\"o}tgen, Jannik}, LANGUAGE = {eng}, ISBN = {978-1-4503-4914-7}, DOI = {10.1145/3041021.3054249}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17 Companion}, PAGES = {757--758}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Andrade, Rosita %A Strötgen, Jannik %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T All Dates Lead to Rome: Extracting and Explaining Temporal References in Street Names : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-62AE-1 %R 10.1145/3041021.3054249 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 Companion %P 757 - 758 %I ACM %@ 978-1-4503-4914-7
[5]
A. Bhattacharyya and J. Vreeken, “Efficiently Summarising Event Sequences with Rich Interleaving Patterns,” 2017. [Online]. Available: http://arxiv.org/abs/1701.08096. (arXiv: 1701.08096)
Abstract
Discovering the key structure of a database is one of the main goals of data mining. In pattern set mining we do so by discovering a small set of patterns that together describe the data well. The richer the class of patterns we consider, and the more powerful our description language, the better we will be able to summarise the data. In this paper we propose \ourmethod, a novel greedy MDL-based method for summarising sequential data using rich patterns that are allowed to interleave. Experiments show \ourmethod is orders of magnitude faster than the state of the art, results in better models, as well as discovers meaningful semantics in the form patterns that identify multiple choices of values.
Export
BibTeX
@online{DBLP:journals/corr/BhattacharyyaV17, TITLE = {Efficiently Summarising Event Sequences with Rich Interleaving Patterns}, AUTHOR = {Bhattacharyya, Apratim and Vreeken, Jilles}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1701.08096}, EPRINT = {1701.08096}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Discovering the key structure of a database is one of the main goals of data mining. In pattern set mining we do so by discovering a small set of patterns that together describe the data well. The richer the class of patterns we consider, and the more powerful our description language, the better we will be able to summarise the data. In this paper we propose \ourmethod, a novel greedy MDL-based method for summarising sequential data using rich patterns that are allowed to interleave. Experiments show \ourmethod is orders of magnitude faster than the state of the art, results in better models, as well as discovers meaningful semantics in the form patterns that identify multiple choices of values.}, }
Endnote
%0 Report %A Bhattacharyya, Apratim %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Efficiently Summarising Event Sequences with Rich Interleaving Patterns : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90E4-A %U http://arxiv.org/abs/1701.08096 %D 2017 %X Discovering the key structure of a database is one of the main goals of data mining. In pattern set mining we do so by discovering a small set of patterns that together describe the data well. The richer the class of patterns we consider, and the more powerful our description language, the better we will be able to summarise the data. In this paper we propose \ourmethod, a novel greedy MDL-based method for summarising sequential data using rich patterns that are allowed to interleave. Experiments show \ourmethod is orders of magnitude faster than the state of the art, results in better models, as well as discovers meaningful semantics in the form patterns that identify multiple choices of values. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Databases, cs.DB
[6]
A. Bhattacharyya and J. Vreeken, “Efficiently Summarising Event Sequences with Rich Interleaving Patterns,” in Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017), Houston, TX, USA, 2017.
Export
BibTeX
@inproceedings{bhattacharyya:17:squish, TITLE = {Efficiently Summarising Event Sequences with Rich Interleaving Patterns}, AUTHOR = {Bhattacharyya, Apratim and Vreeken, Jilles}, LANGUAGE = {eng}, ISBN = {978-1-61197-497-3}, DOI = {10.1137/1.9781611974973.89}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017)}, PAGES = {795--803}, ADDRESS = {Houston, TX, USA}, }
Endnote
%0 Conference Proceedings %A Bhattacharyya, Apratim %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Efficiently Summarising Event Sequences with Rich Interleaving Patterns : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4BDC-D %R 10.1137/1.9781611974973.89 %D 2017 %B 17th SIAM International Conference on Data Mining %Z date of event: 2017-04-27 - 2017-04-29 %C Houston, TX, USA %B Proceedings of the Seventeenth SIAM International Conference on Data Mining %P 795 - 803 %I SIAM %@ 978-1-61197-497-3
[7]
A. J. Biega, R. S. Roy, and G. Weikum, “Privacy through Solidarity: A User-Utility-Preserving Framework to Counter Profiling,” in SIGIR’17, 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, Shinjuku, Tokyo, Japan, 2017.
Export
BibTeX
@inproceedings{BiegaSIGIR2017, TITLE = {Privacy through Solidarity: {A} User-Utility-Preserving Framework to Counter Profiling}, AUTHOR = {Biega, Asia J. and Roy, Rishiraj Saha and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-4503-5022-8}, DOI = {10.1145/3077136.3080830}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {SIGIR'17, 40th International ACM SIGIR Conference on Research and Development in Information Retrieval}, PAGES = {675--684}, ADDRESS = {Shinjuku, Tokyo, Japan}, }
Endnote
%0 Conference Proceedings %A Biega, Asia J. %A Roy, Rishiraj Saha %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Privacy through Solidarity: A User-Utility-Preserving Framework to Counter Profiling : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-F901-2 %R 10.1145/3077136.3080830 %D 2017 %B 40th International ACM SIGIR Conference on Research and Development in Information Retrieval %Z date of event: 2017-08-07 - 2017-08-11 %C Shinjuku, Tokyo, Japan %B SIGIR'17 %P 675 - 684 %I ACM %@ 978-1-4503-5022-8
[8]
N. Boldyrev, M. Spaniol, J. Strötgen, and G. Weikum, “SESAME: European Statistics Explored via Semantic Alignment onto Wikipedia,” in WWW’17 Companion, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{BoldyrevWWW2017, TITLE = {{SESAME}: {E}uropean Statistics Explored via Semantic Alignment onto {Wikipedia}}, AUTHOR = {Boldyrev, Natalia and Spaniol, Marc and Str{\"o}tgen, Jannik and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-4503-4914-7}, DOI = {10.1145/3041021.3054732}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17 Companion}, PAGES = {177--181}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Boldyrev, Natalia %A Spaniol, Marc %A Strötgen, Jannik %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T SESAME: European Statistics Explored via Semantic Alignment onto Wikipedia : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-80B0-0 %R 10.1145/3041021.3054732 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 Companion %P 177 - 181 %I ACM %@ 978-1-4503-4914-7
[9]
M. Boley, B. R. Goldsmith, L. M. Ghiringhelli, and J. Vreeken, “Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery,” Data Mining and Knowledge Discovery, vol. 31, no. 5, 2017.
Export
BibTeX
@article{Boley2017, TITLE = {Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery}, AUTHOR = {Boley, Mario and Goldsmith, Bryan R. and Ghiringhelli, Luca M. and Vreeken, Jilles}, LANGUAGE = {eng}, DOI = {10.1007/s10618-017-0520-3}, PUBLISHER = {Springer}, ADDRESS = {London}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, JOURNAL = {Data Mining and Knowledge Discovery}, VOLUME = {31}, NUMBER = {5}, PAGES = {1391--1418}, }
Endnote
%0 Journal Article %A Boley, Mario %A Goldsmith, Bryan R. %A Ghiringhelli, Luca M. %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90E1-0 %R 10.1007/s10618-017-0520-3 %7 2017-06-28 %D 2017 %8 28.06.2017 %J Data Mining and Knowledge Discovery %V 31 %N 5 %& 1391 %P 1391 - 1418 %I Springer %C London
[10]
M. Boley, B. R. Goldsmith, L. M. Ghiringhelli, and J. Vreeken, “Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery,” 2017. [Online]. Available: http://arxiv.org/abs/1701.07696. (arXiv: 1701.07696)
Abstract
Existing algorithms for subgroup discovery with numerical targets do not optimize the error or target variable dispersion of the groups they find. This often leads to unreliable or inconsistent statements about the data, rendering practical applications, especially in scientific domains, futile. Therefore, we here extend the optimistic estimator framework for optimal subgroup discovery to a new class of objective functions: we show how tight estimators can be computed efficiently for all functions that are determined by subgroup size (non-decreasing dependence), the subgroup median value, and a dispersion measure around the median (non-increasing dependence). In the important special case when dispersion is measured using the average absolute deviation from the median, this novel approach yields a linear time algorithm. Empirical evaluation on a wide range of datasets shows that, when used within branch-and-bound search, this approach is highly efficient and indeed discovers subgroups with much smaller errors.
Export
BibTeX
@online{DBLP:journals/corr/BoleyGGV17, TITLE = {Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery}, AUTHOR = {Boley, Mario and Goldsmith, Bryan R. and Ghiringhelli, Luca M. and Vreeken, Jilles}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1701.07696}, EPRINT = {1701.07696}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Existing algorithms for subgroup discovery with numerical targets do not optimize the error or target variable dispersion of the groups they find. This often leads to unreliable or inconsistent statements about the data, rendering practical applications, especially in scientific domains, futile. Therefore, we here extend the optimistic estimator framework for optimal subgroup discovery to a new class of objective functions: we show how tight estimators can be computed efficiently for all functions that are determined by subgroup size (non-decreasing dependence), the subgroup median value, and a dispersion measure around the median (non-increasing dependence). In the important special case when dispersion is measured using the average absolute deviation from the median, this novel approach yields a linear time algorithm. Empirical evaluation on a wide range of datasets shows that, when used within branch-and-bound search, this approach is highly efficient and indeed discovers subgroups with much smaller errors.}, }
Endnote
%0 Report %A Boley, Mario %A Goldsmith, Bryan R. %A Ghiringhelli, Luca M. %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90DB-F %U http://arxiv.org/abs/1701.07696 %D 2017 %X Existing algorithms for subgroup discovery with numerical targets do not optimize the error or target variable dispersion of the groups they find. This often leads to unreliable or inconsistent statements about the data, rendering practical applications, especially in scientific domains, futile. Therefore, we here extend the optimistic estimator framework for optimal subgroup discovery to a new class of objective functions: we show how tight estimators can be computed efficiently for all functions that are determined by subgroup size (non-decreasing dependence), the subgroup median value, and a dispersion measure around the median (non-increasing dependence). In the important special case when dispersion is measured using the average absolute deviation from the median, this novel approach yields a linear time algorithm. Empirical evaluation on a wide range of datasets shows that, when used within branch-and-bound search, this approach is highly efficient and indeed discovers subgroups with much smaller errors. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Databases, cs.DB
[11]
K. Budhathoki and J. Vreeken, “Correlation by Compression,” in Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017), Houston, TX, USA, 2017.
Export
BibTeX
@inproceedings{budhathoki:17:cbc, TITLE = {Correlation by Compression}, AUTHOR = {Budhathoki, Kailash and Vreeken, Jilles}, LANGUAGE = {eng}, ISBN = {978-1-611974-87-4}, DOI = {10.1137/1.9781611974973.59}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017)}, EDITOR = {Chawla, Nitesh}, PAGES = {525--533}, ADDRESS = {Houston, TX, USA}, }
Endnote
%0 Conference Proceedings %A Budhathoki, Kailash %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Correlation by Compression : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4BD8-6 %R 10.1137/1.9781611974973.59 %D 2017 %B 17th SIAM International Conference on Data Mining %Z date of event: 2017-04-27 - 2017-04-29 %C Houston, TX, USA %B Proceedings of the Seventeenth SIAM International Conference on Data Mining %E Chawla, Nitesh; Wang, Wei %P 525 - 533 %I SIAM %@ 978-1-611974-87-4
[12]
K. Budhathoki and J. Vreeken, “Causal Inference by Stochastic Complexity,” 2017. [Online]. Available: http://arxiv.org/abs/1702.06776. (arXiv: 1702.06776)
Abstract
The algorithmic Markov condition states that the most likely causal direction between two random variables X and Y can be identified as that direction with the lowest Kolmogorov complexity. Due to the halting problem, however, this notion is not computable. We hence propose to do causal inference by stochastic complexity. That is, we propose to approximate Kolmogorov complexity via the Minimum Description Length (MDL) principle, using a score that is mini-max optimal with regard to the model class under consideration. This means that even in an adversarial setting, such as when the true distribution is not in this class, we still obtain the optimal encoding for the data relative to the class. We instantiate this framework, which we call CISC, for pairs of univariate discrete variables, using the class of multinomial distributions. Experiments show that CISC is highly accurate on synthetic, benchmark, as well as real-world data, outperforming the state of the art by a margin, and scales extremely well with regard to sample and domain sizes.
Export
BibTeX
@online{DBLP:journals/corr/BudhathokiV17, TITLE = {Causal Inference by Stochastic Complexity}, AUTHOR = {Budhathoki, Kailash and Vreeken, Jilles}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1702.06776}, EPRINT = {1702.06776}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The algorithmic Markov condition states that the most likely causal direction between two random variables X and Y can be identified as that direction with the lowest Kolmogorov complexity. Due to the halting problem, however, this notion is not computable. We hence propose to do causal inference by stochastic complexity. That is, we propose to approximate Kolmogorov complexity via the Minimum Description Length (MDL) principle, using a score that is mini-max optimal with regard to the model class under consideration. This means that even in an adversarial setting, such as when the true distribution is not in this class, we still obtain the optimal encoding for the data relative to the class. We instantiate this framework, which we call CISC, for pairs of univariate discrete variables, using the class of multinomial distributions. Experiments show that CISC is highly accurate on synthetic, benchmark, as well as real-world data, outperforming the state of the art by a margin, and scales extremely well with regard to sample and domain sizes.}, }
Endnote
%0 Report %A Budhathoki, Kailash %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Causal Inference by Stochastic Complexity : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90F2-A %U http://arxiv.org/abs/1702.06776 %D 2017 %X The algorithmic Markov condition states that the most likely causal direction between two random variables X and Y can be identified as that direction with the lowest Kolmogorov complexity. Due to the halting problem, however, this notion is not computable. We hence propose to do causal inference by stochastic complexity. That is, we propose to approximate Kolmogorov complexity via the Minimum Description Length (MDL) principle, using a score that is mini-max optimal with regard to the model class under consideration. This means that even in an adversarial setting, such as when the true distribution is not in this class, we still obtain the optimal encoding for the data relative to the class. We instantiate this framework, which we call CISC, for pairs of univariate discrete variables, using the class of multinomial distributions. Experiments show that CISC is highly accurate on synthetic, benchmark, as well as real-world data, outperforming the state of the art by a margin, and scales extremely well with regard to sample and domain sizes. %K Computer Science, Learning, cs.LG,Computer Science, Artificial Intelligence, cs.AI
[13]
K. Budhathoki and J. Vreeken, “Causal Inference by Compression,” in 16th IEEE International Conference on Data Mining (ICDM 2016), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{budhathoki:16:origo, TITLE = {Causal Inference by Compression}, AUTHOR = {Budhathoki, Kailash and Vreeken, Jilles}, LANGUAGE = {eng}, ISBN = {978-1-5090-5473-2}, DOI = {10.1109/ICDM.2016.0015}, PUBLISHER = {IEEE}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {16th IEEE International Conference on Data Mining (ICDM 2016)}, EDITOR = {Bonchi, Francesco and Domingo-Ferrer, Josep and Baeza-Yates, Ricardo and Zhou, Zhi-Hua and Wu, Xindong}, PAGES = {41--50}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Budhathoki, Kailash %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Causal Inference by Compression : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-1CC0-6 %R 10.1109/ICDM.2016.0015 %D 2017 %8 02.02.2017 %B 16th International Conference on Data Mining %Z date of event: 2016-12-12 - 2016-12-15 %C Barcelona, Spain %B 16th IEEE International Conference on Data Mining %E Bonchi, Francesco; Domingo-Ferrer, Josep; Baeza-Yates, Ricardo; Zhou, Zhi-Hua; Wu, Xindong %P 41 - 50 %I IEEE %@ 978-1-5090-5473-2
[14]
C. X. Chu, N. Tandon, and G. Weikum, “Distilling Task Knowledge from How-To Communities,” in WWW’17, 26th International Conference on World Wide Web, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{Cuong:WWW2017, TITLE = {Distilling Task Knowledge from How-To Communities}, AUTHOR = {Chu, Cuong Xuan and Tandon, Niket and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-4503-4913-0}, DOI = {10.1145/3038912.3052715}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17, 26th International Conference on World Wide Web}, PAGES = {805--814}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Chu, Cuong Xuan %A Tandon, Niket %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Distilling Task Knowledge from How-To Communities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-54BE-E %R 10.1145/3038912.3052715 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 %P 805 - 814 %I ACM %@ 978-1-4503-4913-0
[15]
A. Cohan, S. Young, A. Yates, and N. Goharian, “Triaging Content Severity in Online Mental Health Forums,” Journal of the Association for Information Science and Technology, vol. 68, no. 11, 2017.
Export
BibTeX
@article{Cohan2017, TITLE = {Triaging Content Severity in Online Mental Health Forums}, AUTHOR = {Cohan, Arman and Young, Sydney and Yates, Andrew and Goharian, Nazli}, LANGUAGE = {eng}, ISSN = {2330-1635}, DOI = {10.1002/asi.23865}, PUBLISHER = {Wiley}, ADDRESS = {Chichester, UK}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of the Association for Information Science and Technology}, VOLUME = {68}, NUMBER = {11}, PAGES = {2675--2689}, }
Endnote
%0 Journal Article %A Cohan, Arman %A Young, Sydney %A Yates, Andrew %A Goharian, Nazli %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Triaging Content Severity in Online Mental Health Forums : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-06B9-8 %R 10.1002/asi.23865 %7 2017-09-25 %D 2017 %8 25.09.2017 %J Journal of the Association for Information Science and Technology %O asis&t %V 68 %N 11 %& 2675 %P 2675 - 2689 %I Wiley %C Chichester, UK %@ false
[16]
A. Cohan, S. Young, A. Yates, and N. Goharian, “Triaging Content Severity in Online Mental Health Forums,” 2017. [Online]. Available: http://arxiv.org/abs/1702.06875. (arXiv: 1702.06875)
Abstract
Mental health forums are online communities where people express their issues and seek help from moderators and other users. In such forums, there are often posts with severe content indicating that the user is in acute distress and there is a risk of attempted self-harm. Moderators need to respond to these severe posts in a timely manner to prevent potential self-harm. However, the large volume of daily posted content makes it difficult for the moderators to locate and respond to these critical posts. We present a framework for triaging user content into four severity categories which are defined based on indications of self-harm ideation. Our models are based on a feature-rich classification framework which includes lexical, psycholinguistic, contextual and topic modeling features. Our approaches improve the state of the art in triaging the content severity in mental health forums by large margins (up to 17% improvement over the F-1 scores). Using the proposed model, we analyze the mental state of users and we show that overall, long-term users of the forum demonstrate a decreased severity of risk over time. Our analysis on the interaction of the moderators with the users further indicates that without an automatic way to identify critical content, it is indeed challenging for the moderators to provide timely response to the users in need.
Export
BibTeX
@online{Cohan_arXiv2017, TITLE = {Triaging Content Severity in Online Mental Health Forums}, AUTHOR = {Cohan, Arman and Young, Sydney and Yates, Andrew and Goharian, Nazli}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1702.06875}, EPRINT = {1702.06875}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Mental health forums are online communities where people express their issues and seek help from moderators and other users. In such forums, there are often posts with severe content indicating that the user is in acute distress and there is a risk of attempted self-harm. Moderators need to respond to these severe posts in a timely manner to prevent potential self-harm. However, the large volume of daily posted content makes it difficult for the moderators to locate and respond to these critical posts. We present a framework for triaging user content into four severity categories which are defined based on indications of self-harm ideation. Our models are based on a feature-rich classification framework which includes lexical, psycholinguistic, contextual and topic modeling features. Our approaches improve the state of the art in triaging the content severity in mental health forums by large margins (up to 17% improvement over the F-1 scores). Using the proposed model, we analyze the mental state of users and we show that overall, long-term users of the forum demonstrate a decreased severity of risk over time. Our analysis on the interaction of the moderators with the users further indicates that without an automatic way to identify critical content, it is indeed challenging for the moderators to provide timely response to the users in need.}, }
Endnote
%0 Report %A Cohan, Arman %A Young, Sydney %A Yates, Andrew %A Goharian, Nazli %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Triaging Content Severity in Online Mental Health Forums : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-06AF-F %U http://arxiv.org/abs/1702.06875 %D 2017 %X Mental health forums are online communities where people express their issues and seek help from moderators and other users. In such forums, there are often posts with severe content indicating that the user is in acute distress and there is a risk of attempted self-harm. Moderators need to respond to these severe posts in a timely manner to prevent potential self-harm. However, the large volume of daily posted content makes it difficult for the moderators to locate and respond to these critical posts. We present a framework for triaging user content into four severity categories which are defined based on indications of self-harm ideation. Our models are based on a feature-rich classification framework which includes lexical, psycholinguistic, contextual and topic modeling features. Our approaches improve the state of the art in triaging the content severity in mental health forums by large margins (up to 17% improvement over the F-1 scores). Using the proposed model, we analyze the mental state of users and we show that overall, long-term users of the forum demonstrate a decreased severity of risk over time. Our analysis on the interaction of the moderators with the users further indicates that without an automatic way to identify critical content, it is indeed challenging for the moderators to provide timely response to the users in need. %K Computer Science, Computation and Language, cs.CL,Computer Science, Information Retrieval, cs.IR,cs.SI
[17]
C. Costa, G. Chatzimilioudis, D. Zeinalipour-Yazti, and M. F. Mokbel, “Towards Real-Time Road Traffic Analytics using Telco Big Data,” in BIRTE ’17, Eleventh International Workshop on Real-Time Business Intelligence and Analytics, Munich, Germany, 2017.
Export
BibTeX
@inproceedings{birte17traffictbd, TITLE = {Towards Real-Time Road Traffic Analytics using {Telco Big Data}}, AUTHOR = {Costa, Constantinos and Chatzimilioudis, Georgios and Zeinalipour-Yazti, Demetrios and Mokbel, Mohamed F.}, LANGUAGE = {eng}, ISBN = {978-1-4503-5425-7}, DOI = {10.1145/3129292.3129296}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {BIRTE '17, Eleventh International Workshop on Real-Time Business Intelligence and Analytics}, EDITOR = {Chatziantoniou, Damianos and Castellanos, Malu and Chrysanthis, Panos K.}, EID = {5}, ADDRESS = {Munich, Germany}, }
Endnote
%0 Conference Proceedings %A Costa, Constantinos %A Chatzimilioudis, Georgios %A Zeinalipour-Yazti, Demetrios %A Mokbel, Mohamed F. %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Towards Real-Time Road Traffic Analytics using Telco Big Data : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-DDB7-A %R 10.1145/3129292.3129296 %D 2017 %B Eleventh International Workshop on Real-Time Business Intelligence and Analytics %Z date of event: 2017-08-28 - 2017-08-28 %C Munich, Germany %B BIRTE '17 %E Chatziantoniou, Damianos; Castellanos, Malu; Chrysanthis, Panos K. %Z sequence number: 5 %I ACM %@ 978-1-4503-5425-7
[18]
C. Costa, G. Chatzimilioudis, D. Zeinalipour-Yazti, and M. F. Mokbel, “SPATE: Compacting and Exploring Telco Big Data,” in ICDE 2017, 33rd IEEE International Conference on Data Engineering, San Diego, CA, USA, 2017.
Export
BibTeX
@inproceedings{icde17-spate-demo, TITLE = {{SPATE}: Compacting and Exploring Telco Big Data}, AUTHOR = {Costa, Constantinos and Chatzimilioudis, Georgios and Zeinalipour-Yazti, Demetrios and Mokbel, Mohamed F.}, LANGUAGE = {eng}, ISBN = {978-1-5090-6544-8}, DOI = {10.1109/ICDE.2017.203}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {ICDE 2017, 33rd IEEE International Conference on Data Engineering}, PAGES = {1419--1420}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Costa, Constantinos %A Chatzimilioudis, Georgios %A Zeinalipour-Yazti, Demetrios %A Mokbel, Mohamed F. %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T SPATE: Compacting and Exploring Telco Big Data : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-62BA-5 %R 10.1109/ICDE.2017.203 %D 2017 %B 33rd IEEE International Conference on Data Engineering %Z date of event: 2017-04-19 - 2017-04-22 %C San Diego, CA, USA %B ICDE 2017 %P 1419 - 1420 %I IEEE %@ 978-1-5090-6544-8
[19]
C. Costa, G. Chatzimilioudis, D. Zeinalipour-Yazti, and M. F. Mokbel, “Efficient Exploration of Telco Big Data with Compression and Decaying,” in ICDE 2017, 33rd IEEE International Conference on Data Engineering, San Diego, CA, USA, 2017.
Export
BibTeX
@inproceedings{icde17-spate, TITLE = {Efficient Exploration of Telco Big Data with Compression and Decaying}, AUTHOR = {Costa, Constantinos and Chatzimilioudis, Georgios and Zeinalipour-Yazti, Demetrios and Mokbel, Mohamed F.}, LANGUAGE = {eng}, ISBN = {978-1-5090-6544-8}, DOI = {10.1109/ICDE.2017.175}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {ICDE 2017, 33rd IEEE International Conference on Data Engineering}, PAGES = {1332--1343}, ADDRESS = {San Diego, CA, USA}, }
Endnote
%0 Conference Proceedings %A Costa, Constantinos %A Chatzimilioudis, Georgios %A Zeinalipour-Yazti, Demetrios %A Mokbel, Mohamed F. %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Efficient Exploration of Telco Big Data with Compression and Decaying : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-62B3-4 %R 10.1109/ICDE.2017.175 %D 2017 %B 33rd IEEE International Conference on Data Engineering %Z date of event: 2017-04-19 - 2017-04-22 %C San Diego, CA, USA %B ICDE 2017 %P 1332 - 1343 %I IEEE %@ 978-1-5090-6544-8
[20]
S. Das, K. Berberich, D. Klakow, A. Mishra, and V. Setty, “Estimating Event Focus Time with Distributed Representation of Words,” Universität des Saarlandes, Saarbrücken, 2017.
Abstract
Time is an important dimension as it aids in disambiguating and understanding news- worthy events that happened in the past. It helps in chronological ordering of events to understand its causality, evolution, and ramifications. In Information Retrieval, time alongside text is known to improve the quality of search results. So, making use of the temporal dimensionality in the text-based analysis is an interesting idea to explore. Considering the importance of time, methods to automatically resolve temporal foci’s of events are essential. In this thesis, we try to solve this research question by training our models on two different kinds of corpora and then evaluate on a set of historical event-queries.
Export
BibTeX
@mastersthesis{dasmaster17, TITLE = {Estimating Event Focus Time with Distributed Representation of Words}, AUTHOR = {Das, Supratim and Berberich, Klaus and Klakow, Dietrich and Mishra, Arunav and Setty, Vinay}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {Time is an important dimension as it aids in disambiguating and understanding news- worthy events that happened in the past. It helps in chronological ordering of events to understand its causality, evolution, and ramifications. In Information Retrieval, time alongside text is known to improve the quality of search results. So, making use of the temporal dimensionality in the text-based analysis is an interesting idea to explore. Considering the importance of time, methods to automatically resolve temporal foci{\textquoteright}s of events are essential. In this thesis, we try to solve this research question by training our models on two different kinds of corpora and then evaluate on a set of historical event-queries.}, }
Endnote
%0 Thesis %A Das, Supratim %A Berberich, Klaus %A Klakow, Dietrich %A Mishra, Arunav %A Setty, Vinay %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Estimating Event Focus Time with Distributed Representation of Words : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-DFF1-7 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P 83 p. %V master %9 master %X Time is an important dimension as it aids in disambiguating and understanding news- worthy events that happened in the past. It helps in chronological ordering of events to understand its causality, evolution, and ramifications. In Information Retrieval, time alongside text is known to improve the quality of search results. So, making use of the temporal dimensionality in the text-based analysis is an interesting idea to explore. Considering the importance of time, methods to automatically resolve temporal foci’s of events are essential. In this thesis, we try to solve this research question by training our models on two different kinds of corpora and then evaluate on a set of historical event-queries.
[21]
S. Degaetano-Ortlieb and J. Strötgen, “Diachronic Variation of Temporal Expressions in Scientific Writing through the Lens of Relative Entropy,” in Proceedings of the Conference of the German Society for Computational Linguistics and Language Technology (GSCL 2017), Berlin, Germany. (Accepted/in press)
Export
BibTeX
@inproceedings{DegaetanoortliebStroetgen2017, TITLE = {Diachronic Variation of Temporal Expressions in Scientific Writing through the Lens of Relative Entropy}, AUTHOR = {Degaetano-Ortlieb, Stefania and Str{\"o}tgen, Jannik}, LANGUAGE = {eng}, YEAR = {2017}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Proceedings of the Conference of the German Society for Computational Linguistics and Language Technology (GSCL 2017)}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Degaetano-Ortlieb, Stefania %A Strötgen, Jannik %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Diachronic Variation of Temporal Expressions in Scientific Writing through the Lens of Relative Entropy : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-A8E8-5 %D 2017 %B Proceedings of the Conference of the German Society for Computational Linguistics and Language Technology %Z date of event: 2017-09-13 - 2017-09-14 %C Berlin, Germany %B Proceedings of the Conference of the German Society for Computational Linguistics and Language Technology
[22]
S. Dutta, “Efficient knowledge Management for Named Entities from Text,” Universität des Saarlandes, Saarbrücken, 2017.
Abstract
The evolution of search from keywords to entities has necessitated the efficient harvesting and management of entity-centric information for constructing knowledge bases catering to various applications such as semantic search, question answering, and information retrieval. The vast amounts of natural language texts available across diverse domains on the Web provide rich sources for discovering facts about named entities such as people, places, and organizations. A key challenge, in this regard, entails the need for precise identification and disambiguation of entities across documents for extraction of attributes/relations and their proper representation in knowledge bases. Additionally, the applicability of such repositories not only involves the quality and accuracy of the stored information, but also storage management and query processing efficiency. This dissertation aims to tackle the above problems by presenting efficient approaches for entity-centric knowledge acquisition from texts and its representation in knowledge repositories. This dissertation presents a robust approach for identifying text phrases pertaining to the same named entity across huge corpora, and their disambiguation to canonical entities present in a knowledge base, by using enriched semantic contexts and link validation encapsulated in a hierarchical clustering framework. This work further presents language and consistency features for classification models to compute the credibility of obtained textual facts, ensuring quality of the extracted information. Finally, an encoding algorithm, using frequent term detection and improved data locality, to represent entities for enhanced knowledge base storage and query performance is presented.
Export
BibTeX
@phdthesis{duttaphd17, TITLE = {Efficient knowledge Management for Named Entities from Text}, AUTHOR = {Dutta, Sourav}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-67924}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {The evolution of search from keywords to entities has necessitated the efficient harvesting and management of entity-centric information for constructing knowledge bases catering to various applications such as semantic search, question answering, and information retrieval. The vast amounts of natural language texts available across diverse domains on the Web provide rich sources for discovering facts about named entities such as people, places, and organizations. A key challenge, in this regard, entails the need for precise identification and disambiguation of entities across documents for extraction of attributes/relations and their proper representation in knowledge bases. Additionally, the applicability of such repositories not only involves the quality and accuracy of the stored information, but also storage management and query processing efficiency. This dissertation aims to tackle the above problems by presenting efficient approaches for entity-centric knowledge acquisition from texts and its representation in knowledge repositories. This dissertation presents a robust approach for identifying text phrases pertaining to the same named entity across huge corpora, and their disambiguation to canonical entities present in a knowledge base, by using enriched semantic contexts and link validation encapsulated in a hierarchical clustering framework. This work further presents language and consistency features for classification models to compute the credibility of obtained textual facts, ensuring quality of the extracted information. Finally, an encoding algorithm, using frequent term detection and improved data locality, to represent entities for enhanced knowledge base storage and query performance is presented.}, }
Endnote
%0 Thesis %A Dutta, Sourav %Y Weikum, Gerhard %A referee: Nejdl, Wolfgang %A referee: Berberich, Klaus %+ Databases and Information Systems, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Efficient knowledge Management for Named Entities from Text : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-A793-E %U urn:nbn:de:bsz:291-scidok-67924 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P xv, 134 p. %V phd %9 phd %X The evolution of search from keywords to entities has necessitated the efficient harvesting and management of entity-centric information for constructing knowledge bases catering to various applications such as semantic search, question answering, and information retrieval. The vast amounts of natural language texts available across diverse domains on the Web provide rich sources for discovering facts about named entities such as people, places, and organizations. A key challenge, in this regard, entails the need for precise identification and disambiguation of entities across documents for extraction of attributes/relations and their proper representation in knowledge bases. Additionally, the applicability of such repositories not only involves the quality and accuracy of the stored information, but also storage management and query processing efficiency. This dissertation aims to tackle the above problems by presenting efficient approaches for entity-centric knowledge acquisition from texts and its representation in knowledge repositories. This dissertation presents a robust approach for identifying text phrases pertaining to the same named entity across huge corpora, and their disambiguation to canonical entities present in a knowledge base, by using enriched semantic contexts and link validation encapsulated in a hierarchical clustering framework. This work further presents language and consistency features for classification models to compute the credibility of obtained textual facts, ensuring quality of the extracted information. Finally, an encoding algorithm, using frequent term detection and improved data locality, to represent entities for enhanced knowledge base storage and query performance is presented. %U http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=dehttp://scidok.sulb.uni-saarland.de/volltexte/2017/6792/
[23]
S. Eslami, “Utility-preserving Profile Removal in Online Forums,” Universität des Saarlandes, Saarbrücken, 2017.
Export
BibTeX
@mastersthesis{EslamiMSc2017, TITLE = {Utility-preserving Profile Removal in Online Forums}, AUTHOR = {Eslami, Sedigheh}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, }
Endnote
%0 Thesis %A Eslami, Sedigheh %Y Weikum, Gerhard %A referee: Roy, Rishiraj Saha %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Utility-preserving Profile Removal in Online Forums : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-9236-4 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P XII, 66 p. %V master %9 master
[24]
E. Galbrun and P. Miettinen, “Analysing Political Opinions Using Redescription Mining,” in 16th IEEE International Conference on Data Mining Workshops (ICDMW 2016), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{galbrun16analysing, TITLE = {Analysing Political Opinions Using Redescription Mining}, AUTHOR = {Galbrun, Esther and Miettinen, Pauli}, LANGUAGE = {eng}, ISBN = {978-1-5090-5910-2}, DOI = {10.1109/ICDMW.2016.121}, PUBLISHER = {IEEE}, YEAR = {2015}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {16th IEEE International Conference on Data Mining Workshops (ICDMW 2016)}, EDITOR = {Domeniconi, Carlotta and Gullo, Francesco and Bonchi, Francesco and Domingo-Ferrer, Josep and Baeza-Yates, Ricardo and Zhou, Zhi-Hua and Wu, Xindong}, PAGES = {422--427}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Galbrun, Esther %A Miettinen, Pauli %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Analysing Political Opinions Using Redescription Mining : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-2247-5 %R 10.1109/ICDMW.2016.121 %D 2017 %8 02.02.2017 %B 16th International Conference on Data Mining %Z date of event: 2015-12-12 - 2015-12-15 %C Barcelona, Spain %B 16th IEEE International Conference on Data Mining Workshops %E Domeniconi, Carlotta; Gullo, Francesco; Bonchi, Francesco; Domingo-Ferrer, Josep; Baeza-Yates, Ricardo; Zhou, Zhi-Hua; Wu, Xindong %P 422 - 427 %I IEEE %@ 978-1-5090-5910-2
[25]
K. Gashteovski, R. Gemulla, and L. Del Corro, “MinIE: Minimizing Facts in Open Information Extraction,” in The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017), Copenhagen, Denmark, 2017.
Export
BibTeX
@inproceedings{DBLP:conf/emnlp/GashteovskiGC17, TITLE = {{MinIE}: {M}inimizing Facts in Open Information Extraction}, AUTHOR = {Gashteovski, Kiril and Gemulla, Rainer and Del Corro, Luciano}, LANGUAGE = {eng}, ISBN = {978-1-945626-83-8}, URL = {http://aclanthology.info/papers/D17-1277/d17-1277}, PUBLISHER = {ACL}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017)}, PAGES = {2620--2630}, ADDRESS = {Copenhagen, Denmark}, }
Endnote
%0 Conference Proceedings %A Gashteovski, Kiril %A Gemulla, Rainer %A Del Corro, Luciano %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T MinIE: Minimizing Facts in Open Information Extraction : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-30F4-2 %U http://aclanthology.info/papers/D17-1277/d17-1277 %D 2017 %B Conference on Empirical Methods in Natural Language Processing %Z date of event: 2017-09-09 - 2017-09-11 %C Copenhagen, Denmark %B The Conference on Empirical Methods in Natural Language Processing %P 2620 - 2630 %I ACL %@ 978-1-945626-83-8 %U http://www.aclweb.org/anthology/D17-1277
[26]
X. Ge, A. Daphalapurkar, M. Shmipi, K. Darpun, K. Pelechrinis, P. K. Chrysanthis, and D. Zeinalipour-Yazti, “Data-driven Serendipity Navigation in Urban Places,” in IEEE 37th International Conference on Distributed Computing Systems (ICDCS 2017), Atlanta, GA, USA, 2017.
Export
BibTeX
@inproceedings{icdcs17-serendipity-demo, TITLE = {Data-driven Serendipity Navigation in Urban Places}, AUTHOR = {Ge, Xiaoyi and Daphalapurkar, Ameya and Shmipi, Manali and Darpun, Kohli and Pelechrinis, Konstantinos and Chrysanthis, Panos K. and Zeinalipour-Yazti, Demetrios}, LANGUAGE = {eng}, ISBN = {978-1-5386-1792-2}, DOI = {10.1109/ICDCS.2017.286}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {IEEE 37th International Conference on Distributed Computing Systems (ICDCS 2017)}, EDITOR = {Lee, Kisung and Liu, Ling}, PAGES = {2501--2504}, ADDRESS = {Atlanta, GA, USA}, }
Endnote
%0 Conference Proceedings %A Ge, Xiaoyi %A Daphalapurkar, Ameya %A Shmipi, Manali %A Darpun, Kohli %A Pelechrinis, Konstantinos %A Chrysanthis, Panos K. %A Zeinalipour-Yazti, Demetrios %+ External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Data-driven Serendipity Navigation in Urban Places : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-082B-7 %R 10.1109/ICDCS.2017.286 %D 2017 %B 37th IEEE International Conference on Distributed Computing Systems %Z date of event: 2017-06-05 - 2017-06-08 %C Atlanta, GA, USA %B IEEE 37th International Conference on Distributed Computing Systems %E Lee, Kisung; Liu, Ling %P 2501 - 2504 %I IEEE %@ 978-1-5386-1792-2
[27]
B. Goldsmith, M. Boley, J. Vreeken, M. Scheffler, and L. Ghiringhelli,, “Uncovering Structure-property Relationships of Materials by Subgroup Discovery,” New Journal of Physics, vol. 19, no. 1, 2017.
Export
BibTeX
@article{goldsmith:17:gold, TITLE = {Uncovering Structure-property Relationships of Materials by Subgroup Discovery}, AUTHOR = {Goldsmith, Brian and Boley, Mario and Vreeken, Jilles and Scheffler, Matthias and Ghiringhelli,, Luca}, LANGUAGE = {eng}, ISSN = {1367-2630}, DOI = {10.1088/1367-2630/aa57c2}, PUBLISHER = {IOP Publishing}, ADDRESS = {Bristol}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, JOURNAL = {New Journal of Physics}, VOLUME = {19}, NUMBER = {1}, EID = {013031}, }
Endnote
%0 Journal Article %A Goldsmith, Brian %A Boley, Mario %A Vreeken, Jilles %A Scheffler, Matthias %A Ghiringhelli,, Luca %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Uncovering Structure-property Relationships of Materials by Subgroup Discovery : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4BF5-4 %R 10.1088/1367-2630/aa57c2 %7 2017 %D 2017 %J New Journal of Physics %O New J. Phys. %V 19 %N 1 %Z sequence number: 013031 %I IOP Publishing %C Bristol %@ false %U http://iopscience.iop.org/article/10.1088/1367-2630/aa57c2
[28]
A. Grycner, “Constructing Lexicons of Relational Phrases,” Universität des Saarlandes, Saarbrücken, 2017.
Abstract
Knowledge Bases are one of the key components of Natural Language Understanding systems. For example, DBpedia, YAGO, and Wikidata capture and organize knowledge about named entities and relations between them, which is often crucial for tasks like Question Answering and Named Entity Disambiguation. While Knowledge Bases have good coverage of prominent entities, they are often limited with respect to relations. The goal of this thesis is to bridge this gap and automatically create lexicons of textual representations of relations, namely relational phrases. The lexicons should contain information about paraphrases, hierarchy, as well as semantic types of arguments of relational phrases. The thesis makes three main contributions. The first contribution addresses disambiguating relational phrases by aligning them with the WordNet dictionary. Moreover, the alignment allows imposing the WordNet hierarchy on the relational phrases. The second contribution proposes a method for graph construction of relations using Probabilistic Graphical Models. In addition, we apply this model to relation paraphrasing. The third contribution presents a method for constructing a lexicon of relational paraphrases with fine-grained semantic typing of arguments. This method is based on information from a multilingual parallel corpus.
Export
BibTeX
@phdthesis{Grynerphd17, TITLE = {Constructing Lexicons of Relational Phrases}, AUTHOR = {Grycner, Adam}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-69101}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {Knowledge Bases are one of the key components of Natural Language Understanding systems. For example, DBpedia, YAGO, and Wikidata capture and organize knowledge about named entities and relations between them, which is often crucial for tasks like Question Answering and Named Entity Disambiguation. While Knowledge Bases have good coverage of prominent entities, they are often limited with respect to relations. The goal of this thesis is to bridge this gap and automatically create lexicons of textual representations of relations, namely relational phrases. The lexicons should contain information about paraphrases, hierarchy, as well as semantic types of arguments of relational phrases. The thesis makes three main contributions. The first contribution addresses disambiguating relational phrases by aligning them with the WordNet dictionary. Moreover, the alignment allows imposing the WordNet hierarchy on the relational phrases. The second contribution proposes a method for graph construction of relations using Probabilistic Graphical Models. In addition, we apply this model to relation paraphrasing. The third contribution presents a method for constructing a lexicon of relational paraphrases with fine-grained semantic typing of arguments. This method is based on information from a multilingual parallel corpus.}, }
Endnote
%0 Thesis %A Grycner, Adam %Y Weikum, Gerhard %A referee: Klakow, Dietrich %A referee: Ponzetto, Simone Paolo %+ Databases and Information Systems, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Constructing Lexicons of Relational Phrases : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-933B-1 %U urn:nbn:de:bsz:291-scidok-69101 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P 125 p. %V phd %9 phd %X Knowledge Bases are one of the key components of Natural Language Understanding systems. For example, DBpedia, YAGO, and Wikidata capture and organize knowledge about named entities and relations between them, which is often crucial for tasks like Question Answering and Named Entity Disambiguation. While Knowledge Bases have good coverage of prominent entities, they are often limited with respect to relations. The goal of this thesis is to bridge this gap and automatically create lexicons of textual representations of relations, namely relational phrases. The lexicons should contain information about paraphrases, hierarchy, as well as semantic types of arguments of relational phrases. The thesis makes three main contributions. The first contribution addresses disambiguating relational phrases by aligning them with the WordNet dictionary. Moreover, the alignment allows imposing the WordNet hierarchy on the relational phrases. The second contribution proposes a method for graph construction of relations using Probabilistic Graphical Models. In addition, we apply this model to relation paraphrasing. The third contribution presents a method for constructing a lexicon of relational paraphrases with fine-grained semantic typing of arguments. This method is based on information from a multilingual parallel corpus. %U http://scidok.sulb.uni-saarland.de/volltexte/2017/6910/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[29]
D. Gupta, K. Berberich, J. Strötgen, and D. Zeinalipour-Yazti, “Generating Semantic Aspects for Queries,” Max-Planck-Institut für Informatik, Saarbrücken, MPI–I–2017–5-001, 2017.
Abstract
Ambiguous information needs expressed in a limited number of keywords often result in long-winded query sessions and many query reformulations. In this work, we tackle ambiguous queries by providing automatically gen- erated semantic aspects that can guide users to satisfying results regarding their information needs. To generate semantic aspects, we use semantic an- notations available in the documents and leverage models representing the semantic relationships between annotations of the same type. The aspects in turn provide us a foundation for representing text in a completely structured manner, thereby allowing for a semantically-motivated organization of search results. We evaluate our approach on a testbed of over 5,000 aspects on Web scale document collections amounting to more than 450 million documents, with temporal, geographic, and named entity annotations as example dimen- sions. Our experimental results show that our general approach is Web-scale ready and finds relevant aspects for highly ambiguous queries.
Export
BibTeX
@techreport{Guptareport2007, TITLE = {Generating Semantic Aspects for Queries}, AUTHOR = {Gupta, Dhruv and Berberich, Klaus and Str{\"o}tgen, Jannik and Zeinalipour-Yazti, Demetrios}, LANGUAGE = {eng}, ISSN = {0946-011X}, NUMBER = {MPI–I–2017–5-001}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Ambiguous information needs expressed in a limited number of keywords often result in long-winded query sessions and many query reformulations. In this work, we tackle ambiguous queries by providing automatically gen- erated semantic aspects that can guide users to satisfying results regarding their information needs. To generate semantic aspects, we use semantic an- notations available in the documents and leverage models representing the semantic relationships between annotations of the same type. The aspects in turn provide us a foundation for representing text in a completely structured manner, thereby allowing for a semantically-motivated organization of search results. We evaluate our approach on a testbed of over 5,000 aspects on Web scale document collections amounting to more than 450 million documents, with temporal, geographic, and named entity annotations as example dimen- sions. Our experimental results show that our general approach is Web-scale ready and finds relevant aspects for highly ambiguous queries.}, TYPE = {Research Report}, }
Endnote
%0 Report %A Gupta, Dhruv %A Berberich, Klaus %A Strötgen, Jannik %A Zeinalipour-Yazti, Demetrios %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Generating Semantic Aspects for Queries : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-07DD-0 %Y Max-Planck-Institut für Informatik %C Saarbrücken %D 2017 %P 39 p. %X Ambiguous information needs expressed in a limited number of keywords often result in long-winded query sessions and many query reformulations. In this work, we tackle ambiguous queries by providing automatically gen- erated semantic aspects that can guide users to satisfying results regarding their information needs. To generate semantic aspects, we use semantic an- notations available in the documents and leverage models representing the semantic relationships between annotations of the same type. The aspects in turn provide us a foundation for representing text in a completely structured manner, thereby allowing for a semantically-motivated organization of search results. We evaluate our approach on a testbed of over 5,000 aspects on Web scale document collections amounting to more than 450 million documents, with temporal, geographic, and named entity annotations as example dimen- sions. Our experimental results show that our general approach is Web-scale ready and finds relevant aspects for highly ambiguous queries. %B Research Report %@ false
[30]
S. Gurajada, “Distributed Querying of Large Labeled Graphs,” Universität des Saarlandes, Saarbrücken, 2017.
Abstract
Graph is a vital abstract data type that has profound significance in several applications. Because of its versitality, graphs have been adapted into several different forms and one such adaption with many practical applications is the “Labeled Graph”, where vertices and edges are labeled. An enormous research effort has been invested in to the task of managing and querying graphs, yet a lot challenges are left unsolved. In this thesis, we advance the state-of-the-art for the following query models, and propose a distributed solution to process them in an efficient and scalable manner. • Set Reachability. We formalize and investigate a generalization of the basic notion of reachability, called set reachability. Set reachability deals with finding all reachable pairs for a given source and target sets. We present a non-iterative distributed solution that takes only a single round of communication for any set reachability query. This is achieved by precomputation, replication, and indexing of partial reachabilities among the boundary vertices. • Basic Graph Patterns (BGP). Supported by majority of query languages, BGP queries are a common mode of querying knowledge graphs, biological datasets, etc. We present a novel distributed architecture that relies on the concepts of asynchronous executions, join-ahead pruning, and a multi-threaded query processing framework to process BGP queries in an efficient and scalable manner. • Generalized Graph Patterns (GGP). These queries combine the semantics of pattern matching and navigational queries, and are popular in scenarios where the schema of an underlying graph is either unknown or partially known. We present a distributed solution with bimodal indexing layout that individually support efficient processing of BGP queries and navigational queries. Furthermore, we design a unified query optimizer and a processor to efficiently process GGP queries and also in a scalable manner. To this end, we propose a prototype distributed engine, coined “TriAD” (Triple Asynchronous and Distributed) that supports all the aforementioned query models. We also provide a detailed empirical evaluation of TriAD in comparison to several state-of-the-art systems over multiple real-world and synthetic datasets.
Export
BibTeX
@phdthesis{guraphd2017, TITLE = {Distributed Querying of Large Labeled Graphs}, AUTHOR = {Gurajada, Sairam}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-67738}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {Graph is a vital abstract data type that has profound significance in several applications. Because of its versitality, graphs have been adapted into several different forms and one such adaption with many practical applications is the {\textquotedblleft}Labeled Graph{\textquotedblright}, where vertices and edges are labeled. An enormous research effort has been invested in to the task of managing and querying graphs, yet a lot challenges are left unsolved. In this thesis, we advance the state-of-the-art for the following query models, and propose a distributed solution to process them in an efficient and scalable manner. \mbox{$\bullet$} Set Reachability. We formalize and investigate a generalization of the basic notion of reachability, called set reachability. Set reachability deals with finding all reachable pairs for a given source and target sets. We present a non-iterative distributed solution that takes only a single round of communication for any set reachability query. This is achieved by precomputation, replication, and indexing of partial reachabilities among the boundary vertices. \mbox{$\bullet$} Basic Graph Patterns (BGP). Supported by majority of query languages, BGP queries are a common mode of querying knowledge graphs, biological datasets, etc. We present a novel distributed architecture that relies on the concepts of asynchronous executions, join-ahead pruning, and a multi-threaded query processing framework to process BGP queries in an efficient and scalable manner. \mbox{$\bullet$} Generalized Graph Patterns (GGP). These queries combine the semantics of pattern matching and navigational queries, and are popular in scenarios where the schema of an underlying graph is either unknown or partially known. We present a distributed solution with bimodal indexing layout that individually support efficient processing of BGP queries and navigational queries. Furthermore, we design a unified query optimizer and a processor to efficiently process GGP queries and also in a scalable manner. To this end, we propose a prototype distributed engine, coined {\textquotedblleft}TriAD{\textquotedblright} (Triple Asynchronous and Distributed) that supports all the aforementioned query models. We also provide a detailed empirical evaluation of TriAD in comparison to several state-of-the-art systems over multiple real-world and synthetic datasets.}, }
Endnote
%0 Thesis %A Gurajada, Sairam %Y Theobald, Martin %A referee: Weikum, Gerhard %A referee: Özsu, M. Tamer %A referee: Michel, Sebastian %+ Databases and Information Systems, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Distributed Querying of Large Labeled Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-8202-E %U urn:nbn:de:bsz:291-scidok-67738 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P x, 167 p. %V phd %9 phd %X Graph is a vital abstract data type that has profound significance in several applications. Because of its versitality, graphs have been adapted into several different forms and one such adaption with many practical applications is the “Labeled Graph”, where vertices and edges are labeled. An enormous research effort has been invested in to the task of managing and querying graphs, yet a lot challenges are left unsolved. In this thesis, we advance the state-of-the-art for the following query models, and propose a distributed solution to process them in an efficient and scalable manner. • Set Reachability. We formalize and investigate a generalization of the basic notion of reachability, called set reachability. Set reachability deals with finding all reachable pairs for a given source and target sets. We present a non-iterative distributed solution that takes only a single round of communication for any set reachability query. This is achieved by precomputation, replication, and indexing of partial reachabilities among the boundary vertices. • Basic Graph Patterns (BGP). Supported by majority of query languages, BGP queries are a common mode of querying knowledge graphs, biological datasets, etc. We present a novel distributed architecture that relies on the concepts of asynchronous executions, join-ahead pruning, and a multi-threaded query processing framework to process BGP queries in an efficient and scalable manner. • Generalized Graph Patterns (GGP). These queries combine the semantics of pattern matching and navigational queries, and are popular in scenarios where the schema of an underlying graph is either unknown or partially known. We present a distributed solution with bimodal indexing layout that individually support efficient processing of BGP queries and navigational queries. Furthermore, we design a unified query optimizer and a processor to efficiently process GGP queries and also in a scalable manner. To this end, we propose a prototype distributed engine, coined “TriAD” (Triple Asynchronous and Distributed) that supports all the aforementioned query models. We also provide a detailed empirical evaluation of TriAD in comparison to several state-of-the-art systems over multiple real-world and synthetic datasets. %U http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=dehttp://scidok.sulb.uni-saarland.de/volltexte/2017/6773/
[31]
K. Hui and K. Berberich, “Merge-Tie-Judge: Low-Cost Preference Judgments with Ties,” in ICTIR’17, 7th International Conference on the Theory of Information Retrieval, Amsterdam, The Netherlands, 2017.
Export
BibTeX
@inproceedings{HuiICTIR2017b, TITLE = {{Merge-Tie-Judge}: Low-Cost Preference Judgments with Ties}, AUTHOR = {Hui, Kai and Berberich, Klaus}, LANGUAGE = {eng}, ISBN = {978-1-4503-4490-6}, DOI = {10.1145/3121050.3121095}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {ICTIR'17, 7th International Conference on the Theory of Information Retrieval}, PAGES = {277--280}, ADDRESS = {Amsterdam, The Netherlands}, }
Endnote
%0 Conference Proceedings %A Hui, Kai %A Berberich, Klaus %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Merge-Tie-Judge: Low-Cost Preference Judgments with Ties : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-064B-2 %R 10.1145/3121050.3121095 %D 2017 %B 7th International Conference on the Theory of Information Retrieval %Z date of event: 2017-10-01 - 2017-10-04 %C Amsterdam, The Netherlands %B ICTIR'17 %P 277 - 280 %I ACM %@ 978-1-4503-4490-6
[32]
K. Hui, K. Berberich, and I. Mele, “Dealing with Incomplete Judgments in Cascade Measures,” in ICTIR’17, 7th International Conference on the Theory of Information Retrieval, Amsterdam, The Netherlands, 2017.
Export
BibTeX
@inproceedings{HuiICTIR2017, TITLE = {Dealing with Incomplete Judgments in Cascade Measures}, AUTHOR = {Hui, Kai and Berberich, Klaus and Mele, Ida}, LANGUAGE = {eng}, ISBN = {978-1-4503-4490-6}, DOI = {10.1145/3121050.3121064}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {ICTIR'17, 7th International Conference on the Theory of Information Retrieval}, PAGES = {83--90}, ADDRESS = {Amsterdam, The Netherlands}, }
Endnote
%0 Conference Proceedings %A Hui, Kai %A Berberich, Klaus %A Mele, Ida %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Dealing with Incomplete Judgments in Cascade Measures : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-0649-6 %R 10.1145/3121050.3121064 %D 2017 %B 7th International Conference on the Theory of Information Retrieval %Z date of event: 2017-10-01 - 2017-10-04 %C Amsterdam, The Netherlands %B ICTIR'17 %P 83 - 90 %I ACM %@ 978-1-4503-4490-6
[33]
K. Hui and K. Berberich, “Low-Cost Preference Judgment via Ties,” in Advances in Information Retrieval (ECIR 2017), Aberdeen, UK, 2017.
Export
BibTeX
@inproceedings{hui2017short, TITLE = {Low-Cost Preference Judgment via Ties}, AUTHOR = {Hui, Kai and Berberich, Klaus}, LANGUAGE = {eng}, ISBN = {978-3-319-56607-8}, DOI = {10.1007/978-3-319-56608-5_58}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Advances in Information Retrieval (ECIR 2017)}, EDITOR = {Jose, Joemon M. and Hauff, Claudia and Altingovde, Ismail Sengor and Song, Dawei and Albakour, Dyaa and Watt, Stuart and Tait, John}, PAGES = {626--632}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10193}, ADDRESS = {Aberdeen, UK}, }
Endnote
%0 Conference Proceedings %A Hui, Kai %A Berberich, Klaus %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Low-Cost Preference Judgment via Ties : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-1F7B-A %R 10.1007/978-3-319-56608-5_58 %D 2017 %B 39th European Conference on Information Retrieval %Z date of event: 2017-04-09 - 2017-04-13 %C Aberdeen, UK %B Advances in Information Retrieval %E Jose, Joemon M.; Hauff, Claudia; Altingovde, Ismail Sengor; Song, Dawei; Albakour, Dyaa; Watt, Stuart; Tait, John %P 626 - 632 %I Springer %@ 978-3-319-56607-8 %B Lecture Notes in Computer Science %N 10193
[34]
K. Hui and K. Berberich, “Transitivity, Time Consumption, and Quality of Preference Judgments in Crowdsourcing,” in Advances in Information Retrieval (ECIR 2017), Aberdeen, UK, 2017.
Export
BibTeX
@inproceedings{hui2017full, TITLE = {Transitivity, Time Consumption, and Quality of Preference Judgments in Crowdsourcing}, AUTHOR = {Hui, Kai and Berberich, Klaus}, LANGUAGE = {eng}, ISBN = {978-3-319-56607-8}, DOI = {10.1007/978-3-319-56608-5_19}, PUBLISHER = {Springer}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Advances in Information Retrieval (ECIR 2017)}, EDITOR = {Jose, Joemon M. and Hauff, Claudia and Altingovde, Ismail Sengor and Song, Dawei and Albakour, Dyaa and Watt, Stuart and Tait, John}, PAGES = {239--251}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10193}, ADDRESS = {Aberdeen, UK}, }
Endnote
%0 Conference Proceedings %A Hui, Kai %A Berberich, Klaus %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Transitivity, Time Consumption, and Quality of Preference Judgments in Crowdsourcing : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-1F75-5 %R 10.1007/978-3-319-56608-5_19 %D 2017 %B 39th European Conference on Information Retrieval %Z date of event: 2016-04-09 - 2017-04-13 %C Aberdeen, UK %B Advances in Information Retrieval %E Jose, Joemon M.; Hauff, Claudia; Altingovde, Ismail Sengor; Song, Dawei; Albakour, Dyaa; Watt, Stuart; Tait, John %P 239 - 251 %I Springer %@ 978-3-319-56607-8 %B Lecture Notes in Computer Science %N 10193
[35]
K. Hui, A. Yates, K. Berberich, and G. de Melo, “PACRR: A Position-Aware Neural IR Model for Relevance Matching,” 2017. [Online]. Available: http://arxiv.org/abs/1704.03940. (arXiv: 1704.03940)
Abstract
In order to adopt deep learning for information retrieval, models are needed that can capture all relevant information required to assess the relevance of a document to a given user query. While previous works have successfully captured unigram term matches, how to fully employ position-dependent information such as proximity and term dependencies has been insufficiently explored. In this work, we propose a novel neural IR model named PACRR (Position-Aware Convolutional-Recurrent Relevance), aiming at better modeling position-dependent interactions between a query and a document via convolutional layers as well as recurrent layers. Extensive experiments on six years' TREC Web Track data confirm that the proposed model yields better results under different benchmarks.
Export
BibTeX
@online{DBLP:journals/corr/HuiYBM17, TITLE = {{PACRR}: A Position-Aware Neural {IR} Model for Relevance Matching}, AUTHOR = {Hui, Kai and Yates, Andrew and Berberich, Klaus and de Melo, Gerard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1704.03940}, EPRINT = {1704.03940}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In order to adopt deep learning for information retrieval, models are needed that can capture all relevant information required to assess the relevance of a document to a given user query. While previous works have successfully captured unigram term matches, how to fully employ position-dependent information such as proximity and term dependencies has been insufficiently explored. In this work, we propose a novel neural IR model named PACRR (Position-Aware Convolutional-Recurrent Relevance), aiming at better modeling position-dependent interactions between a query and a document via convolutional layers as well as recurrent layers. Extensive experiments on six years' TREC Web Track data confirm that the proposed model yields better results under different benchmarks.}, }
Endnote
%0 Report %A Hui, Kai %A Yates, Andrew %A Berberich, Klaus %A de Melo, Gerard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T PACRR: A Position-Aware Neural IR Model for Relevance Matching : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90A8-3 %U http://arxiv.org/abs/1704.03940 %D 2017 %X In order to adopt deep learning for information retrieval, models are needed that can capture all relevant information required to assess the relevance of a document to a given user query. While previous works have successfully captured unigram term matches, how to fully employ position-dependent information such as proximity and term dependencies has been insufficiently explored. In this work, we propose a novel neural IR model named PACRR (Position-Aware Convolutional-Recurrent Relevance), aiming at better modeling position-dependent interactions between a query and a document via convolutional layers as well as recurrent layers. Extensive experiments on six years' TREC Web Track data confirm that the proposed model yields better results under different benchmarks. %K Computer Science, Information Retrieval, cs.IR,Computer Science, Computation and Language, cs.CL
[36]
K. Hui, A. Yates, K. Berberich, and G. de Melo, “PACRR: A Position-Aware Neural IR Model for Relevance Matching,” in The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017), Copenhagen, Denmark, 2017.
Export
BibTeX
@inproceedings{HuiENMLP2017, TITLE = {{PACRR}: A Position-Aware Neural {IR} Model for Relevance Matching}, AUTHOR = {Hui, Kai and Yates, Andrew and Berberich, Klaus and de Melo, Gerard}, LANGUAGE = {eng}, ISBN = {978-1-945626-83-8}, URL = {https://aclanthology.info/pdf/D/D17/D17-1111.pdf}, PUBLISHER = {ACL}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017)}, PAGES = {1060--1069}, ADDRESS = {Copenhagen, Denmark}, }
Endnote
%0 Conference Proceedings %A Hui, Kai %A Yates, Andrew %A Berberich, Klaus %A de Melo, Gerard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T PACRR: A Position-Aware Neural IR Model for Relevance Matching : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-063F-D %U https://aclanthology.info/pdf/D/D17/D17-1111.pdf %D 2017 %B Conference on Empirical Methods in Natural Language Processing %Z date of event: 2017-09-09 - 2017-09-11 %C Copenhagen, Denmark %B The Conference on Empirical Methods in Natural Language Processing %P 1060 - 1069 %I ACL %@ 978-1-945626-83-8 %U https://aclanthology.info/pdf/D/D17/D17-1111.pdf
[37]
K. Hui, A. Yates, K. Berberich, and G. de Melo, “RE-PACRR: A Context and Density-Aware Neural Information Retrieval Model,” 2017. [Online]. Available: http://arxiv.org/abs/1706.10192. (arXiv: 1706.10192)
Abstract
Ad-hoc retrieval models can benefit from considering different patterns in the interactions between a query and a document, effectively assessing the relevance of a document for a given user query. Factors to be considered in this interaction include (i) the matching of unigrams and ngrams, (ii) the proximity of the matched query terms, (iii) their position in the document, and (iv) how the different relevance signals are combined over different query terms. While previous work has successfully modeled some of these factors, not all aspects have been fully explored. In this work, we close this gap by proposing different neural components and incorporating them into a single architecture, leading to a novel neural IR model called RE-PACRR. Extensive comparisons with established models on TREC Web Track data confirm that the proposed model yields promising search results.
Export
BibTeX
@online{HuiarXiv2017b, TITLE = {{RE-PACRR}: {A} Context and Density-Aware Neural Information Retrieval Model}, AUTHOR = {Hui, Kai and Yates, Andrew and Berberich, Klaus and de Melo, Gerard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1706.10192}, EPRINT = {1706.10192}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Ad-hoc retrieval models can benefit from considering different patterns in the interactions between a query and a document, effectively assessing the relevance of a document for a given user query. Factors to be considered in this interaction include (i) the matching of unigrams and ngrams, (ii) the proximity of the matched query terms, (iii) their position in the document, and (iv) how the different relevance signals are combined over different query terms. While previous work has successfully modeled some of these factors, not all aspects have been fully explored. In this work, we close this gap by proposing different neural components and incorporating them into a single architecture, leading to a novel neural IR model called RE-PACRR. Extensive comparisons with established models on TREC Web Track data confirm that the proposed model yields promising search results.}, }
Endnote
%0 Report %A Hui, Kai %A Yates, Andrew %A Berberich, Klaus %A de Melo, Gerard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T RE-PACRR: A Context and Density-Aware Neural Information Retrieval Model : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-064D-D %U http://arxiv.org/abs/1706.10192 %D 2017 %X Ad-hoc retrieval models can benefit from considering different patterns in the interactions between a query and a document, effectively assessing the relevance of a document for a given user query. Factors to be considered in this interaction include (i) the matching of unigrams and ngrams, (ii) the proximity of the matched query terms, (iii) their position in the document, and (iv) how the different relevance signals are combined over different query terms. While previous work has successfully modeled some of these factors, not all aspects have been fully explored. In this work, we close this gap by proposing different neural components and incorporating them into a single architecture, leading to a novel neural IR model called RE-PACRR. Extensive comparisons with established models on TREC Web Track data confirm that the proposed model yields promising search results. %K Computer Science, Information Retrieval, cs.IR,Computer Science, Computation and Language, cs.CL
[38]
K. Hui, A. Yates, K. Berberich, and G. de Melo, “Position-Aware Representations for Relevance Matching in Neural Information Retrieval,” in WWW’17 Companion, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{HuiWWW2017, TITLE = {Position-Aware Representations for Relevance Matching in Neural Information Retrieval}, AUTHOR = {Hui, Kai and Yates, Andrew and Berberich, Klaus and de Melo, Gerard}, LANGUAGE = {eng}, ISBN = {978-1-4503-4914-7}, DOI = {10.1145/3041021.3054258}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17 Companion}, PAGES = {799--800}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Hui, Kai %A Yates, Andrew %A Berberich, Klaus %A de Melo, Gerard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Position-Aware Representations for Relevance Matching in Neural Information Retrieval : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90A4-B %R 10.1145/3041021.3054258 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 Companion %P 799 - 800 %I ACM %@ 978-1-4503-4914-7
[39]
R. Jäschke, J. Strötgen, E. Krotova, and F. Fischer, “„Der Helmut Kohl unter den Brotaufstrichen“ - Zur Extraktion vossianischer Antonomasien aus großen Zeitungskorpora,” in DHd 2017, 4. Tagung des Verbands Digital Humanities im deutschsprachigen Raum e.V., Bern, Switzerland, 2017.
Export
BibTeX
@inproceedings{JaeschkeEtAl2017_DHD, TITLE = {{{``Der Helmut Kohl unter den Brotaufstrichen'' -- Zur Extraktion vossianischer Antonomasien aus gro{\ss}en Zeitungskorpora}}}, AUTHOR = {J{\"a}schke, Robert and Str{\"o}tgen, Jannik and Krotova, Elena and Fischer, Frank}, LANGUAGE = {deu}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {DHd 2017, 4. Tagung des Verbands Digital Humanities im deutschsprachigen Raum e.V.}, PAGES = {120--124}, ADDRESS = {Bern, Switzerland}, }
Endnote
%0 Conference Proceedings %A Jäschke, Robert %A Strötgen, Jannik %A Krotova, Elena %A Fischer, Frank %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T „Der Helmut Kohl unter den Brotaufstrichen“ - Zur Extraktion vossianischer Antonomasien aus großen Zeitungskorpora : %G deu %U http://hdl.handle.net/11858/00-001M-0000-002C-4E05-A %D 2017 %B 4. Tagung des Verbands Digital Humanities im deutschsprachigen Raum e.V. %Z date of event: 2017-02-13 - 2017-02-18 %C Bern, Switzerland %B DHd 2017 %P 120 - 124
[40]
J. Kalofolias, E. Galbrun, and P. Miettinen, “From Sets of Good Redescriptions to Good Sets of Redescriptions,” in 16th IEEE International Conference on Data Mining (ICDM 2016), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{kalofolias16from, TITLE = {From Sets of Good Redescriptions to Good Sets of Redescriptions}, AUTHOR = {Kalofolias, Janis and Galbrun, Esther and Miettinen, Pauli}, LANGUAGE = {eng}, ISBN = {978-1-5090-5473-2}, DOI = {10.1109/ICDM.2016.0032}, PUBLISHER = {IEEE}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {16th IEEE International Conference on Data Mining (ICDM 2016)}, PAGES = {211--220}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Kalofolias, Janis %A Galbrun, Esther %A Miettinen, Pauli %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T From Sets of Good Redescriptions to Good Sets of Redescriptions : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-224D-A %R 10.1109/ICDM.2016.0032 %D 2017 %8 02.02.2017 %B 16th International Conference on Data Mining %Z date of event: 2016-12-12 - 2016-12-15 %C Barcelona, Spain %B 16th IEEE International Conference on Data Mining %P 211 - 220 %I IEEE %@ 978-1-5090-5473-2
[41]
J. Kalofolias, M. Boley, and J. Vreeken, “Efficiently Discovering Locally Exceptional yet Globally Representative Subgroups,” 2017. [Online]. Available: http://arxiv.org/abs/1709.07941. (arXiv: 1709.07941)
Abstract
Subgroup discovery is a local pattern mining technique to find interpretable descriptions of sub-populations that stand out on a given target variable. That is, these sub-populations are exceptional with regard to the global distribution. In this paper we argue that in many applications, such as scientific discovery, subgroups are only useful if they are additionally representative of the global distribution with regard to a control variable. That is, when the distribution of this control variable is the same, or almost the same, as over the whole data. We formalise this objective function and give an efficient algorithm to compute its tight optimistic estimator for the case of a numeric target and a binary control variable. This enables us to use the branch-and-bound framework to efficiently discover the top-$k$ subgroups that are both exceptional as well as representative. Experimental evaluation on a wide range of datasets shows that with this algorithm we discover meaningful representative patterns and are up to orders of magnitude faster in terms of node evaluations as well as time.
Export
BibTeX
@online{Kalofolias_arXiv2017, TITLE = {Efficiently Discovering Locally Exceptional yet Globally Representative Subgroups}, AUTHOR = {Kalofolias, Janis and Boley, Mario and Vreeken, Jilles}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1709.07941}, EPRINT = {1709.07941}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Subgroup discovery is a local pattern mining technique to find interpretable descriptions of sub-populations that stand out on a given target variable. That is, these sub-populations are exceptional with regard to the global distribution. In this paper we argue that in many applications, such as scientific discovery, subgroups are only useful if they are additionally representative of the global distribution with regard to a control variable. That is, when the distribution of this control variable is the same, or almost the same, as over the whole data. We formalise this objective function and give an efficient algorithm to compute its tight optimistic estimator for the case of a numeric target and a binary control variable. This enables us to use the branch-and-bound framework to efficiently discover the top-$k$ subgroups that are both exceptional as well as representative. Experimental evaluation on a wide range of datasets shows that with this algorithm we discover meaningful representative patterns and are up to orders of magnitude faster in terms of node evaluations as well as time.}, }
Endnote
%0 Report %A Kalofolias, Janis %A Boley, Mario %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Efficiently Discovering Locally Exceptional yet Globally Representative Subgroups : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-0685-D %U http://arxiv.org/abs/1709.07941 %D 2017 %X Subgroup discovery is a local pattern mining technique to find interpretable descriptions of sub-populations that stand out on a given target variable. That is, these sub-populations are exceptional with regard to the global distribution. In this paper we argue that in many applications, such as scientific discovery, subgroups are only useful if they are additionally representative of the global distribution with regard to a control variable. That is, when the distribution of this control variable is the same, or almost the same, as over the whole data. We formalise this objective function and give an efficient algorithm to compute its tight optimistic estimator for the case of a numeric target and a binary control variable. This enables us to use the branch-and-bound framework to efficiently discover the top-$k$ subgroups that are both exceptional as well as representative. Experimental evaluation on a wide range of datasets shows that with this algorithm we discover meaningful representative patterns and are up to orders of magnitude faster in terms of node evaluations as well as time. %K Computer Science, Databases, cs.DB,Computer Science, Artificial Intelligence, cs.AI
[42]
S. Karaev and P. Miettinen, “Algorithms for Approximate Subtropical Matrix Factorization,” 2017. [Online]. Available: http://arxiv.org/abs/1707.08872. (arXiv: 1707.08872)
Abstract
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for finding patterns from the data. Rather than using the standard algebra -- and the summation of the rank-1 components to build the approximation of the original matrix -- we use the subtropical algebra, which is an algebra over the nonnegative real values with the summation replaced by the maximum operator. Subtropical matrix factorizations allow "winner-takes-it-all" interpretations of the rank-1 components, revealing different structure than the normal (nonnegative) factorizations. We study the complexity and sparsity of the factorizations, and present a framework for finding low-rank subtropical factorizations. We present two specific algorithms, called Capricorn and Cancer, that are part of our framework. They can be used with data that has been corrupted with different types of noise, and with different error metrics, including the sum-of-absolute differences, Frobenius norm, and Jensen--Shannon divergence. Our experiments show that the algorithms perform well on data that has subtropical structure, and that they can find factorizations that are both sparse and easy to interpret.
Export
BibTeX
@online{Karaev_arXiv2017, TITLE = {Algorithms for Approximate Subtropical Matrix Factorization}, AUTHOR = {Karaev, Sanjar and Miettinen, Pauli}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1707.08872}, EPRINT = {1707.08872}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for finding patterns from the data. Rather than using the standard algebra -- and the summation of the rank-1 components to build the approximation of the original matrix -- we use the subtropical algebra, which is an algebra over the nonnegative real values with the summation replaced by the maximum operator. Subtropical matrix factorizations allow "winner-takes-it-all" interpretations of the rank-1 components, revealing different structure than the normal (nonnegative) factorizations. We study the complexity and sparsity of the factorizations, and present a framework for finding low-rank subtropical factorizations. We present two specific algorithms, called Capricorn and Cancer, that are part of our framework. They can be used with data that has been corrupted with different types of noise, and with different error metrics, including the sum-of-absolute differences, Frobenius norm, and Jensen--Shannon divergence. Our experiments show that the algorithms perform well on data that has subtropical structure, and that they can find factorizations that are both sparse and easy to interpret.}, }
Endnote
%0 Report %A Karaev, Sanjar %A Miettinen, Pauli %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Algorithms for Approximate Subtropical Matrix Factorization : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-065A-F %U http://arxiv.org/abs/1707.08872 %D 2017 %X Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for finding patterns from the data. Rather than using the standard algebra -- and the summation of the rank-1 components to build the approximation of the original matrix -- we use the subtropical algebra, which is an algebra over the nonnegative real values with the summation replaced by the maximum operator. Subtropical matrix factorizations allow "winner-takes-it-all" interpretations of the rank-1 components, revealing different structure than the normal (nonnegative) factorizations. We study the complexity and sparsity of the factorizations, and present a framework for finding low-rank subtropical factorizations. We present two specific algorithms, called Capricorn and Cancer, that are part of our framework. They can be used with data that has been corrupted with different types of noise, and with different error metrics, including the sum-of-absolute differences, Frobenius norm, and Jensen--Shannon divergence. Our experiments show that the algorithms perform well on data that has subtropical structure, and that they can find factorizations that are both sparse and easy to interpret. %K Computer Science, Learning, cs.LG %U http://people.mpi-inf.mpg.de/~pmiettin/tropical/
[43]
E. Kuzey, “Populating Knowledge bases with Temporal Information,” Universität des Saarlandes, Saarbrücken, 2017.
Export
BibTeX
@phdthesis{KuzeyPhd2017, TITLE = {Populating Knowledge bases with Temporal Information}, AUTHOR = {Kuzey, Erdal}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, }
Endnote
%0 Thesis %A Kuzey, Erdal %Y Weikum, Gerhard %A referee: de Rijke , Maarten %A referee: Suchanek, Fabian %+ Databases and Information Systems, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Populating Knowledge bases with Temporal Information : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-EAE5-7 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P XIV, 143 p. %V phd %9 phd %U http://scidok.sulb.uni-saarland.de/volltexte/2017/6811/http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de
[44]
L. Lange, “Time in Newspaper: A Large-Scale Analysis of Temporal Expressions in News Corpora,” Universität des Saarlandes, Saarbrücken, 2017.
Export
BibTeX
@mastersthesis{LangeBcS2017, TITLE = {Time in Newspaper: {A} Large-Scale Analysis of Temporal Expressions in News Corpora}, AUTHOR = {Lange, Lukas}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, TYPE = {Bachelor's thesis}, }
Endnote
%0 Thesis %A Lange, Lukas %Y Strötgen, Jannik %A referee: Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Time in Newspaper: A Large-Scale Analysis of Temporal Expressions in News Corpora : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-5D08-B %I Universität des Saarlandes %C Saarbrücken %D 2017 %P 77 p. %V bachelor %9 bachelor
[45]
F. A. Lisi and D. Stepanova, “Combining Rule Learning and Nonmonotonic Reasoning for Link Prediction in Knowledge Graphs,” in Doctoral Consortium, Challenge, Industry Track, Tutorials and Posters @ RuleML+RR, London, UK, 2017.
Export
BibTeX
@inproceedings{LisiRuleML2017, TITLE = {Combining Rule Learning and Nonmonotonic Reasoning for Link Prediction in Knowledge Graphs}, AUTHOR = {Lisi, Francesca Alessandra and Stepanova, Daria}, LANGUAGE = {eng}, ISSN = {1613-0073}, URL = {urn:nbn:de:0074-1875-8}, PUBLISHER = {CEUR-WS.org}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Doctoral Consortium, Challenge, Industry Track, Tutorials and Posters @ RuleML+RR}, EDITOR = {Bassiliades, Nick and Bikakis, Antonis and Constantini, Stefania and Franconi, Enrico and Giurca, Adrian and Kontchakov, Roman and Patkosi, Theodore and Sadri, Fariba and Van Woensel, William}, SERIES = {CEUR Workshop Proceedings}, VOLUME = {1875}, ADDRESS = {London, UK}, }
Endnote
%0 Conference Proceedings %A Lisi, Francesca Alessandra %A Stepanova, Daria %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Combining Rule Learning and Nonmonotonic Reasoning for Link Prediction in Knowledge Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-55FC-8 %D 2017 %B International Joint Conference on Rules and Reasoning %Z date of event: 2017-07-12 - 2017-07-15 %C London, UK %B Doctoral Consortium, Challenge, Industry Track, Tutorials and Posters @ RuleML+RR %E Bassiliades, Nick; Bikakis, Antonis; Constantini, Stefania; Franconi, Enrico; Giurca, Adrian; Kontchakov, Roman; Patkosi, Theodore; Sadri, Fariba; Van Woensel, William %I CEUR-WS.org %B CEUR Workshop Proceedings %N 1875 %@ false %U http://ceur-ws.org/Vol-1875/paper20.pdf
[46]
S. MacAvaney, K. Hui, and A. Yates, “An Approach for Weakly-Supervised Deep Information Retrieval,” 2017. [Online]. Available: http://arxiv.org/abs/1707.00189. (arXiv: 1707.00189)
Abstract
Recent developments in neural information retrieval models have been promising, but a problem remains: human relevance judgments are expensive to produce, while neural models require a considerable amount of training data. In an attempt to fill this gap, we present an approach that---given a weak training set of pseudo-queries, documents, relevance information---filters the data to produce effective positive and negative query-document pairs. This allows large corpora to be used as neural IR model training data, while eliminating training examples that do not transfer well to relevance scoring. The filters include unsupervised ranking heuristics and a novel measure of interaction similarity. We evaluate our approach using a news corpus with article headlines acting as pseudo-queries and article content as documents, with implicit relevance between an article's headline and its content. By using our approach to train state-of-the-art neural IR models and comparing to established baselines, we find that training data generated by our approach can lead to good results on a benchmark test collection.
Export
BibTeX
@online{MacAvaney_arXiv2017, TITLE = {An Approach for Weakly-Supervised Deep Information Retrieval}, AUTHOR = {MacAvaney, Sean and Hui, Kai and Yates, Andrew}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1707.00189}, EPRINT = {1707.00189}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Recent developments in neural information retrieval models have been promising, but a problem remains: human relevance judgments are expensive to produce, while neural models require a considerable amount of training data. In an attempt to fill this gap, we present an approach that---given a weak training set of pseudo-queries, documents, relevance information---filters the data to produce effective positive and negative query-document pairs. This allows large corpora to be used as neural IR model training data, while eliminating training examples that do not transfer well to relevance scoring. The filters include unsupervised ranking heuristics and a novel measure of interaction similarity. We evaluate our approach using a news corpus with article headlines acting as pseudo-queries and article content as documents, with implicit relevance between an article's headline and its content. By using our approach to train state-of-the-art neural IR models and comparing to established baselines, we find that training data generated by our approach can lead to good results on a benchmark test collection.}, }
Endnote
%0 Report %A MacAvaney, Sean %A Hui, Kai %A Yates, Andrew %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T An Approach for Weakly-Supervised Deep Information Retrieval : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-06C5-C %U http://arxiv.org/abs/1707.00189 %D 2017 %X Recent developments in neural information retrieval models have been promising, but a problem remains: human relevance judgments are expensive to produce, while neural models require a considerable amount of training data. In an attempt to fill this gap, we present an approach that---given a weak training set of pseudo-queries, documents, relevance information---filters the data to produce effective positive and negative query-document pairs. This allows large corpora to be used as neural IR model training data, while eliminating training examples that do not transfer well to relevance scoring. The filters include unsupervised ranking heuristics and a novel measure of interaction similarity. We evaluate our approach using a news corpus with article headlines acting as pseudo-queries and article content as documents, with implicit relevance between an article's headline and its content. By using our approach to train state-of-the-art neural IR models and comparing to established baselines, we find that training data generated by our approach can lead to good results on a benchmark test collection. %K Computer Science, Information Retrieval, cs.IR,Computer Science, Computation and Language, cs.CL
[47]
P. Mandros, M. Boley, and J. Vreeken, “Discovering Reliable Approximate Functional Dependencies,” in KDD’17, 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, 2017.
Export
BibTeX
@inproceedings{MandrosKDD2017, TITLE = {Discovering Reliable Approximate Functional Dependencies}, AUTHOR = {Mandros, Panagiotis and Boley, Mario and Vreeken, Jilles}, LANGUAGE = {eng}, ISBN = {978-1-4503-4887-4}, DOI = {10.1145/3097983.3098062}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {KDD'17, 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}, PAGES = {355--363}, ADDRESS = {Halifax, NS, Canada}, }
Endnote
%0 Conference Proceedings %A Mandros, Panagiotis %A Boley, Mario %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Discovering Reliable Approximate Functional Dependencies : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-065F-5 %R 10.1145/3097983.3098062 %D 2017 %B 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining %Z date of event: 2017-08-13 - 2017-08-17 %C Halifax, NS, Canada %B KDD'17 %P 355 - 363 %I ACM %@ 978-1-4503-4887-4
[48]
P. Mandros, M. Boley, and J. Vreeken, “Discovering Reliable Approximate Functional Dependencies,” 2017. [Online]. Available: http://arxiv.org/abs/1705.09391. (arXiv: 1705.09391)
Abstract
Given a database and a target attribute of interest, how can we tell whether there exists a functional, or approximately functional dependence of the target on any set of other attributes in the data? How can we reliably, without bias to sample size or dimensionality, measure the strength of such a dependence? And, how can we efficiently discover the optimal or $\alpha$-approximate top-$k$ dependencies? These are exactly the questions we answer in this paper. As we want to be agnostic on the form of the dependence, we adopt an information-theoretic approach, and construct a reliable, bias correcting score that can be efficiently computed. Moreover, we give an effective optimistic estimator of this score, by which for the first time we can mine the approximate functional dependencies from data with guarantees of optimality. Empirical evaluation shows that the derived score achieves a good bias for variance trade-off, can be used within an efficient discovery algorithm, and indeed discovers meaningful dependencies. Most important, it remains reliable in the face of data sparsity.
Export
BibTeX
@online{DBLP:journals/corr/MandrosBV17, TITLE = {Discovering Reliable Approximate Functional Dependencies}, AUTHOR = {Mandros, Panagiotis and Boley, Mario and Vreeken, Jilles}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.09391}, EPRINT = {1705.09391}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Given a database and a target attribute of interest, how can we tell whether there exists a functional, or approximately functional dependence of the target on any set of other attributes in the data? How can we reliably, without bias to sample size or dimensionality, measure the strength of such a dependence? And, how can we efficiently discover the optimal or $\alpha$-approximate top-$k$ dependencies? These are exactly the questions we answer in this paper. As we want to be agnostic on the form of the dependence, we adopt an information-theoretic approach, and construct a reliable, bias correcting score that can be efficiently computed. Moreover, we give an effective optimistic estimator of this score, by which for the first time we can mine the approximate functional dependencies from data with guarantees of optimality. Empirical evaluation shows that the derived score achieves a good bias for variance trade-off, can be used within an efficient discovery algorithm, and indeed discovers meaningful dependencies. Most important, it remains reliable in the face of data sparsity.}, }
Endnote
%0 Report %A Mandros, Panagiotis %A Boley, Mario %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Discovering Reliable Approximate Functional Dependencies : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90F8-D %U http://arxiv.org/abs/1705.09391 %D 2017 %X Given a database and a target attribute of interest, how can we tell whether there exists a functional, or approximately functional dependence of the target on any set of other attributes in the data? How can we reliably, without bias to sample size or dimensionality, measure the strength of such a dependence? And, how can we efficiently discover the optimal or $\alpha$-approximate top-$k$ dependencies? These are exactly the questions we answer in this paper. As we want to be agnostic on the form of the dependence, we adopt an information-theoretic approach, and construct a reliable, bias correcting score that can be efficiently computed. Moreover, we give an effective optimistic estimator of this score, by which for the first time we can mine the approximate functional dependencies from data with guarantees of optimality. Empirical evaluation shows that the derived score achieves a good bias for variance trade-off, can be used within an efficient discovery algorithm, and indeed discovers meaningful dependencies. Most important, it remains reliable in the face of data sparsity. %K Computer Science, Databases, cs.DB,Computer Science, Artificial Intelligence, cs.AI,Computer Science, Information Theory, cs.IT,Mathematics, Information Theory, math.IT
[49]
A. Marx and J. Vreeken, “Causal Inference on Multivariate Mixed-Type Data by Minimum Description Length,” 2017. [Online]. Available: http://arxiv.org/abs/1702.06385. (arXiv: 1702.06385)
Abstract
Given data over the joint distribution of two univariate or multivariate random variables $X$ and $Y$ of mixed or single type data, we consider the problem of inferring the most likely causal direction between $X$ and $Y$. We take an information theoretic approach, from which it follows that first describing the data over cause and then that of effect given cause is shorter than the reverse direction. For practical inference, we propose a score for causal models for mixed type data based on the Minimum Description Length (MDL) principle. In particular, we model dependencies between $X$ and $Y$ using classification and regression trees. Inferring the optimal model is NP-hard, and hence we propose Crack, a fast greedy algorithm to infer the most likely causal direction directly from the data. Empirical evaluation on synthetic, benchmark, and real world data shows that Crack reliably and with high accuracy infers the correct causal direction on both univariate and multivariate cause--effect pairs over both single and mixed type data.
Export
BibTeX
@online{DBLP:journals/corr/MarxV17, TITLE = {Causal Inference on Multivariate Mixed-Type Data by Minimum Description Length}, AUTHOR = {Marx, Alexander and Vreeken, Jilles}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1702.06385}, EPRINT = {1702.06385}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Given data over the joint distribution of two univariate or multivariate random variables $X$ and $Y$ of mixed or single type data, we consider the problem of inferring the most likely causal direction between $X$ and $Y$. We take an information theoretic approach, from which it follows that first describing the data over cause and then that of effect given cause is shorter than the reverse direction. For practical inference, we propose a score for causal models for mixed type data based on the Minimum Description Length (MDL) principle. In particular, we model dependencies between $X$ and $Y$ using classification and regression trees. Inferring the optimal model is NP-hard, and hence we propose Crack, a fast greedy algorithm to infer the most likely causal direction directly from the data. Empirical evaluation on synthetic, benchmark, and real world data shows that Crack reliably and with high accuracy infers the correct causal direction on both univariate and multivariate cause--effect pairs over both single and mixed type data.}, }
Endnote
%0 Report %A Marx, Alexander %A Vreeken, Jilles %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Causal Inference on Multivariate Mixed-Type Data by Minimum Description Length : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90EF-3 %U http://arxiv.org/abs/1702.06385 %D 2017 %X Given data over the joint distribution of two univariate or multivariate random variables $X$ and $Y$ of mixed or single type data, we consider the problem of inferring the most likely causal direction between $X$ and $Y$. We take an information theoretic approach, from which it follows that first describing the data over cause and then that of effect given cause is shorter than the reverse direction. For practical inference, we propose a score for causal models for mixed type data based on the Minimum Description Length (MDL) principle. In particular, we model dependencies between $X$ and $Y$ using classification and regression trees. Inferring the optimal model is NP-hard, and hence we propose Crack, a fast greedy algorithm to infer the most likely causal direction directly from the data. Empirical evaluation on synthetic, benchmark, and real world data shows that Crack reliably and with high accuracy infers the correct causal direction on both univariate and multivariate cause--effect pairs over both single and mixed type data. %K Statistics, Machine Learning, stat.ML,Computer Science, Learning, cs.LG
[50]
F. Meawad, M. H. Gad-Elrab, and E. Hemayed, “Designing Mobile Augmented Reality Experiences Using Friendly Markers,” in 4th International Conference on User Science and Engineering (i-USEr 2016), Melaka, Malaysia, 2017.
Export
BibTeX
@inproceedings{Meawad2017, TITLE = {Designing Mobile Augmented Reality Experiences Using Friendly Markers}, AUTHOR = {Meawad, Fatma and Gad-Elrab, Mohamed H. and Hemayed, Elsayed}, LANGUAGE = {eng}, ISBN = {978-1-5090-263-9}, DOI = {10.1109/IUSER.2016.7857937}, PUBLISHER = {IEEE}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {4th International Conference on User Science and Engineering (i-USEr 2016)}, PAGES = {75--80}, ADDRESS = {Melaka, Malaysia}, }
Endnote
%0 Conference Proceedings %A Meawad, Fatma %A Gad-Elrab, Mohamed H. %A Hemayed, Elsayed %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Designing Mobile Augmented Reality Experiences Using Friendly Markers : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-CF28-A %R 10.1109/IUSER.2016.7857937 %D 2017 %B 4th International Conference on User Science and Engineering %Z date of event: 2016-08-23 - 2016-08-25 %C Melaka, Malaysia %B 4th International Conference on User Science and Engineering %P 75 - 80 %I IEEE %@ 978-1-5090-263-9
[51]
S. Metzger, R. Schenkel, and M. Sydow, “QBEES: Query-by-Example Entity Search in Semantic Knowledge Graphs Based on Maximal Aspects, Diversity-awareness and Relaxation,” Journal of Intelligent Information Systems, vol. 49, no. 3, 2017.
Export
BibTeX
@article{Metzger2017, TITLE = {{QBEES}: Query-by-Example Entity Search in Semantic Knowledge Graphs Based on Maximal Aspects, Diversity-awareness and Relaxation}, AUTHOR = {Metzger, Steffen and Schenkel, Ralf and Sydow, Marcin}, LANGUAGE = {eng}, DOI = {10.1007/s10844-017-0443-x}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {Journal of Intelligent Information Systems}, VOLUME = {49}, NUMBER = {3}, PAGES = {333--366}, }
Endnote
%0 Journal Article %A Metzger, Steffen %A Schenkel, Ralf %A Sydow, Marcin %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T QBEES: Query-by-Example Entity Search in Semantic Knowledge Graphs Based on Maximal Aspects, Diversity-awareness and Relaxation : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-557B-8 %R 10.1007/s10844-017-0443-x %7 2017 %D 2017 %J Journal of Intelligent Information Systems %V 49 %N 3 %& 333 %P 333 - 366
[52]
S. Metzler, S. Günnemann, and P. Miettinen, “Hyperbolae Are No Hyperbole: Modelling Communities That Are Not Cliques,” in 16th IEEE International Conference on Data Mining (ICDM 2016), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{metzler16hyperbolae, TITLE = {Hyperbolae Are No Hyperbole: {Modelling} Communities That Are Not Cliques}, AUTHOR = {Metzler, Saskia and G{\"u}nnemann, Stephan and Miettinen, Pauli}, LANGUAGE = {eng}, ISBN = {978-1-5090-5473-2}, DOI = {10.1109/ICDM.2016.0044}, PUBLISHER = {IEEE}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {16th IEEE International Conference on Data Mining (ICDM 2016)}, PAGES = {330--339}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Metzler, Saskia %A Günnemann, Stephan %A Miettinen, Pauli %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Hyperbolae Are No Hyperbole: Modelling Communities That Are Not Cliques : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-225F-F %R 10.1109/ICDM.2016.0044 %D 2017 %8 02.02.2017 %B 16th International Conference on Data Mining %Z date of event: 2016-12-12 - 2016-12-15 %C Barcelona, Spain %B 16th IEEE International Conference on Data Mining %P 330 - 339 %I IEEE %@ 978-1-5090-5473-2
[53]
P. Mirza, S. Razniewski, F. Darari, and G. Weikum, “Cardinal Virtues: Extracting Relation Cardinalities from Text,” in The 55th Annual Meeting of the Association for Computational Linguistics (ACL 2017), Vancouver, Canada, 2017.
Export
BibTeX
@inproceedings{MirzaACL2017, TITLE = {Cardinal Virtues: {E}xtracting Relation Cardinalities from Text}, AUTHOR = {Mirza, Paramita and Razniewski, Simon and Darari, Fariz and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-945626-76-0}, DOI = {10.18653/v1/P17-2055}, PUBLISHER = {ACL}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {The 55th Annual Meeting of the Association for Computational Linguistics (ACL 2017)}, PAGES = {347--351}, ADDRESS = {Vancouver, Canada}, }
Endnote
%0 Conference Proceedings %A Mirza, Paramita %A Razniewski, Simon %A Darari, Fariz %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Cardinal Virtues: Extracting Relation Cardinalities from Text : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-F9F8-7 %R 10.18653/v1/P17-2055 %D 2017 %B The 55th Annual Meeting of the Association for Computational Linguistics %Z date of event: 2017-07-30 - 2017-08-04 %C Vancouver, Canada %B The 55th Annual Meeting of the Association for Computational Linguistics %P 347 - 351 %I ACL %@ 978-1-945626-76-0 %U http://aclweb.org/anthology/P17-2055
[54]
P. Mirza, S. Razniewski, F. Darari, and G. Weikum, “Cardinal Virtues: Extracting Relation Cardinalities from Text,” 2017. [Online]. Available: http://arxiv.org/abs/1704.04455. (arXiv: 1704.04455)
Abstract
Information extraction (IE) from text has largely focused on relations between individual entities, such as who has won which award. However, some facts are never fully mentioned, and no IE method has perfect recall. Thus, it is beneficial to also tap contents about the cardinalities of these relations, for example, how many awards someone has won. We introduce this novel problem of extracting cardinalities and discusses the specific challenges that set it apart from standard IE. We present a distant supervision method using conditional random fields. A preliminary evaluation results in precision between 3% and 55%, depending on the difficulty of relations.
Export
BibTeX
@online{Mirza2017, TITLE = {Cardinal Virtues: Extracting Relation Cardinalities from Text}, AUTHOR = {Mirza, Paramita and Razniewski, Simon and Darari, Fariz and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1704.04455}, EPRINT = {1704.04455}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Information extraction (IE) from text has largely focused on relations between individual entities, such as who has won which award. However, some facts are never fully mentioned, and no IE method has perfect recall. Thus, it is beneficial to also tap contents about the cardinalities of these relations, for example, how many awards someone has won. We introduce this novel problem of extracting cardinalities and discusses the specific challenges that set it apart from standard IE. We present a distant supervision method using conditional random fields. A preliminary evaluation results in precision between 3% and 55%, depending on the difficulty of relations.}, }
Endnote
%0 Report %A Mirza, Paramita %A Razniewski, Simon %A Darari, Fariz %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Cardinal Virtues: Extracting Relation Cardinalities from Text : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-8128-9 %U http://arxiv.org/abs/1704.04455 %D 2017 %X Information extraction (IE) from text has largely focused on relations between individual entities, such as who has won which award. However, some facts are never fully mentioned, and no IE method has perfect recall. Thus, it is beneficial to also tap contents about the cardinalities of these relations, for example, how many awards someone has won. We introduce this novel problem of extracting cardinalities and discusses the specific challenges that set it apart from standard IE. We present a distant supervision method using conditional random fields. A preliminary evaluation results in precision between 3% and 55%, depending on the difficulty of relations. %K Computer Science, Computation and Language, cs.CL
[55]
A. Mishra and K. Berberich, “How do Order and Proximity Impact the Readability of Event Summaries?,” in Advances in Information Retrieval (ECIR 2017), Aberdeen, UK, 2017.
Export
BibTeX
@inproceedings{DBLP:conf/ecir/MishraB17, TITLE = {How do Order and Proximity Impact the Readability of Event Summaries?}, AUTHOR = {Mishra, Arunav and Berberich, Klaus}, LANGUAGE = {eng}, ISBN = {978-3-319-56607-8}, DOI = {10.1007/978-3-319-56608-5_17}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Advances in Information Retrieval (ECIR 2017)}, EDITOR = {Jose, Joemon M. and Hauff, Claudia and Altingovde, Ismail Sengor and Song, Dawei and Albakour, Dyaa and Watt, Stuart and Tait, John}, PAGES = {212--225}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10193}, ADDRESS = {Aberdeen, UK}, }
Endnote
%0 Conference Proceedings %A Mishra, Arunav %A Berberich, Klaus %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T How do Order and Proximity Impact the Readability of Event Summaries? : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-20D9-B %R 10.1007/978-3-319-56608-5_17 %D 2017 %B 39th European Conference on Information Retrieval %Z date of event: 2017-04-09 - 2017-04-13 %C Aberdeen, UK %B Advances in Information Retrieval %E Jose, Joemon M.; Hauff, Claudia; Altingovde, Ismail Sengor; Song, Dawei; Albakour, Dyaa; Watt, Stuart; Tait, John %P 212 - 225 %I Springer %@ 978-3-319-56607-8 %B Lecture Notes in Computer Science %N 10193
[56]
S. Mukherjee, “Probabilistic Graphical Models for Credibility Analysis in Evolving Online Communities,” Universität des Saarlandes, Saarbrücken, 2017.
Abstract
One of the major hurdles preventing the full exploitation of information from online communities is the widespread concern regarding the quality and credibility of user-contributed content. Prior works in this domain operate on a static snapshot of the community, making strong assumptions about the structure of the data (e.g., relational tables), or consider only shallow features for text classification. To address the above limitations, we propose probabilistic graphical models that can leverage the joint interplay between multiple factors in online communities --- like user interactions, community dynamics, and textual content --- to automatically assess the credibility of user-contributed online content, and the expertise of users and their evolution with user-interpretable explanation. To this end, we devise new models based on Conditional Random Fields for different settings like incorporating partial expert knowledge for semi-supervised learning, and handling discrete labels as well as numeric ratings for fine-grained analysis. This enables applications such as extracting reliable side-effects of drugs from user-contributed posts in healthforums, and identifying credible content in news communities. Online communities are dynamic, as users join and leave, adapt to evolving trends, and mature over time. To capture this dynamics, we propose generative models based on Hidden Markov Model, Latent Dirichlet Allocation, and Brownian Motion to trace the continuous evolution of user expertise and their language model over time. This allows us to identify expert users and credible content jointly over time, improving state-of-the-art recommender systems by explicitly considering the maturity of users. This also enables applications such as identifying helpful product reviews, and detecting fake and anomalous reviews with limited information.
Export
BibTeX
@phdthesis{Mukherjeephd17, TITLE = {Probabilistic Graphical Models for Credibility Analysis in Evolving Online Communities}, AUTHOR = {Mukherjee, Subhabrata}, LANGUAGE = {eng}, URL = {urn:nbn:de:bsz:291-scidok-69269}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {One of the major hurdles preventing the full exploitation of information from online communities is the widespread concern regarding the quality and credibility of user-contributed content. Prior works in this domain operate on a static snapshot of the community, making strong assumptions about the structure of the data (e.g., relational tables), or consider only shallow features for text classification. To address the above limitations, we propose probabilistic graphical models that can leverage the joint interplay between multiple factors in online communities --- like user interactions, community dynamics, and textual content --- to automatically assess the credibility of user-contributed online content, and the expertise of users and their evolution with user-interpretable explanation. To this end, we devise new models based on Conditional Random Fields for different settings like incorporating partial expert knowledge for semi-supervised learning, and handling discrete labels as well as numeric ratings for fine-grained analysis. This enables applications such as extracting reliable side-effects of drugs from user-contributed posts in healthforums, and identifying credible content in news communities. Online communities are dynamic, as users join and leave, adapt to evolving trends, and mature over time. To capture this dynamics, we propose generative models based on Hidden Markov Model, Latent Dirichlet Allocation, and Brownian Motion to trace the continuous evolution of user expertise and their language model over time. This allows us to identify expert users and credible content jointly over time, improving state-of-the-art recommender systems by explicitly considering the maturity of users. This also enables applications such as identifying helpful product reviews, and detecting fake and anomalous reviews with limited information.}, }
Endnote
%0 Thesis %A Mukherjee, Subhabrata %Y Weikum, Gerhard %A referee: Han, Jiawei %A referee: Günnemann, Stephan %+ Databases and Information Systems, MPI for Informatics, Max Planck Society International Max Planck Research School, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Probabilistic Graphical Models for Credibility Analysis in Evolving Online Communities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-A648-0 %U urn:nbn:de:bsz:291-scidok-69269 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P 166 p. %V phd %9 phd %X One of the major hurdles preventing the full exploitation of information from online communities is the widespread concern regarding the quality and credibility of user-contributed content. Prior works in this domain operate on a static snapshot of the community, making strong assumptions about the structure of the data (e.g., relational tables), or consider only shallow features for text classification. To address the above limitations, we propose probabilistic graphical models that can leverage the joint interplay between multiple factors in online communities --- like user interactions, community dynamics, and textual content --- to automatically assess the credibility of user-contributed online content, and the expertise of users and their evolution with user-interpretable explanation. To this end, we devise new models based on Conditional Random Fields for different settings like incorporating partial expert knowledge for semi-supervised learning, and handling discrete labels as well as numeric ratings for fine-grained analysis. This enables applications such as extracting reliable side-effects of drugs from user-contributed posts in healthforums, and identifying credible content in news communities. Online communities are dynamic, as users join and leave, adapt to evolving trends, and mature over time. To capture this dynamics, we propose generative models based on Hidden Markov Model, Latent Dirichlet Allocation, and Brownian Motion to trace the continuous evolution of user expertise and their language model over time. This allows us to identify expert users and credible content jointly over time, improving state-of-the-art recommender systems by explicitly considering the maturity of users. This also enables applications such as identifying helpful product reviews, and detecting fake and anomalous reviews with limited information. %U http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=dehttp://scidok.sulb.uni-saarland.de/volltexte/2017/6926/
[57]
S. Mukherjee and G. Weikum, “People on Media: Jointly Identifying Credible News and Trustworthy Citizen Journalists in Online Communities,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02667. (arXiv: 1705.02667)
Abstract
Media seems to have become more partisan, often providing a biased coverage of news catering to the interest of specific groups. It is therefore essential to identify credible information content that provides an objective narrative of an event. News communities such as digg, reddit, or newstrust offer recommendations, reviews, quality ratings, and further insights on journalistic works. However, there is a complex interaction between different factors in such online communities: fairness and style of reporting, language clarity and objectivity, topical perspectives (like political viewpoint), expertise and bias of community members, and more. This paper presents a model to systematically analyze the different interactions in a news community between users, news, and sources. We develop a probabilistic graphical model that leverages this joint interaction to identify 1) highly credible news articles, 2) trustworthy news sources, and 3) expert users who perform the role of "citizen journalists" in the community. Our method extends CRF models to incorporate real-valued ratings, as some communities have very fine-grained scales that cannot be easily discretized without losing information. To the best of our knowledge, this paper is the first full-fledged analysis of credibility, trust, and expertise in news communities.
Export
BibTeX
@online{Mukerjee_arXiv1705.02667, TITLE = {People on Media: Jointly Identifying Credible News and Trustworthy Citizen Journalists in Online Communities}, AUTHOR = {Mukherjee, Subhabrata and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.02667}, EPRINT = {1705.02667}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Media seems to have become more partisan, often providing a biased coverage of news catering to the interest of specific groups. It is therefore essential to identify credible information content that provides an objective narrative of an event. News communities such as digg, reddit, or newstrust offer recommendations, reviews, quality ratings, and further insights on journalistic works. However, there is a complex interaction between different factors in such online communities: fairness and style of reporting, language clarity and objectivity, topical perspectives (like political viewpoint), expertise and bias of community members, and more. This paper presents a model to systematically analyze the different interactions in a news community between users, news, and sources. We develop a probabilistic graphical model that leverages this joint interaction to identify 1) highly credible news articles, 2) trustworthy news sources, and 3) expert users who perform the role of "citizen journalists" in the community. Our method extends CRF models to incorporate real-valued ratings, as some communities have very fine-grained scales that cannot be easily discretized without losing information. To the best of our knowledge, this paper is the first full-fledged analysis of credibility, trust, and expertise in news communities.}, }
Endnote
%0 Report %A Mukherjee, Subhabrata %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T People on Media: Jointly Identifying Credible News and Trustworthy Citizen Journalists in Online Communities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-80F7-0 %U http://arxiv.org/abs/1705.02667 %D 2017 %X Media seems to have become more partisan, often providing a biased coverage of news catering to the interest of specific groups. It is therefore essential to identify credible information content that provides an objective narrative of an event. News communities such as digg, reddit, or newstrust offer recommendations, reviews, quality ratings, and further insights on journalistic works. However, there is a complex interaction between different factors in such online communities: fairness and style of reporting, language clarity and objectivity, topical perspectives (like political viewpoint), expertise and bias of community members, and more. This paper presents a model to systematically analyze the different interactions in a news community between users, news, and sources. We develop a probabilistic graphical model that leverages this joint interaction to identify 1) highly credible news articles, 2) trustworthy news sources, and 3) expert users who perform the role of "citizen journalists" in the community. Our method extends CRF models to incorporate real-valued ratings, as some communities have very fine-grained scales that cannot be easily discretized without losing information. To the best of our knowledge, this paper is the first full-fledged analysis of credibility, trust, and expertise in news communities. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Computation and Language, cs.CL,Computer Science, Information Retrieval, cs.IR,cs.SI,Statistics, Machine Learning, stat.ML
[58]
S. Mukherjee, G. Weikum, and C. Danescu-Niculescu-Mizil, “People on Drugs: Credibility of User Statements in Health Communities,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02522. (arXiv: 1705.02522)
Abstract
Online health communities are a valuable source of information for patients and physicians. However, such user-generated resources are often plagued by inaccuracies and misinformation. In this work we propose a method for automatically establishing the credibility of user-generated medical statements and the trustworthiness of their authors by exploiting linguistic cues and distant supervision from expert sources. To this end we introduce a probabilistic graphical model that jointly learns user trustworthiness, statement credibility, and language objectivity. We apply this methodology to the task of extracting rare or unknown side-effects of medical drugs --- this being one of the problems where large scale non-expert data has the potential to complement expert medical knowledge. We show that our method can reliably extract side-effects and filter out false statements, while identifying trustworthy users that are likely to contribute valuable medical information.
Export
BibTeX
@online{Mukherjee_arXiv2017, TITLE = {People on Drugs: Credibility of User Statements in Health Communities}, AUTHOR = {Mukherjee, Subhabrata and Weikum, Gerhard and Danescu-Niculescu-Mizil, Cristian}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.02522}, EPRINT = {1705.02522}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Online health communities are a valuable source of information for patients and physicians. However, such user-generated resources are often plagued by inaccuracies and misinformation. In this work we propose a method for automatically establishing the credibility of user-generated medical statements and the trustworthiness of their authors by exploiting linguistic cues and distant supervision from expert sources. To this end we introduce a probabilistic graphical model that jointly learns user trustworthiness, statement credibility, and language objectivity. We apply this methodology to the task of extracting rare or unknown side-effects of medical drugs --- this being one of the problems where large scale non-expert data has the potential to complement expert medical knowledge. We show that our method can reliably extract side-effects and filter out false statements, while identifying trustworthy users that are likely to contribute valuable medical information.}, }
Endnote
%0 Report %A Mukherjee, Subhabrata %A Weikum, Gerhard %A Danescu-Niculescu-Mizil, Cristian %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T People on Drugs: Credibility of User Statements in Health Communities : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-80FE-2 %U http://arxiv.org/abs/1705.02522 %D 2017 %X Online health communities are a valuable source of information for patients and physicians. However, such user-generated resources are often plagued by inaccuracies and misinformation. In this work we propose a method for automatically establishing the credibility of user-generated medical statements and the trustworthiness of their authors by exploiting linguistic cues and distant supervision from expert sources. To this end we introduce a probabilistic graphical model that jointly learns user trustworthiness, statement credibility, and language objectivity. We apply this methodology to the task of extracting rare or unknown side-effects of medical drugs --- this being one of the problems where large scale non-expert data has the potential to complement expert medical knowledge. We show that our method can reliably extract side-effects and filter out false statements, while identifying trustworthy users that are likely to contribute valuable medical information. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Computation and Language, cs.CL,Computer Science, Information Retrieval, cs.IR,cs.SI,Statistics, Machine Learning, stat.ML
[59]
S. Mukherjee, H. Lamba, and G. Weikum, “Item Recommendation with Evolving User Preferences and Experience,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02519. (arXiv: 1705.02519)
Abstract
Current recommender systems exploit user and item similarities by collaborative filtering. Some advanced methods also consider the temporal evolution of item ratings as a global background process. However, all prior methods disregard the individual evolution of a user's experience level and how this is expressed in the user's writing in a review community. In this paper, we model the joint evolution of user experience, interest in specific item facets, writing style, and rating behavior. This way we can generate individual recommendations that take into account the user's maturity level (e.g., recommending art movies rather than blockbusters for a cinematography expert). As only item ratings and review texts are observables, we capture the user's experience and interests in a latent model learned from her reviews, vocabulary and writing style. We develop a generative HMM-LDA model to trace user evolution, where the Hidden Markov Model (HMM) traces her latent experience progressing over time -- with solely user reviews and ratings as observables over time. The facets of a user's interest are drawn from a Latent Dirichlet Allocation (LDA) model derived from her reviews, as a function of her (again latent) experience level. In experiments with five real-world datasets, we show that our model improves the rating prediction over state-of-the-art baselines, by a substantial margin. We also show, in a use-case study, that our model performs well in the assessment of user experience levels.
Export
BibTeX
@online{Mukherjee2017d, TITLE = {Item Recommendation with Evolving User Preferences and Experience}, AUTHOR = {Mukherjee, Subhabrata and Lamba, Hemank and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.02519}, DOI = {10.1109/ICDM.2015.111}, EPRINT = {1705.02519}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Current recommender systems exploit user and item similarities by collaborative filtering. Some advanced methods also consider the temporal evolution of item ratings as a global background process. However, all prior methods disregard the individual evolution of a user's experience level and how this is expressed in the user's writing in a review community. In this paper, we model the joint evolution of user experience, interest in specific item facets, writing style, and rating behavior. This way we can generate individual recommendations that take into account the user's maturity level (e.g., recommending art movies rather than blockbusters for a cinematography expert). As only item ratings and review texts are observables, we capture the user's experience and interests in a latent model learned from her reviews, vocabulary and writing style. We develop a generative HMM-LDA model to trace user evolution, where the Hidden Markov Model (HMM) traces her latent experience progressing over time -- with solely user reviews and ratings as observables over time. The facets of a user's interest are drawn from a Latent Dirichlet Allocation (LDA) model derived from her reviews, as a function of her (again latent) experience level. In experiments with five real-world datasets, we show that our model improves the rating prediction over state-of-the-art baselines, by a substantial margin. We also show, in a use-case study, that our model performs well in the assessment of user experience levels.}, }
Endnote
%0 Report %A Mukherjee, Subhabrata %A Lamba, Hemank %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Item Recommendation with Evolving User Preferences and Experience : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-8103-C %R 10.1109/ICDM.2015.111 %U http://arxiv.org/abs/1705.02519 %D 2017 %X Current recommender systems exploit user and item similarities by collaborative filtering. Some advanced methods also consider the temporal evolution of item ratings as a global background process. However, all prior methods disregard the individual evolution of a user's experience level and how this is expressed in the user's writing in a review community. In this paper, we model the joint evolution of user experience, interest in specific item facets, writing style, and rating behavior. This way we can generate individual recommendations that take into account the user's maturity level (e.g., recommending art movies rather than blockbusters for a cinematography expert). As only item ratings and review texts are observables, we capture the user's experience and interests in a latent model learned from her reviews, vocabulary and writing style. We develop a generative HMM-LDA model to trace user evolution, where the Hidden Markov Model (HMM) traces her latent experience progressing over time -- with solely user reviews and ratings as observables over time. The facets of a user's interest are drawn from a Latent Dirichlet Allocation (LDA) model derived from her reviews, as a function of her (again latent) experience level. In experiments with five real-world datasets, we show that our model improves the rating prediction over state-of-the-art baselines, by a substantial margin. We also show, in a use-case study, that our model performs well in the assessment of user experience levels. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Computation and Language, cs.CL,Computer Science, Information Retrieval, cs.IR,cs.SI,Statistics, Machine Learning, stat.ML
[60]
S. Mukherjee, S. Guennemann, and G. Weikum, “Personalized Item Recommendation with Continuous Experience Evolution of Users using Brownian Motion,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02669. (arXiv: 1705.02669)
Abstract
Online review communities are dynamic as users join and leave, adopt new vocabulary, and adapt to evolving trends. Recent work has shown that recommender systems benefit from explicit consideration of user experience. However, prior work assumes a fixed number of discrete experience levels, whereas in reality users gain experience and mature continuously over time. This paper presents a new model that captures the continuous evolution of user experience, and the resulting language model in reviews and other posts. Our model is unsupervised and combines principles of Geometric Brownian Motion, Brownian Motion, and Latent Dirichlet Allocation to trace a smooth temporal progression of user experience and language model respectively. We develop practical algorithms for estimating the model parameters from data and for inference with our model (e.g., to recommend items). Extensive experiments with five real-world datasets show that our model not only fits data better than discrete-model baselines, but also outperforms state-of-the-art methods for predicting item ratings.
Export
BibTeX
@online{Mukherjee2017, TITLE = {Personalized Item Recommendation with Continuous Experience Evolution of Users using Brownian Motion}, AUTHOR = {Mukherjee, Subhabrata and Guennemann, Stephan and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.02669}, DOI = {10.1145/2939672.2939780}, EPRINT = {1705.02669}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Online review communities are dynamic as users join and leave, adopt new vocabulary, and adapt to evolving trends. Recent work has shown that recommender systems benefit from explicit consideration of user experience. However, prior work assumes a fixed number of discrete experience levels, whereas in reality users gain experience and mature continuously over time. This paper presents a new model that captures the continuous evolution of user experience, and the resulting language model in reviews and other posts. Our model is unsupervised and combines principles of Geometric Brownian Motion, Brownian Motion, and Latent Dirichlet Allocation to trace a smooth temporal progression of user experience and language model respectively. We develop practical algorithms for estimating the model parameters from data and for inference with our model (e.g., to recommend items). Extensive experiments with five real-world datasets show that our model not only fits data better than discrete-model baselines, but also outperforms state-of-the-art methods for predicting item ratings.}, }
Endnote
%0 Report %A Mukherjee, Subhabrata %A Guennemann, Stephan %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Personalized Item Recommendation with Continuous Experience Evolution of Users using Brownian Motion : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-80BE-3 %R 10.1145/2939672.2939780 %U http://arxiv.org/abs/1705.02669 %D 2017 %X Online review communities are dynamic as users join and leave, adopt new vocabulary, and adapt to evolving trends. Recent work has shown that recommender systems benefit from explicit consideration of user experience. However, prior work assumes a fixed number of discrete experience levels, whereas in reality users gain experience and mature continuously over time. This paper presents a new model that captures the continuous evolution of user experience, and the resulting language model in reviews and other posts. Our model is unsupervised and combines principles of Geometric Brownian Motion, Brownian Motion, and Latent Dirichlet Allocation to trace a smooth temporal progression of user experience and language model respectively. We develop practical algorithms for estimating the model parameters from data and for inference with our model (e.g., to recommend items). Extensive experiments with five real-world datasets show that our model not only fits data better than discrete-model baselines, but also outperforms state-of-the-art methods for predicting item ratings. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Computation and Language, cs.CL,Computer Science, Information Retrieval, cs.IR,cs.SI,Statistics, Machine Learning, stat.ML
[61]
S. Mukherjee, K. Popat, and G. Weikum, “Exploring Latent Semantic Factors to Find Useful Product Reviews,” in Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017), Houston, TX, USA, 2017.
Export
BibTeX
@inproceedings{MukherjeeSDM2017, TITLE = {Exploring Latent Semantic Factors to Find Useful Product Reviews}, AUTHOR = {Mukherjee, Subhabrata and Popat, Kashyap and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-61197-497-3}, DOI = {10.1137/1.9781611974973.54}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017)}, PAGES = {480--488}, ADDRESS = {Houston, TX, USA}, }
Endnote
%0 Conference Proceedings %A Mukherjee, Subhabrata %A Popat, Kashyap %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Exploring Latent Semantic Factors to Find Useful Product Reviews : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4CD4-6 %R 10.1137/1.9781611974973.54 %D 2017 %B 17th SIAM International Conference on Data Mining %Z date of event: 2017-04-27 - 2017-04-29 %C Houston, TX, USA %B Proceedings of the Seventeenth SIAM International Conference on Data Mining %P 480 - 488 %I SIAM %@ 978-1-61197-497-3
[62]
S. Mukherjee, K. Popat, and G. Weikum, “Exploring Latent Semantic Factors to Find Useful Product Reviews,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02518. (arXiv: 1705.02518)
Abstract
Online reviews provided by consumers are a valuable asset for e-Commerce platforms, influencing potential consumers in making purchasing decisions. However, these reviews are of varying quality, with the useful ones buried deep within a heap of non-informative reviews. In this work, we attempt to automatically identify review quality in terms of its helpfulness to the end consumers. In contrast to previous works in this domain exploiting a variety of syntactic and community-level features, we delve deep into the semantics of reviews as to what makes them useful, providing interpretable explanation for the same. We identify a set of consistency and semantic factors, all from the text, ratings, and timestamps of user-generated reviews, making our approach generalizable across all communities and domains. We explore review semantics in terms of several latent factors like the expertise of its author, his judgment about the fine-grained facets of the underlying product, and his writing style. These are cast into a Hidden Markov Model -- Latent Dirichlet Allocation (HMM-LDA) based model to jointly infer: (i) reviewer expertise, (ii) item facets, and (iii) review helpfulness. Large-scale experiments on five real-world datasets from Amazon show significant improvement over state-of-the-art baselines in predicting and ranking useful reviews.
Export
BibTeX
@online{Mukjherjee2017e, TITLE = {Exploring Latent Semantic Factors to Find Useful Product Reviews}, AUTHOR = {Mukherjee, Subhabrata and Popat, Kashyap and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.02518}, EPRINT = {1705.02518}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Online reviews provided by consumers are a valuable asset for e-Commerce platforms, influencing potential consumers in making purchasing decisions. However, these reviews are of varying quality, with the useful ones buried deep within a heap of non-informative reviews. In this work, we attempt to automatically identify review quality in terms of its helpfulness to the end consumers. In contrast to previous works in this domain exploiting a variety of syntactic and community-level features, we delve deep into the semantics of reviews as to what makes them useful, providing interpretable explanation for the same. We identify a set of consistency and semantic factors, all from the text, ratings, and timestamps of user-generated reviews, making our approach generalizable across all communities and domains. We explore review semantics in terms of several latent factors like the expertise of its author, his judgment about the fine-grained facets of the underlying product, and his writing style. These are cast into a Hidden Markov Model -- Latent Dirichlet Allocation (HMM-LDA) based model to jointly infer: (i) reviewer expertise, (ii) item facets, and (iii) review helpfulness. Large-scale experiments on five real-world datasets from Amazon show significant improvement over state-of-the-art baselines in predicting and ranking useful reviews.}, }
Endnote
%0 Report %A Mukherjee, Subhabrata %A Popat, Kashyap %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Exploring Latent Semantic Factors to Find Useful Product Reviews : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-811C-5 %U http://arxiv.org/abs/1705.02518 %D 2017 %X Online reviews provided by consumers are a valuable asset for e-Commerce platforms, influencing potential consumers in making purchasing decisions. However, these reviews are of varying quality, with the useful ones buried deep within a heap of non-informative reviews. In this work, we attempt to automatically identify review quality in terms of its helpfulness to the end consumers. In contrast to previous works in this domain exploiting a variety of syntactic and community-level features, we delve deep into the semantics of reviews as to what makes them useful, providing interpretable explanation for the same. We identify a set of consistency and semantic factors, all from the text, ratings, and timestamps of user-generated reviews, making our approach generalizable across all communities and domains. We explore review semantics in terms of several latent factors like the expertise of its author, his judgment about the fine-grained facets of the underlying product, and his writing style. These are cast into a Hidden Markov Model -- Latent Dirichlet Allocation (HMM-LDA) based model to jointly infer: (i) reviewer expertise, (ii) item facets, and (iii) review helpfulness. Large-scale experiments on five real-world datasets from Amazon show significant improvement over state-of-the-art baselines in predicting and ranking useful reviews. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Computation and Language, cs.CL,Computer Science, Information Retrieval, cs.IR,cs.SI,Statistics, Machine Learning, stat.ML
[63]
S. Mukherjee, S. Dutta, and G. Weikum, “Credible Review Detection with Limited Information using Consistency Analysis,” 2017. [Online]. Available: http://arxiv.org/abs/1705.02668. (arXiv: 1705.02668)
Abstract
Online reviews provide viewpoints on the strengths and shortcomings of products/services, influencing potential customers' purchasing decisions. However, the proliferation of non-credible reviews -- either fake (promoting/ demoting an item), incompetent (involving irrelevant aspects), or biased -- entails the problem of identifying credible reviews. Prior works involve classifiers harnessing rich information about items/users -- which might not be readily available in several domains -- that provide only limited interpretability as to why a review is deemed non-credible. This paper presents a novel approach to address the above issues. We utilize latent topic models leveraging review texts, item ratings, and timestamps to derive consistency features without relying on item/user histories, unavailable for "long-tail" items/users. We develop models, for computing review credibility scores to provide interpretable evidence for non-credible reviews, that are also transferable to other domains -- addressing the scarcity of labeled data. Experiments on real-world datasets demonstrate improvements over state-of-the-art baselines.
Export
BibTeX
@online{Mukherjee2017b, TITLE = {Credible Review Detection with Limited Information using Consistency Analysis}, AUTHOR = {Mukherjee, Subhabrata and Dutta, Sourav and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1705.02668}, EPRINT = {1705.02668}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Online reviews provide viewpoints on the strengths and shortcomings of products/services, influencing potential customers' purchasing decisions. However, the proliferation of non-credible reviews -- either fake (promoting/ demoting an item), incompetent (involving irrelevant aspects), or biased -- entails the problem of identifying credible reviews. Prior works involve classifiers harnessing rich information about items/users -- which might not be readily available in several domains -- that provide only limited interpretability as to why a review is deemed non-credible. This paper presents a novel approach to address the above issues. We utilize latent topic models leveraging review texts, item ratings, and timestamps to derive consistency features without relying on item/user histories, unavailable for "long-tail" items/users. We develop models, for computing review credibility scores to provide interpretable evidence for non-credible reviews, that are also transferable to other domains -- addressing the scarcity of labeled data. Experiments on real-world datasets demonstrate improvements over state-of-the-art baselines.}, }
Endnote
%0 Report %A Mukherjee, Subhabrata %A Dutta, Sourav %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Credible Review Detection with Limited Information using Consistency Analysis : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-80C1-A %U http://arxiv.org/abs/1705.02668 %D 2017 %X Online reviews provide viewpoints on the strengths and shortcomings of products/services, influencing potential customers' purchasing decisions. However, the proliferation of non-credible reviews -- either fake (promoting/ demoting an item), incompetent (involving irrelevant aspects), or biased -- entails the problem of identifying credible reviews. Prior works involve classifiers harnessing rich information about items/users -- which might not be readily available in several domains -- that provide only limited interpretability as to why a review is deemed non-credible. This paper presents a novel approach to address the above issues. We utilize latent topic models leveraging review texts, item ratings, and timestamps to derive consistency features without relying on item/user histories, unavailable for "long-tail" items/users. We develop models, for computing review credibility scores to provide interpretable evidence for non-credible reviews, that are also transferable to other domains -- addressing the scarcity of labeled data. Experiments on real-world datasets demonstrate improvements over state-of-the-art baselines. %K Computer Science, Artificial Intelligence, cs.AI,Computer Science, Computation and Language, cs.CL,Computer Science, Information Retrieval, cs.IR,cs.SI,Statistics, Machine Learning, stat.ML
[64]
S. Neumann, R. Gemulla, and P. Miettinen, “What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank,” in 16th IEEE International Conference on Data Mining (ICDM 2016), Barcelona, Spain, 2017.
Export
BibTeX
@inproceedings{neumann16what, TITLE = {What You Will Gain By Rounding: {Theory} and Algorithms for Rounding Rank}, AUTHOR = {Neumann, Stefan and Gemulla, Rainer and Miettinen, Pauli}, LANGUAGE = {eng}, DOI = {10.1109/ICDM.2016.147}, PUBLISHER = {IEEE}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {16th IEEE International Conference on Data Mining (ICDM 2016)}, EDITOR = {Bonchi, Francesco and Domingo-Ferrer, Josep and Baeza-Yates, Ricardo and Zhou, Zhi-Hua and Wu, Xindong}, PAGES = {380--389}, ADDRESS = {Barcelona, Spain}, }
Endnote
%0 Conference Proceedings %A Neumann, Stefan %A Gemulla, Rainer %A Miettinen, Pauli %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-2265-0 %R 10.1109/ICDM.2016.147 %D 2017 %8 02.02.2017 %B 16th International Conference on Data Mining %Z date of event: 2016-12-12 - 2016-12-15 %C Barcelona, Spain %B 16th IEEE International Conference on Data Mining %E Bonchi, Francesco; Domingo-Ferrer, Josep; Baeza-Yates, Ricardo; Zhou, Zhi-Hua; Wu, Xindong %P 380 - 389 %I IEEE
[65]
S. Neumann and P. Miettinen, “Reductions for Frequency-Based Data Mining Problems,” 2017. [Online]. Available: http://arxiv.org/abs/1709.00900. (arXiv: 1709.00900)
Abstract
Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study frequency-based problems and propose a new type of reduction that allows us to compare the complexities of the maximal frequent pattern mining problems in different domains (e.g. graphs or sequences). Our results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014] to a broader range of data mining problems. Our results show that, by allowing constraints in the pattern space, the complexities of many maximal frequent pattern mining problems collapse. These problems include maximal frequent subgraphs in labelled graphs, maximal frequent itemsets, and maximal frequent subsequences with no repetitions. In addition to theoretical interest, our results might yield more efficient algorithms for the studied problems.
Export
BibTeX
@online{Neumann_arXiv2017, TITLE = {Reductions for Frequency-Based Data Mining Problems}, AUTHOR = {Neumann, Stefan and Miettinen, Pauli}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1709.00900}, EPRINT = {1709.00900}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Studying the computational complexity of problems is one of the -- if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study frequency-based problems and propose a new type of reduction that allows us to compare the complexities of the maximal frequent pattern mining problems in different domains (e.g. graphs or sequences). Our results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014] to a broader range of data mining problems. Our results show that, by allowing constraints in the pattern space, the complexities of many maximal frequent pattern mining problems collapse. These problems include maximal frequent subgraphs in labelled graphs, maximal frequent itemsets, and maximal frequent subsequences with no repetitions. In addition to theoretical interest, our results might yield more efficient algorithms for the studied problems.}, }
Endnote
%0 Report %A Neumann, Stefan %A Miettinen, Pauli %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Reductions for Frequency-Based Data Mining Problems : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-0654-C %U http://arxiv.org/abs/1709.00900 %D 2017 %X Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study frequency-based problems and propose a new type of reduction that allows us to compare the complexities of the maximal frequent pattern mining problems in different domains (e.g. graphs or sequences). Our results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014] to a broader range of data mining problems. Our results show that, by allowing constraints in the pattern space, the complexities of many maximal frequent pattern mining problems collapse. These problems include maximal frequent subgraphs in labelled graphs, maximal frequent itemsets, and maximal frequent subsequences with no repetitions. In addition to theoretical interest, our results might yield more efficient algorithms for the studied problems. %K Computer Science, Computational Complexity, cs.CC
[66]
A. Nikitin, C. Laoudias, G. Chatzimilioudis, P. Karras, and D. Zeinalipour-Yazti, “Indoor Localization Accuracy Estimation from Fingerprint Data,” in 18th IEEE International Conference on Mobile Data Management (MDM 2017), Daejeon, South Korea, 2017.
Export
BibTeX
@inproceedings{mdm17-spate, TITLE = {Indoor Localization Accuracy Estimation from Fingerprint Data}, AUTHOR = {Nikitin, Artyom and Laoudias, Christos and Chatzimilioudis, Georgios and Karras, Panagiotis and Zeinalipour-Yazti, Demetrios}, LANGUAGE = {eng}, ISBN = {978-1-5386-3932-0}, DOI = {10.1109/MDM.2017.34}, PUBLISHER = {IEEE}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {18th IEEE International Conference on Mobile Data Management (MDM 2017)}, PAGES = {196--205}, ADDRESS = {Daejeon, South Korea}, }
Endnote
%0 Conference Proceedings %A Nikitin, Artyom %A Laoudias, Christos %A Chatzimilioudis, Georgios %A Karras, Panagiotis %A Zeinalipour-Yazti, Demetrios %+ External Organizations External Organizations External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Indoor Localization Accuracy Estimation from Fingerprint Data : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-0832-6 %R 10.1109/MDM.2017.34 %D 2017 %B 18th IEEE International Conference on Mobile Data Management %Z date of event: 2017-05-29 - 2017-06-01 %C Daejeon, South Korea %B 18th IEEE International Conference on Mobile Data Management %P 196 - 205 %I IEEE %@ 978-1-5386-3932-0
[67]
A. Nikitin, C. Laoudias, G. Chatzimilioudis, P. Karras, and D. Zeinalipour-Yazti, “ACCES: Offline Accuracy Estimation for Fingerprint-based Localization,” in 18th IEEE International Conference on Mobile Data Management (MDM 2017), Daejeon, South Korea, 2017.
Export
BibTeX
@inproceedings{mdm17-spate-demo, TITLE = {{ACCES}: Offline Accuracy Estimation for Fingerprint-based Localization}, AUTHOR = {Nikitin, Artyom and Laoudias, Christos and Chatzimilioudis, Georgios and Karras, Panagiotis and Zeinalipour-Yazti, Demetrios}, LANGUAGE = {eng}, ISBN = {978-1-5386-3932-0}, DOI = {10.1109/MDM.2017.61}, PUBLISHER = {IEEE Computer Society}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {18th IEEE International Conference on Mobile Data Management (MDM 2017)}, PAGES = {358--359}, ADDRESS = {Daejeon, South Korea}, }
Endnote
%0 Conference Proceedings %A Nikitin, Artyom %A Laoudias, Christos %A Chatzimilioudis, Georgios %A Karras, Panagiotis %A Zeinalipour-Yazti, Demetrios %+ External Organizations External Organizations External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T ACCES: Offline Accuracy Estimation for Fingerprint-based Localization : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-082D-3 %R 10.1109/MDM.2017.61 %D 2017 %B 18th IEEE International Conference on Mobile Data Management %Z date of event: 2017-05-29 - 2017-06-01 %C Daejeon, South Korea %B 18th IEEE International Conference on Mobile Data Management %P 358 - 359 %I IEEE Computer Society %@ 978-1-5386-3932-0
[68]
S. Paramonov, D. Stepanova, and P. Miettinen, “Hybrid ASP-based Approach to Pattern Mining,” in Lecture Notes in Computer Science, London, UK, 2017, vol. 10364.
Export
BibTeX
@inproceedings{StepanovaRR2017, TITLE = {Hybrid {ASP}-based Approach to Pattern Mining}, AUTHOR = {Paramonov, Sergey and Stepanova, Daria and Miettinen, Pauli}, LANGUAGE = {eng}, ISBN = {978-3-319-61251-5}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Rules and Reasoning (RuleML+RR 2017)}, PAGES = {199--214}, BOOKTITLE = {Lecture Notes in Computer Science}, VOLUME = {10364}, ADDRESS = {London, UK}, }
Endnote
%0 Conference Proceedings %A Paramonov, Sergey %A Stepanova, Daria %A Miettinen, Pauli %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Hybrid ASP-based Approach to Pattern Mining : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-8450-8 %D 2017 %B International Joint Conference on Rules and Reasoning %Z date of event: 2017-07-12 - 2017-07-15 %C London, UK %B Rules and Reasoning %P 199 - 214 %I Springer %@ 978-3-319-61251-5 %B Lecture Notes in Computer Science %V 10364
[69]
T. Pelilissier Tanon, D. Stepanova, S. Razniewski, P. Mirza, and G. Weikum, “Completeness-Aware Rule Learning from Knowledge Graphs,” in The Semantic Web -- ISWC 2017, Vienna, Austria, 2017.
Export
BibTeX
@inproceedings{StepanovaISWC2017, TITLE = {Completeness-Aware Rule Learning from Knowledge Graphs}, AUTHOR = {Pelilissier Tanon, Thomas and Stepanova, Daria and Razniewski, Simon and Mirza, Paramita and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-3-319-68287-7}, DOI = {10.1007/978-3-319-68288-4_30}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {The Semantic Web -- ISWC 2017}, EDITOR = {d'Amato, Claudia and Fernandez, Miriam and Tamma, Valentina and Lecue, Freddy and Cudr{\'e}-Mauroux, Philippe and Sequeda, Juan and Lange, Christoph and Hefflin, Jeff}, PAGES = {507--525}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {10587}, ADDRESS = {Vienna, Austria}, }
Endnote
%0 Conference Proceedings %A Pelilissier Tanon, Thomas %A Stepanova, Daria %A Razniewski, Simon %A Mirza, Paramita %A Weikum, Gerhard %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Completeness-Aware Rule Learning from Knowledge Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-55D9-3 %R 10.1007/978-3-319-68288-4_30 %D 2017 %B 16th International Semantic Web Conference %Z date of event: 2017-10-21 - 2017-10-25 %C Vienna, Austria %B The Semantic Web -- ISWC 2017 %E d'Amato, Claudia; Fernandez, Miriam; Tamma, Valentina; Lecue, Freddy; Cudré-Mauroux, Philippe; Sequeda, Juan; Lange, Christoph; Hefflin, Jeff %P 507 - 525 %I Springer %@ 978-3-319-68287-7 %B Lecture Notes in Computer Science %N 10587 %U https://iswc2017.ai.wu.ac.at/wp-content/uploads/papers/MainProceedings/324.pdf
[70]
R. Pienta, M. Kahng, Z. Lin, J. Vreeken, P. Talukdar, J. Abello, G. Parameswaran, and D. H. Chau, “FACETS: Adaptive Local Exploration of Large Graphs,” in Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017), Houston, TX, USA, 2017.
Export
BibTeX
@inproceedings{pienta:17:facets, TITLE = {{FACETS}: {A}daptive Local Exploration of Large Graphs}, AUTHOR = {Pienta, Robert and Kahng, Minsuk and Lin, Zhang and Vreeken, Jilles and Talukdar, Partha and Abello, James and Parameswaran, Ganesh and Chau, Duen Horng}, LANGUAGE = {eng}, ISBN = {978-1-611974-87-4}, DOI = {10.1137/1.9781611974973.67}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017)}, EDITOR = {Chawla, Nitesh and Wang, Wei}, PAGES = {597--605}, ADDRESS = {Houston, TX, USA}, }
Endnote
%0 Conference Proceedings %A Pienta, Robert %A Kahng, Minsuk %A Lin, Zhang %A Vreeken, Jilles %A Talukdar, Partha %A Abello, James %A Parameswaran, Ganesh %A Chau, Duen Horng %+ External Organizations External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T FACETS: Adaptive Local Exploration of Large Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4BEA-D %R 10.1137/1.9781611974973.67 %D 2017 %B 17th SIAM International Conference on Data Mining %Z date of event: 2017-04-27 - 2017-04-29 %C Houston, TX, USA %B Proceedings of the Seventeenth SIAM International Conference on Data Mining %E Chawla, Nitesh; Wang, Wei %P 597 - 605 %I SIAM %@ 978-1-611974-87-4
[71]
E. Pitoura, P. Tsaparas, G. Flouris, I. Fundulaki, P. Papadakos, S. Abiteboul, and G. Weikum, “On Measuring Bias in Online Information,” 2017. [Online]. Available: http://arxiv.org/abs/1704.05730. (arXiv: 1704.05730)
Abstract
Bias in online information has recently become a pressing issue, with search engines, social networks and recommendation services being accused of exhibiting some form of bias. In this vision paper, we make the case for a systematic approach towards measuring bias. To this end, we discuss formal measures for quantifying the various types of bias, we outline the system components necessary for realizing them, and we highlight the related research challenges and open problems.
Export
BibTeX
@online{Pitoura2017, TITLE = {On Measuring Bias in Online Information}, AUTHOR = {Pitoura, Evaggelia and Tsaparas, Panayiotis and Flouris, Giorgos and Fundulaki, Irini and Papadakos, Panagiotis and Abiteboul, Serge and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1704.05730}, EPRINT = {1704.05730}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Bias in online information has recently become a pressing issue, with search engines, social networks and recommendation services being accused of exhibiting some form of bias. In this vision paper, we make the case for a systematic approach towards measuring bias. To this end, we discuss formal measures for quantifying the various types of bias, we outline the system components necessary for realizing them, and we highlight the related research challenges and open problems.}, }
Endnote
%0 Report %A Pitoura, Evaggelia %A Tsaparas, Panayiotis %A Flouris, Giorgos %A Fundulaki, Irini %A Papadakos, Panagiotis %A Abiteboul, Serge %A Weikum, Gerhard %+ External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T On Measuring Bias in Online Information : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-8123-4 %U http://arxiv.org/abs/1704.05730 %D 2017 %X Bias in online information has recently become a pressing issue, with search engines, social networks and recommendation services being accused of exhibiting some form of bias. In this vision paper, we make the case for a systematic approach towards measuring bias. To this end, we discuss formal measures for quantifying the various types of bias, we outline the system components necessary for realizing them, and we highlight the related research challenges and open problems. %K Computer Science, Databases, cs.DB,Computer Science, Computers and Society, cs.CY
[72]
K. Popat, “Assessing the Credibility of Claims on the Web,” in WWW’17 Companion, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{PopatWWW2017b, TITLE = {Assessing the Credibility of Claims on the {Web}}, AUTHOR = {Popat, Kashyap}, LANGUAGE = {eng}, ISBN = {978-1-4503-4914-7}, DOI = {10.1145/3041021.3053379}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17 Companion}, PAGES = {735--739}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Popat, Kashyap %+ Databases and Information Systems, MPI for Informatics, Max Planck Society %T Assessing the Credibility of Claims on the Web : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-90CC-2 %R 10.1145/3041021.3053379 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 Companion %P 735 - 739 %I ACM %@ 978-1-4503-4914-7
[73]
K. Popat, S. Mukherjee, J. Strötgen, and G. Weikum, “Where the Truth Lies: Explaining the Credibility of Emerging Claims on the Web and Social Media,” in WWW’17 Companion, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{PopatWWW2017, TITLE = {Where the Truth Lies: {E}xplaining the Credibility of Emerging Claims on the {W}eb and Social Media}, AUTHOR = {Popat, Kashyap and Mukherjee, Subhabrata and Str{\"o}tgen, Jannik and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-4503-4914-7}, DOI = {10.1145/3041021.3055133}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17 Companion}, PAGES = {1003--1012}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Popat, Kashyap %A Mukherjee, Subhabrata %A Strötgen, Jannik %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Where the Truth Lies: Explaining the Credibility of Emerging Claims on the Web and Social Media : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-4CD8-D %R 10.1145/3041021.3055133 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 Companion %P 1003 - 1012 %I ACM %@ 978-1-4503-4914-7
[74]
S. Razniewski, V. Balaraman, and W. Nutt, “Doctoral Advisor or Medical Condition: Towards Entity-Specific Rankings of Knowledge Base Properties,” in Advanced Data Mining and Applications (ADMA 2017), Singapore, 2017.
Export
BibTeX
@inproceedings{Razniewski_ADMA2017, TITLE = {Doctoral Advisor or Medical Condition: {T}owards Entity-Specific Rankings of Knowledge Base Properties}, AUTHOR = {Razniewski, Simon and Balaraman, Vevake and Nutt, Werner}, LANGUAGE = {eng}, ISBN = {978-3-319-69178-7}, DOI = {10.1007/978-3-319-69179-4_37}, PUBLISHER = {Springer}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Advanced Data Mining and Applications (ADMA 2017)}, EDITOR = {Cong, Gao and Peng, Wen-Chin and Zhang, Wei Emma and Li, Chengliang and Sun, Aixin}, PAGES = {526--540}, SERIES = {Lecture Notes in Artificial Intelligence}, VOLUME = {10604}, ADDRESS = {Singapore}, }
Endnote
%0 Conference Proceedings %A Razniewski, Simon %A Balaraman, Vevake %A Nutt, Werner %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Doctoral Advisor or Medical Condition: Towards Entity-Specific Rankings of Knowledge Base Properties : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-2C05-A %R 10.1007/978-3-319-69179-4_37 %D 2017 %B 13th International Conference on Advanced Data Mining and Applications %Z date of event: 2017-11-05 - 2017-11-06 %C Singapore %B Advanced Data Mining and Applications %E Cong, Gao; Peng, Wen-Chin; Zhang, Wei Emma; Li, Chengliang; Sun, Aixin %P 526 - 540 %I Springer %@ 978-3-319-69178-7 %B Lecture Notes in Artificial Intelligence %N 10604
[75]
N. Reiter, E. Gius, J. Strötgen, and M. Willand, “A Shared Task for a Shared Goal: Systematic Annotation of Literary,” in Digital Humanities 2017 (DH 2017), Montréal, Canada. (Accepted/in press)
Export
BibTeX
@inproceedings{StroetgenDH2017, TITLE = {A Shared Task for a Shared Goal: {S}ystematic Annotation of Literary}, AUTHOR = {Reiter, Nils and Gius, Evelyn and Str{\"o}tgen, Jannik and Willand, Marcus}, LANGUAGE = {eng}, YEAR = {2017}, PUBLREMARK = {Accepted}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {Digital Humanities 2017 (DH 2017)}, ADDRESS = {Montr{\'e}al, Canada}, }
Endnote
%0 Conference Proceedings %A Reiter, Nils %A Gius, Evelyn %A Strötgen, Jannik %A Willand, Marcus %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T A Shared Task for a Shared Goal: Systematic Annotation of Literary : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-7BDC-3 %D 2017 %B Digital Humanities %Z date of event: 2017-08-08 - 2017-08-11 %C Montréal, Canada %B Digital Humanities 2017
[76]
B. Roel, J. Vreeken, and A. Siebes, “Efficiently Discovering Unexpected Pattern-Co-Occurrences,” in Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017), Houston, TX, USA, 2017.
Export
BibTeX
@inproceedings{RoelSDM2017, TITLE = {Efficiently Discovering Unexpected Pattern-Co-Occurrences}, AUTHOR = {Roel, Bertens and Vreeken, Jilles and Siebes, Arno}, LANGUAGE = {eng}, ISBN = {978-1-611974-87-4}, DOI = {10.1137/1.9781611974973.15}, PUBLISHER = {SIAM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Proceedings of the Seventeenth SIAM International Conference on Data Mining (SDM 2017)}, EDITOR = {Chawla, Nitesh and Wang, Wei}, PAGES = {126--134}, ADDRESS = {Houston, TX, USA}, }
Endnote
%0 Conference Proceedings %A Roel, Bertens %A Vreeken, Jilles %A Siebes, Arno %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Efficiently Discovering Unexpected Pattern-Co-Occurrences : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-066E-3 %R 10.1137/1.9781611974973.15 %D 2017 %B 17th SIAM International Conference on Data Mining %Z date of event: 2017-04-27 - 2017-04-29 %C Houston, TX, USA %B Proceedings of the Seventeenth SIAM International Conference on Data Mining %E Chawla, Nitesh; Wang, Wei %P 126 - 134 %I SIAM %@ 978-1-611974-87-4
[77]
A. Rohrbach, A. Torabi, M. Rohrbach, N. Tandon, C. Pal, H. Larochelle, A. Courville, and B. Schiele, “Movie Description,” International Journal of Computer Vision, vol. 123, no. 1, 2017.
Abstract
Audio Description (AD) provides linguistic descriptions of movies and allows visually impaired people to follow a movie along with their peers. Such descriptions are by design mainly visual and thus naturally form an interesting data source for computer vision and computational linguistics. In this work we propose a novel dataset which contains transcribed ADs, which are temporally aligned to full length movies. In addition we also collected and aligned movie scripts used in prior work and compare the two sources of descriptions. In total the Large Scale Movie Description Challenge (LSMDC) contains a parallel corpus of 118,114 sentences and video clips from 202 movies. First we characterize the dataset by benchmarking different approaches for generating video descriptions. Comparing ADs to scripts, we find that ADs are indeed more visual and describe precisely what is shown rather than what should happen according to the scripts created prior to movie production. Furthermore, we present and compare the results of several teams who participated in a challenge organized in the context of the workshop "Describing and Understanding Video & The Large Scale Movie Description Challenge (LSMDC)", at ICCV 2015.
Export
BibTeX
@article{RohrbachMovie, TITLE = {Movie Description}, AUTHOR = {Rohrbach, Anna and Torabi, Atousa and Rohrbach, Marcus and Tandon, Niket and Pal, Christopher and Larochelle, Hugo and Courville, Aaron and Schiele, Bernt}, LANGUAGE = {eng}, DOI = {10.1007/s11263-016-0987-1}, PUBLISHER = {Springer}, ADDRESS = {London}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, ABSTRACT = {Audio Description (AD) provides linguistic descriptions of movies and allows visually impaired people to follow a movie along with their peers. Such descriptions are by design mainly visual and thus naturally form an interesting data source for computer vision and computational linguistics. In this work we propose a novel dataset which contains transcribed ADs, which are temporally aligned to full length movies. In addition we also collected and aligned movie scripts used in prior work and compare the two sources of descriptions. In total the Large Scale Movie Description Challenge (LSMDC) contains a parallel corpus of 118,114 sentences and video clips from 202 movies. First we characterize the dataset by benchmarking different approaches for generating video descriptions. Comparing ADs to scripts, we find that ADs are indeed more visual and describe precisely what is shown rather than what should happen according to the scripts created prior to movie production. Furthermore, we present and compare the results of several teams who participated in a challenge organized in the context of the workshop "Describing and Understanding Video & The Large Scale Movie Description Challenge (LSMDC)", at ICCV 2015.}, JOURNAL = {International Journal of Computer Vision}, VOLUME = {123}, NUMBER = {1}, PAGES = {94--120}, }
Endnote
%0 Journal Article %A Rohrbach, Anna %A Torabi, Atousa %A Rohrbach, Marcus %A Tandon, Niket %A Pal, Christopher %A Larochelle, Hugo %A Courville, Aaron %A Schiele, Bernt %+ Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society %T Movie Description : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002A-FD03-C %R 10.1007/s11263-016-0987-1 %7 2017-01-25 %D 2017 %X Audio Description (AD) provides linguistic descriptions of movies and allows visually impaired people to follow a movie along with their peers. Such descriptions are by design mainly visual and thus naturally form an interesting data source for computer vision and computational linguistics. In this work we propose a novel dataset which contains transcribed ADs, which are temporally aligned to full length movies. In addition we also collected and aligned movie scripts used in prior work and compare the two sources of descriptions. In total the Large Scale Movie Description Challenge (LSMDC) contains a parallel corpus of 118,114 sentences and video clips from 202 movies. First we characterize the dataset by benchmarking different approaches for generating video descriptions. Comparing ADs to scripts, we find that ADs are indeed more visual and describe precisely what is shown rather than what should happen according to the scripts created prior to movie production. Furthermore, we present and compare the results of several teams who participated in a challenge organized in the context of the workshop "Describing and Understanding Video & The Large Scale Movie Description Challenge (LSMDC)", at ICCV 2015. %K Computer Science, Computer Vision and Pattern Recognition, cs.CV,Computer Science, Computation and Language, cs.CL %J International Journal of Computer Vision %O IJCV %V 123 %N 1 %& 94 %P 94 - 120 %I Springer %C London
[78]
V. Setty, A. Anand, A. Mishra, and A. Anand, “Modeling Event Importance for Ranking Daily News Events,” in WSDM’17, 10th ACM International Conference on Web Search and Data Mining, Cambridge, UK, 2017.
Export
BibTeX
@inproceedings{Setii2017, TITLE = {Modeling Event Importance for Ranking Daily News Events}, AUTHOR = {Setty, Vinay and Anand, Abhijit and Mishra, Arunav and Anand, Avishek}, LANGUAGE = {eng}, ISBN = {978-1-4503-4675-7}, DOI = {10.1145/3018661.3018728}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WSDM'17, 10th ACM International Conference on Web Search and Data Mining}, PAGES = {231--240}, ADDRESS = {Cambridge, UK}, }
Endnote
%0 Conference Proceedings %A Setty, Vinay %A Anand, Abhijit %A Mishra, Arunav %A Anand, Avishek %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Modeling Event Importance for Ranking Daily News Events : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-26D5-9 %R 10.1145/3018661.3018728 %D 2017 %B 10th ACM International Conference on Web Search and Data Mining %Z date of event: 2017-02-06 - 2017-02-10 %C Cambridge, UK %B WSDM'17 %P 231 - 240 %I ACM %@ 978-1-4503-4675-7
[79]
D. Seyler, T. Dembelova, L. Del Corro, J. Hoffart, and G. Weikum, “KnowNER: Incremental Multilingual Knowledge in Named Entity Recognition,” 2017. [Online]. Available: http://arxiv.org/abs/1709.03544. (arXiv: 1709.03544)
Abstract
KnowNER is a multilingual Named Entity Recognition (NER) system that leverages different degrees of external knowledge. A novel modular framework divides the knowledge into four categories according to the depth of knowledge they convey. Each category consists of a set of features automatically generated from different information sources (such as a knowledge-base, a list of names or document-specific semantic annotations) and is used to train a conditional random field (CRF). Since those information sources are usually multilingual, KnowNER can be easily trained for a wide range of languages. In this paper, we show that the incorporation of deeper knowledge systematically boosts accuracy and compare KnowNER with state-of-the-art NER approaches across three languages (i.e., English, German and Spanish) performing amongst state-of-the art systems in all of them.
Export
BibTeX
@online{Seyler_arXiv2017, TITLE = {{KnowNER}: Incremental Multilingual {Knowledge} in {Named Entity Recognition}}, AUTHOR = {Seyler, Dominic and Dembelova, Tatiana and Del Corro, Luciano and Hoffart, Johannes and Weikum, Gerhard}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1709.03544}, EPRINT = {1709.03544}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {KnowNER is a multilingual Named Entity Recognition (NER) system that leverages different degrees of external knowledge. A novel modular framework divides the knowledge into four categories according to the depth of knowledge they convey. Each category consists of a set of features automatically generated from different information sources (such as a knowledge-base, a list of names or document-specific semantic annotations) and is used to train a conditional random field (CRF). Since those information sources are usually multilingual, KnowNER can be easily trained for a wide range of languages. In this paper, we show that the incorporation of deeper knowledge systematically boosts accuracy and compare KnowNER with state-of-the-art NER approaches across three languages (i.e., English, German and Spanish) performing amongst state-of-the art systems in all of them.}, }
Endnote
%0 Report %A Seyler, Dominic %A Dembelova, Tatiana %A Del Corro, Luciano %A Hoffart, Johannes %A Weikum, Gerhard %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T KnowNER: Incremental Multilingual Knowledge in Named Entity Recognition : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-0693-D %U http://arxiv.org/abs/1709.03544 %D 2017 %X KnowNER is a multilingual Named Entity Recognition (NER) system that leverages different degrees of external knowledge. A novel modular framework divides the knowledge into four categories according to the depth of knowledge they convey. Each category consists of a set of features automatically generated from different information sources (such as a knowledge-base, a list of names or document-specific semantic annotations) and is used to train a conditional random field (CRF). Since those information sources are usually multilingual, KnowNER can be easily trained for a wide range of languages. In this paper, we show that the incorporation of deeper knowledge systematically boosts accuracy and compare KnowNER with state-of-the-art NER approaches across three languages (i.e., English, German and Spanish) performing amongst state-of-the art systems in all of them. %K Computer Science, Computation and Language, cs.CL
[80]
D. Seyler, M. Yahya, and K. Berberich, “Knowledge Questions from Knowledge Graphs,” in ICTIR’17, 7th International Conference on the Theory of Information Retrieval, Amsterdam, The Netherlands, 2017.
Export
BibTeX
@inproceedings{SeylerICTIR2017, TITLE = {Knowledge Questions from Knowledge Graphs}, AUTHOR = {Seyler, Dominic and Yahya, Mohamed and Berberich, Klaus}, LANGUAGE = {eng}, ISBN = {978-1-4503-4490-6}, DOI = {10.1145/3121050.3121073}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {ICTIR'17, 7th International Conference on the Theory of Information Retrieval}, PAGES = {11--18}, ADDRESS = {Amsterdam, The Netherlands}, }
Endnote
%0 Conference Proceedings %A Seyler, Dominic %A Yahya, Mohamed %A Berberich, Klaus %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Knowledge Questions from Knowledge Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-0647-A %R 10.1145/3121050.3121073 %D 2017 %B 7th International Conference on the Theory of Information Retrieval %Z date of event: 2017-10-01 - 2017-10-04 %C Amsterdam, The Netherlands %B ICTIR'17 %P 11 - 18 %I ACM %@ 978-1-4503-4490-6
[81]
L. Soldaini, A. Yates, and N. Goharian, “Learning to Reformulate Long Queries for Clinical Decision Support,” Journal of the Association for Information Science and Technology, vol. 68, no. 11, 2017.
Export
BibTeX
@article{Soldaini2017, TITLE = {Learning to Reformulate Long Queries for Clinical Decision Support}, AUTHOR = {Soldaini, Luca and Yates, Andrew and Goharian, Nazli}, LANGUAGE = {eng}, ISSN = {2330-1635}, DOI = {10.1002/asi.23924}, PUBLISHER = {Wiley}, ADDRESS = {Chichester, UK}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, JOURNAL = {Journal of the Association for Information Science and Technology}, VOLUME = {68}, NUMBER = {11}, PAGES = {2602--2619}, }
Endnote
%0 Journal Article %A Soldaini, Luca %A Yates, Andrew %A Goharian, Nazli %+ External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Learning to Reformulate Long Queries for Clinical Decision Support : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-2723-C %R 10.1002/asi.23924 %7 2017-09-14 %D 2017 %8 14.09.2017 %J Journal of the Association for Information Science and Technology %O asis&t %V 68 %N 11 %& 2602 %P 2602 - 2619 %I Wiley %C Chichester, UK %@ false
[82]
J. Stoyanovich, B. Howe, S. Abiteboul, G. Miklau, A. Sahuguet, and G. Weikum, “Fides: Towards a Platform for Responsible Data Science,” in 29th International Conference on Scientific and Statistical Database Management (SSDBM 2017), Chicago, IL, USA, 2017.
Export
BibTeX
@inproceedings{StoyanovichSSDBM2017, TITLE = {Fides: {T}owards a Platform for Responsible Data Science}, AUTHOR = {Stoyanovich, Julia and Howe, Bill and Abiteboul, Serge and Miklau, Gerome and Sahuguet, Arnaud and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-4503-5282-6}, DOI = {10.1145/3085504.3085530}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {29th International Conference on Scientific and Statistical Database Management (SSDBM 2017)}, EID = {26}, ADDRESS = {Chicago, IL, USA}, }
Endnote
%0 Conference Proceedings %A Stoyanovich, Julia %A Howe, Bill %A Abiteboul, Serge %A Miklau, Gerome %A Sahuguet, Arnaud %A Weikum, Gerhard %+ External Organizations External Organizations External Organizations External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Fides: Towards a Platform for Responsible Data Science : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-80BA-B %R 10.1145/3085504.3085530 %D 2017 %B 29th International Conference on Scientific and Statistical Database Management %Z date of event: 2017-06-27 - 2017-06-29 %C Chicago, IL, USA %B 29th International Conference on Scientific and Statistical Database Management %Z sequence number: 26 %I ACM %@ 978-1-4503-5282-6
[83]
N. Tandon, G. de Melo, and G. Weikum, “WebChild 2.0: Fine-Grained Commonsense Knowledge Distillation,” in The 55th Annual Meeting of the Association for Computational Linguistics (ACL 2017), Vancouver, Canada, 2017.
Export
BibTeX
@inproceedings{TandonACL2017, TITLE = {{WebChild} 2.0: {F}ine-Grained Commonsense Knowledge Distillation}, AUTHOR = {Tandon, Niket and de Melo, Gerard and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-945626-76-0}, DOI = {10.18653/v1/P17-4020}, PUBLISHER = {ACL}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {The 55th Annual Meeting of the Association for Computational Linguistics (ACL 2017)}, PAGES = {115--120}, ADDRESS = {Vancouver, Canada}, }
Endnote
%0 Conference Proceedings %A Tandon, Niket %A de Melo, Gerard %A Weikum, Gerhard %+ External Organizations External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T WebChild 2.0: Fine-Grained Commonsense Knowledge Distillation : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-FAC3-A %R 10.18653/v1/P17-4020 %D 2017 %B The 55th Annual Meeting of the Association for Computational Linguistics %Z date of event: 2017-07-30 - 2017-08-04 %C Vancouver, Canada %B The 55th Annual Meeting of the Association for Computational Linguistics %P 115 - 120 %I ACL %@ 978-1-945626-76-0
[84]
C. Teflioudi and R. Gemulla, “Exact and Approximate Maximum Inner Product Search with LEMP,” ACM Transactions on Database Systems, vol. 42, no. 1, 2017.
Export
BibTeX
@article{Teflioudi:2016:EAM:3015779.2996452, TITLE = {Exact and Approximate Maximum Inner Product Search with {LEMP}}, AUTHOR = {Teflioudi, Christina and Gemulla, Rainer}, LANGUAGE = {eng}, ISSN = {0362-5915}, DOI = {10.1145/2996452}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, JOURNAL = {ACM Transactions on Database Systems}, VOLUME = {42}, NUMBER = {1}, EID = {5}, }
Endnote
%0 Journal Article %A Teflioudi, Christina %A Gemulla, Rainer %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations %T Exact and Approximate Maximum Inner Product Search with LEMP : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-349C-B %R 10.1145/2996452 %7 2016 %D 2017 %J ACM Transactions on Database Systems %O TODS %V 42 %N 1 %Z sequence number: 5 %I ACM %C New York, NY %@ false
[85]
H. D. Tran, D. Stepanova, M. Gad-Elrab, F. A. Lisi, and G. Weikum, “Towards Nonmonotonic Relational Learning from Knowledge Graphs,” in Inductive Logic Programming (ILP 2016), London, UK, 2017.
Export
BibTeX
@inproceedings{TranILP2016, TITLE = {Towards Nonmonotonic Relational Learning from Knowledge Graphs}, AUTHOR = {Tran, Hai Dang and Stepanova, Daria and Gad-Elrab, Mohamed and Lisi, Francesca A. and Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-3-319-63341-1}, DOI = {10.1007/978-3-319-63342-8_8}, PUBLISHER = {Springer}, YEAR = {2016}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {Inductive Logic Programming (ILP 2016)}, EDITOR = {Cussens, James and Russo, Alessandra}, PAGES = {94--107}, SERIES = {Lecture Notes in Artificial Intelligence}, VOLUME = {10326}, ADDRESS = {London, UK}, }
Endnote
%0 Conference Proceedings %A Tran, Hai Dang %A Stepanova, Daria %A Gad-Elrab, Mohamed %A Lisi, Francesca A. %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations Databases and Information Systems, MPI for Informatics, Max Planck Society %T Towards Nonmonotonic Relational Learning from Knowledge Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002C-2DB1-E %R 10.1007/978-3-319-63342-8_8 %D 2017 %B 26th International Conference on Inductive Logic Programming %Z date of event: 2016-09-04 - 2016-09-06 %C London, UK %B Inductive Logic Programming %E Cussens, James; Russo, Alessandra %P 94 - 107 %I Springer %@ 978-3-319-63341-1 %B Lecture Notes in Artificial Intelligence %N 10326
[86]
H. D. Tran, “An Approach to Nonmonotonic Relational Learning from Knowledge Graphs,” Universität des Saarlandes, Saarbrücken, 2017.
Export
BibTeX
@mastersthesis{TranMSc2017, TITLE = {An Approach to Nonmonotonic Relational Learning from Knowledge Graphs}, AUTHOR = {Tran, Hai Dang}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, }
Endnote
%0 Thesis %A Tran, Hai Dang %Y Stepanova, Daria %A referee: Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T An Approach to Nonmonotonic Relational Learning from Knowledge Graphs : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-845A-3 %I Universität des Saarlandes %C Saarbrücken %D 2017 %P XV, 48 p. %V master %9 master
[87]
G. Weikum, “What Computers Should Know, Shouldn’t Know, and Shouldn’t Believe,” in WWW’17 Companion, Perth, Australia, 2017.
Export
BibTeX
@inproceedings{WeikumWWW2017, TITLE = {What Computers Should Know, Shouldn{\textquoteright}t Know, and Shouldn{\textquoteright}t Believe}, AUTHOR = {Weikum, Gerhard}, LANGUAGE = {eng}, ISBN = {978-1-4503-4914-7}, DOI = {10.1145/3041021.3051120}, PUBLISHER = {ACM}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {WWW'17 Companion}, PAGES = {1559--1560}, ADDRESS = {Perth, Australia}, }
Endnote
%0 Conference Proceedings %A Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society %T What Computers Should Know, Shouldn’t Know, and Shouldn’t Believe : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-7DA0-5 %R 10.1145/3041021.3051120 %D 2017 %B 26th International Conference on World Wide Web %Z date of event: 2017-04-03 - 2017-04-07 %C Perth, Australia %B WWW'17 Companion %P 1559 - 1560 %I ACM %@ 978-1-4503-4914-7
[88]
A. Yates, A. Cohan, and N. Goharian, “Depression and Self-Harm Risk Assessment in Online Forums,” 2017. [Online]. Available: http://arxiv.org/abs/1709.01848. (arXiv: 1709.01848)
Abstract
Users suffering from mental health conditions often turn to online resources for support, including specialized online support communities or general communities such as Twitter and Reddit. In this work, we present a neural framework for supporting and studying users in both types of communities. We propose methods for identifying posts in support communities that may indicate a risk of self-harm, and demonstrate that our approach outperforms strong previously proposed methods for identifying such posts. Self-harm is closely related to depression, which makes identifying depressed users on general forums a crucial related task. We introduce a large-scale general forum dataset ("RSDD") consisting of users with self-reported depression diagnoses matched with control users. We show how our method can be applied to effectively identify depressed users from their use of language alone. We demonstrate that our method outperforms strong baselines on this general forum dataset.
Export
BibTeX
@online{Yates_arXiv2017b, TITLE = {Depression and Self-Harm Risk Assessment in Online Forums}, AUTHOR = {Yates, Andrew and Cohan, Arman and Goharian, Nazli}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1709.01848}, EPRINT = {1709.01848}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Users suffering from mental health conditions often turn to online resources for support, including specialized online support communities or general communities such as Twitter and Reddit. In this work, we present a neural framework for supporting and studying users in both types of communities. We propose methods for identifying posts in support communities that may indicate a risk of self-harm, and demonstrate that our approach outperforms strong previously proposed methods for identifying such posts. Self-harm is closely related to depression, which makes identifying depressed users on general forums a crucial related task. We introduce a large-scale general forum dataset ("RSDD") consisting of users with self-reported depression diagnoses matched with control users. We show how our method can be applied to effectively identify depressed users from their use of language alone. We demonstrate that our method outperforms strong baselines on this general forum dataset.}, }
Endnote
%0 Report %A Yates, Andrew %A Cohan, Arman %A Goharian, Nazli %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Depression and Self-Harm Risk Assessment in Online Forums : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-06C8-6 %U http://arxiv.org/abs/1709.01848 %D 2017 %X Users suffering from mental health conditions often turn to online resources for support, including specialized online support communities or general communities such as Twitter and Reddit. In this work, we present a neural framework for supporting and studying users in both types of communities. We propose methods for identifying posts in support communities that may indicate a risk of self-harm, and demonstrate that our approach outperforms strong previously proposed methods for identifying such posts. Self-harm is closely related to depression, which makes identifying depressed users on general forums a crucial related task. We introduce a large-scale general forum dataset ("RSDD") consisting of users with self-reported depression diagnoses matched with control users. We show how our method can be applied to effectively identify depressed users from their use of language alone. We demonstrate that our method outperforms strong baselines on this general forum dataset. %K Computer Science, Computation and Language, cs.CL
[89]
A. Yates, A. Cohan, and N. Goharian, “Depression and Self-Harm Risk Assessment in Online Forums,” in The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017), Copenhagen, Denmark, 2017.
Export
BibTeX
@inproceedings{YatesENMLP2017, TITLE = {Depression and Self-Harm Risk Assessment in Online Forums}, AUTHOR = {Yates, Andrew and Cohan, Arman and Goharian, Nazli}, LANGUAGE = {eng}, ISBN = {978-1-945626-83-8}, URL = {https://aclanthology.info/pdf/D/D17/D17-1321.pdf}, PUBLISHER = {ACL}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, BOOKTITLE = {The Conference on Empirical Methods in Natural Language Processing (EMNLP 2017)}, PAGES = {2958--2968}, ADDRESS = {Copenhagen, Denmark}, }
Endnote
%0 Conference Proceedings %A Yates, Andrew %A Cohan, Arman %A Goharian, Nazli %+ Databases and Information Systems, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Depression and Self-Harm Risk Assessment in Online Forums : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-06A0-D %U https://aclanthology.info/pdf/D/D17/D17-1321.pdf %D 2017 %B Conference on Empirical Methods in Natural Language Processing %Z date of event: 2017-09-09 - 2017-09-11 %C Copenhagen, Denmark %B The Conference on Empirical Methods in Natural Language Processing %P 2958 - 2968 %I ACL %@ 978-1-945626-83-8 %U https://aclanthology.info/pdf/D/D17/D17-1321.pdf
[90]
A. Yates and K. Hui, “DE-PACRR: Exploring Layers Inside the PACRR Model,” 2017. [Online]. Available: http://arxiv.org/abs/1706.08746. (arXiv: 1706.08746)
Abstract
Recent neural IR models have demonstrated deep learning's utility in ad-hoc information retrieval. However, deep models have a reputation for being black boxes, and the roles of a neural IR model's components may not be obvious at first glance. In this work, we attempt to shed light on the inner workings of a recently proposed neural IR model, namely the PACRR model, by visualizing the output of intermediate layers and by investigating the relationship between intermediate weights and the ultimate relevance score produced. We highlight several insights, hoping that such insights will be generally applicable.
Export
BibTeX
@online{Yates_arXiv2017, TITLE = {{DE}-{PACRR}: Exploring Layers Inside the {PACRR} Model}, AUTHOR = {Yates, Andrew and Hui, Kai}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1706.08746}, EPRINT = {1706.08746}, EPRINTTYPE = {arXiv}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Recent neural IR models have demonstrated deep learning's utility in ad-hoc information retrieval. However, deep models have a reputation for being black boxes, and the roles of a neural IR model's components may not be obvious at first glance. In this work, we attempt to shed light on the inner workings of a recently proposed neural IR model, namely the PACRR model, by visualizing the output of intermediate layers and by investigating the relationship between intermediate weights and the ultimate relevance score produced. We highlight several insights, hoping that such insights will be generally applicable.}, }
Endnote
%0 Report %A Yates, Andrew %A Hui, Kai %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T DE-PACRR: Exploring Layers Inside the PACRR Model : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002E-06BE-D %U http://arxiv.org/abs/1706.08746 %D 2017 %X Recent neural IR models have demonstrated deep learning's utility in ad-hoc information retrieval. However, deep models have a reputation for being black boxes, and the roles of a neural IR model's components may not be obvious at first glance. In this work, we attempt to shed light on the inner workings of a recently proposed neural IR model, namely the PACRR model, by visualizing the output of intermediate layers and by investigating the relationship between intermediate weights and the ultimate relevance score produced. We highlight several insights, hoping that such insights will be generally applicable. %K Computer Science, Information Retrieval, cs.IR,Computer Science, Computation and Language, cs.CL
[91]
D. Ziegler, “Answer Type Prediction for Question Answering over Knowledge Bases,” Universität des Saarlandes, Saarbrücken, 2017.
Export
BibTeX
@mastersthesis{ZieglerMSc2017, TITLE = {Answer Type Prediction for Question Answering over Knowledge Bases}, AUTHOR = {Ziegler, David}, LANGUAGE = {eng}, SCHOOL = {Universit{\"a}t des Saarlandes}, ADDRESS = {Saarbr{\"u}cken}, YEAR = {2017}, MARGINALMARK = {$\bullet$}, DATE = {2017}, }
Endnote
%0 Thesis %A Ziegler, David %Y Abujabal, Abdalghani %A referee: Roy, Rishiraj Saha %A referee: Weikum, Gerhard %+ Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society Databases and Information Systems, MPI for Informatics, Max Planck Society %T Answer Type Prediction for Question Answering over Knowledge Bases : %G eng %U http://hdl.handle.net/11858/00-001M-0000-002D-8F38-A %I Universität des Saarlandes %C Saarbrücken %D 2017 %P X, 48 p. %V master %9 master