Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amina Kadry

dblp:150/7837 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 33% Data mining · 33% Knowledge graphs · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › search engines › semantic search
entity retrieval
0.312017
Open Relation Extraction for Support Passage Retrieval: Merit and Open Issues · SIGIR 2017
Data mining › text mining
information extraction
0.312017
Open Relation Extraction for Support Passage Retrieval: Merit and Open Issues · SIGIR 2017
Knowledge graphs
relation extraction
0.312017
Open Relation Extraction for Support Passage Retrieval: Merit and Open Issues · SIGIR 2017

Methods — techniques the papers use, named apart from their topics

unsupervised relation extraction · 0.3OpenIE · 0.3
YearPublicationVenuePosition
2017 Open Relation Extraction for Support Passage Retrieval: Merit and Open Issues
abstract
Our goal is to complement an entity ranking with human-readable explanations of how those retrieved entities are connected to the information need. Relation extraction technology should aid in finding such support passages, especially in combination with entities and query terms. This work explores how the current state of the art in unsupervised relation extraction (OpenIE) contributes to a solution for the task, assessing potential, limitations, and avenues for further investigation.
Amina Kadry, Laura Dietz
SIGIR1
2014 Quantifying the financial impact of it security breaches on business processes
abstract
With the rise of the number of security breaches affecting organizations nowadays, it has become crucial for companies to accurately measure the costs of such incidents and mitigate them in order quantify their risk exposure and direct IT security investments. However, with the absence of standardized cost calculation methods, the task of quantifying the internal costs of security breaches as well as the costs of managing them is one of the difficulties of security risk analysis. Due to the fact that companies consider the time spent by employees during the reparation process of an affected IT resource as idle, overestimations of the costs of security breaches and lost productivity, represented by the system downtime from employees' perception, occur. For these reasons, this study suggests a new approach for measuring the negative economic impact associated with such security attack events. This study proposes a method which assumes that alternative tasks that do not rely on the affected IT resource are performed; hence, the employees' time is not considered as completely idle and consequently the total costs decrease. Early results have shown that our suggested method renders smaller total costs than companies' method when calculating the costs of information security breaches due to the decrease in the idle time; whereas cost components due to delayed work products are typically not captured at all. Our results have also shown how recovery procedures, in terms of dissolving of work task queues, are performed in case of information security breaches.
Clemens Martin, Amina Kadry, Ghada Abu-Shady
PST2