Institution
Free University of Bozen-Bolzano
Education•Bolzano, Italy•
About: Free University of Bozen-Bolzano is a education organization based out in Bolzano, Italy. It is known for research contribution in the topics: Description logic & Recommender system. The organization has 1326 authors who have published 6011 publications receiving 117945 citations. The organization is also known as: Free University of Bolzano & Free University of Bozen.
Topics: Description logic, Recommender system, Computer science, Context (language use), Ontology (information science)
Papers published on a yearly basis
Papers
More filters
••
01 Jan 2011TL;DR: The main goal is to delineate, in a coherent and structured way, the chapters included in this handbook and to help the reader navigate the extremely rich and detailed content that the handbook offers.
Abstract: Recommender Systems (RSs) are software tools and techniques providing suggestions for items to be of use to a user. In this introductory chapter we briefly discuss basic RS ideas and concepts. Our main goal is to delineate, in a coherent and structured way, the chapters included in this handbook and to help the reader navigate the extremely rich and detailed content that the handbook offers.
2,160 citations
••
TL;DR: It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.
Abstract: We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts and checking satisfiability of the whole knowledge base, but also answering complex queries (in particular, unions of conjunctive queries) over the instance level (ABox) of the DL knowledge base. We show that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in the size of the ABox (i.e., in data complexity). To the best of our knowledge, this is the first result of polynomial-time data complexity for query answering over DL knowledge bases. Notably our logics allow for a separation between TBox and ABox reasoning during query evaluation: the part of the process requiring TBox reasoning is independent of the ABox, and the part of the process requiring access to the ABox can be carried out by an SQL engine, thus taking advantage of the query optimization strategies provided by current database management systems. Since even slight extensions to the logics of the DL-Lite family make query answering at least NLogSpace in data complexity, thus ruling out the possibility of using on-the-shelf relational technology for query processing, we can conclude that the logics of the DL-Lite family are the maximal DLs supporting efficient query answering over large amounts of instances.
1,482 citations
••
TL;DR: An overview of the multifaceted notion of context is provided, several approaches for incorporating contextual information in recommendation process are discussed, and the usage of such approaches in several application areas where different types of contexts are exploited are illustrated.
Abstract: Context-aware recommender systems (CARS) generate more relevant recommendations by adapting them to the specific contextual situation of the user. This article explores how contextual information can be used to create more intelligent and useful recommender systems. It provides an overview of the multifaceted notion of context, discusses several approaches for incorporating contextual information in recommendation process, and illustrates the usage of such approaches in several application areas where different types of contexts are exploited. The article concludes by discussing the challenges and future research directions for context-aware recommender systems.
1,370 citations
••
TL;DR: In this article, the authors examined the relationship between audit committee characteristics and the extent of corporate earnings management as measured by the level of income-increasing and income-decreasing abnormal accruals and found that aggressive earnings management is negatively associated with the financial and governance expertise of audit committee members, with indicators of independence, and with the presence of a clear mandate defining the responsibilities of the committee.
Abstract: This study investigates whether the expertise, independence, and activities of a firm's audit committee have an effect on the quality of its publicly released financial information. In particular, we examine the relationship between audit committee characteristics and the extent of corporate earnings management as measured by the level of income‐increasing and income‐decreasing abnormal accruals. Using two groups of U.S. firms, one with relatively high and one with relatively low levels of abnormal accruals in the year 1996, we find a significant association between earnings management and audit committee governance practices. We find that aggressive earnings management is negatively associated with the financial and governance expertise of audit committee members, with indicators of independence, and with the presence of a clear mandate defining the responsibilities of the committee. The association is similar for both income‐increasing and income‐decreasing earnings management, suggesting that audit com...
1,285 citations
••
Eindhoven University of Technology1, Queensland University of Technology2, Capgemini3, University of Rome Tor Vergata4, Humboldt University of Berlin5, Software AG6, University of Padua7, Polytechnic University of Catalonia8, Hewlett-Packard9, Ghent University10, New Mexico State University11, IBM12, University of Milan13, University of Tartu14, University of Vienna15, Technical University of Lisbon16, Telecom SudParis17, Rabobank18, Infosys19, University of Calabria20, Fujitsu21, Pennsylvania State University22, University of Bari23, University of Bologna24, Vienna University of Economics and Business25, Free University of Bozen-Bolzano26, Stevens Institute of Technology27, Indian Council of Agricultural Research28, Pontifical Catholic University of Chile29, University of Haifa30, Ulsan National Institute of Science and Technology31, Cranfield University32, Katholieke Universiteit Leuven33, Deloitte34, Tsinghua University35, University of Innsbruck36, Hasso Plattner Institute37
TL;DR: This manifesto hopes to serve as a guide for software developers, scientists, consultants, business managers, and end-users to increase the maturity of process mining as a new tool to improve the design, control, and support of operational business processes.
Abstract: Process mining techniques are able to extract knowledge from event logs commonly available in today’s information systems. These techniques provide new means to discover, monitor, and improve processes in a variety of application domains. There are two main drivers for the growing interest in process mining. On the one hand, more and more events are being recorded, thus, providing detailed information about the history of processes. On the other hand, there is a need to improve and support business processes in competitive and rapidly changing environments. This manifesto is created by the IEEE Task Force on Process Mining and aims to promote the topic of process mining. Moreover, by defining a set of guiding principles and listing important challenges, this manifesto hopes to serve as a guide for software developers, scientists, consultants, business managers, and end-users. The goal is to increase the maturity of process mining as a new tool to improve the (re)design, control, and support of operational business processes.
1,135 citations
Authors
Showing all 1399 results
Name | H-index | Papers | Citations |
---|---|---|---|
Alberto Sangiovanni-Vincentelli | 99 | 934 | 45201 |
Marco Gobbetti | 91 | 412 | 25016 |
Diego Calvanese | 70 | 465 | 27173 |
Frank Wolter | 59 | 290 | 12774 |
Richard Hull | 59 | 262 | 17931 |
Sascha Kraus | 58 | 317 | 10428 |
Paolo Lugli | 55 | 739 | 14706 |
Kurt Matzler | 54 | 206 | 13424 |
Francesco Ricci | 54 | 295 | 15492 |
Mathias Weske | 53 | 349 | 13207 |
Pekka Abrahamsson | 51 | 281 | 9100 |
Gabriele Bavota | 50 | 166 | 7560 |
Giancarlo Succi | 50 | 337 | 6645 |
Alfredo Vittorio De Massis | 49 | 185 | 8020 |
Leonardo Montagnani | 48 | 136 | 13601 |