Do 'alternative' help-seeking strategies affect primary care service use? A survey of help-seeking for mental distress

http://creativecommons.org/licenses/by/2.0

Process matching and discovery

L'importance accrue des processus métiers dans les systèmes d information actuels et les infrastructures orientées services a conduit à la prolifération d entrepôts contenant des centaines voire des milliers de processus. L appariement et la découverte de processus sont alors devenus des fonctionnalités nécessaires à la gestion de ces collections. Certaines approches ont réduit le problème de l appariement de processus à un problème d appariement de graphes. Des algorithmes d appariement de graphes ont été adaptés pour cette fin. Toutefois, ces algorithmes sont exponentiels par rapport à la taille des processus, ce qui limite leur application à des processus de petites tailles. De plus, ces algorithmes ne peuvent pas être appliqués dans le contexte de découverte de processus en comparant la requête à tous les processus de l entrepôt et les classer ensuite selon leurs similarités. Motivés par ces problèmes, nous proposons dans le cadre de cette thèse : (1) deux heuristiques qui permettent d apparier des processus de plus grandes tailles en un temps réduit tout en gardant un niveau de qualité acceptable des appariements retrouvés ; (2) une structure d indexe et un algorithme de traitement de requêtes qui permettent de retrouver les processus les plus similaires à une requête sans parcourir séquentiellement les processus de l entrepôt. Pour montrer l efficacité des techniques proposées, nous avons développé un prototype. Ce dernier a été évalué sur une large collection de processus que nous avons construite.The importance gained by business processes in modern information systems and service oriented architectures led to the increasing proliferation of process repositories. Matching and retrieving processes are critical functionalities required for the management of such collections. Some existing approaches reduced the problem of process matching to a graph matching problem and adapted existing matching algorithms to this end. However, the NP-completeness of their underlying graph matching algorithms limits the application of these techniques to small-sized processes. Furthermore, these techniques cannot be used in the context of process retrieval by matching the query against the processes of the repository, and ranking them according to their similarities. Motivated by these problems, we propose in this dissertation: (1) two heuristics that aim to speed up the matching of processes while keeping an acceptable quality level of the found matches, and (2) an index structure as well as a query answering algorithm that allow retrieving the processes the most similar to a given query without browsing the processes of a repository. To show the effectiveness of our techniques, we developed a prototype implementing them, and we built up a test collection upon which we evaluated this prototype.VERSAILLES-BU Sciences et IUT (786462101) / SudocSudocFranceF

A Graph-Based Approach for Semantic Process Model Discovery

One of the key tasks in the service oriented architecture that Semantic Web services aim to automate is the discovery of services that can fulfill the applications or user needs. OWL-S is one of the proposals for describing semantic metadata about Web services, which is based on the OWL ontology language. Majority of current approaches for matching OWL-S processes take into account only the inputs/outputs service profile. This chapter argues that, in many situations the service matchmaking should take into account also the process model. We present matching techniques that operate on OWL-S process models and allow retrieving in a given repository, the processes most similar to the query. To do so, the chapter proposes to reduce the problem of process matching to a graph matching problem and to adapt existing algorithms for this purpose. It proposes a similarity measure used to rank the discovered services. This measure captures differences in process structure and semantic differences between input/outputs used in the processes.ou

A Framework for Service Discovery based on Structural Similarity and Quality Satisfaction

International audienceThe increasing number of published web services rendered the searching for a service within repositories a critical issue in many application domains. Recent approaches resorted to service structure and to preferences over quality attributes to reduce selectivity rate. In this paper, we present S-MatchMaker, a tool for service discovery based on both service structure and quality preferences. The tool implements several algorithms that can be coupled in different ways to provide a personalized solution for service discovery

A Graph Approach for Enhancing Process Models Matchmaking

International audienc

Spectral Graph Approach for Process Model Matchmaking

International audienceIn this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods; in particular, by eigenbased projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approac

Spectral Graph Approach for Process Model Matchmaking

International audienceIn this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods; in particular, by eigenbased projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approac

Process analytics: concepts and techniques for querying and analyzing process data

This book starts with an introduction to process modeling and process paradigms, then explains how to query and analyze process models, and how to analyze the process execution data. In this way, readers receive a comprehensive overview of what is needed to identify, understand and improve business processes.The book chiefly focuses on concepts, techniques and methods. It covers a large body of knowledge on process analytics – including process data querying, analysis, matching and correlating process data and models – to help practitioners and researchers understand the underlying concepts, problems, methods, tools and techniques involved in modern process analytics. Following an introduction to basic business process and process analytics concepts, it describes the state of the art in this area before examining different analytics techniques in detail. In this regard, the book covers analytics over different levels of process abstractions, from process execution data and methods for linking and correlating process execution data, to inferring process models, querying process execution data and process models, and scalable process data analytics methods. In addition, it provides a review of commercial process analytics tools and their practical applications.The book is intended for a broad readership interested in business process management and process analytics. It provides researchers with an introduction to these fields by comprehensively classifying the current state of research, by describing in-depth techniques and methods, and by highlighting future research directions. Lecturers will find a wealth of material to choose from for a variety of courses, ranging from undergraduate courses in business process management to graduate courses in business process analytics. Lastly, it offers professionals a reference guide to the state of the art in commercial tools and techniques, complemented by many real-world use case scenarios