Entity Summarisation with Limited Edge Budget on Undirected and Directed Knowledge Graphs

The paper concerns a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this problem. The algorithm has been implemented in two variants: undirected and directed, together with a visualisation tool. Experimental user evaluation of the algorithm was conducted on real large semantic knowledge graphs extracted from the web. The reported results of experimental user evaluation are promising and encourage to continue the work on improving the algorithm.

Exploring Linguistic Features for Web Spam Detection: A Preliminary Study

We study the usability of linguistic features in theWeb spam classification task. The features were computed on two Web spam corpora: Webspam-Uk2006 and Webspam-Uk2007, we make them publicly available for other researchers. Preliminary analysis seems to indicate that certain linguistic features may be useful for the spam-detection task when combined with features studied elsewhere.JRC.G.2-Support to external securit

Niepubliczne agencje zatrudnienia osób niepełnosprawnych. Możliwości i dylematy rozwoju w sektorze pozarządowym

Raport powstał z inicjatywy Fundacji Pomocy Matematykom i Informatykom Niesprawnym Ruchowo w ramach projektu „Centrum Edukacji i Aktywizacji Zawodowej Osób Niepełnosprawnych - Oddziały Bydgoszcz i Łódź". Stanowi on rezultat badań zjawiska niepełnosprawności i kategorii społecznej, jaką stanowią osoby niepełnosprawne, oraz funkcjonowania ponad 30 agencji zatrudnienia wyspecjalizowanych we wsparciu osób niepełnosprawnych na rynku pracy. Pierwszy rozdział ekspertyzy dotyczy sposobów definiowania zjawiska niepełnosprawności, w drugim zaś - podjęto zagadnienie budowania potencjału niepublicznych służb zatrudnienia osób niepełnosprawnych. Trzeci rozdział raportu zawiera informacje dotyczące przyjętej metodologii badań, a czwarty prezentuje wyniki analiz zebranego materiału empirycznego w odniesieniu do oferty agencji zatrudnienia i jej klientów. Tematem piątego rozdziału pracy jest kondycja agencji zatrudnienia osób niepełnosprawnych, prowadzonych przez organizacje pozarządowe. Motyw przewodni kolejnego rozdziału to otoczenie zewnętrzne agencji zatrudnienia. Ostatnia cześć raportu dotyczy rekomendacji wspomagających rozwiązywanie dylematów rozwojowych, przed którymi stoją agencje zatrudnienia. ** This report was made on the initiative of the Foundation Supporting Disabled Mathematicians and IT professionals in the project "Centre for Education and Vocational Activation of Persons with Disabilities - Branches Bydgoszcz and Lodz." It is the result of research on disability phenomenon and people with disabilities social category. It contains information about operations of more than 30 employment agencies specialized in helping people with disabilities into the labor market. First chapter of expertise relates to methods for defining the prevalence of disability and in the second - it was the issue of capacity building for non-disabled employment services. Third chapter of the report provides information on the methodology of research, and the fourth presents the results of an empirical analysis of the collected material in relation to the offer of employment agencies and their clients. Theme of the fifth chapter of the work is the condition of the disabled employment agency run by NGOs. Theme of the next chapter is the external environment of employment agencies. Last part of the report focuses on solving a recommendation supporting development dilemmas faced by agencies employment

Towards the Foundations of Diversity-Aware Node Summarisation on Knowledge Graphs

This paper aims at initiating a discussion of the foundations of the notion of diversity in a novel problem of computing graphical node summarisations in knowledge multi-graphs (equivalently viewed as RDF-graphs). As it reports an ongoing work, it proposes a general framework of basic concepts and adaptations of two diversity-aware evaluation measures previously studied in the context of information retrieval to the studied problem and briefly discusses them.marcin sydowSupported by N N516 481940 grant of Polish Ministry of Science and Higher Education

Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification

Facility Dispersion Problem, originally studied in Operations Research, has recently found important new applications in Result Diversification approach in information sciences. This optimisation problem consists of selecting a small set of p items out of a large set of candidates to maximise a given objective function. The function expresses the notion of dispersion of a set of selected items in terms of a pair-wise distance measure between items. In most known formulations the problem is NP-hard, but there exist 2-approximation algorithms for some cases if distance satisfies triangle inequality. We present generalised 2/α approximation guarantees for the Facility Dispersion Problem in its two most common variants: Max Sum and Max Min, when the un- derlying dissimilarity measure satisfies parameterised triangle inequality with pa- rameter α. The results apply to both relaxed and stronger variants of the triangle inequality. We also demonstrate potential applications of our findings in the result diversifica- tion problem including web search or entity summarisation in semantic knowledge graphs, as well as in practical computations on finite data sets.marcin sydo

Entity Summarisation with Limited Edge Budget on Undirected and Directed Knowledge Graphs

The paper concerns a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this problem. The algorithm has been implemented in two variants: undirected and directed, together with a visualisation tool. Experimental user evaluation of the algorithm was conducted on real large semantic knowledge graphs extracted from the web. The reported results of experimental user evaluation are promising and encourage to continue the work on improving the algorithm.