10,465 research outputs found

    Discovering Process Model from Event Logs by Considering Overlapping Rules

    Get PDF
    Process Mining is a technique to automatically discover and analyze business processes from event logs. Discovering concurrent activities often uses process mining since there are many of them contained in business processes. Since researchers and practitioners are giving attention to the process discovery (one of process mining techniques), then the best result of  the  discovered process  models is  a  must. Nowadays, using process  execution  data in the  past, process  models with rules underlying decisions in processes can be enriched, called decision mining. Rules defined over process data specify choices between multiple activities. One out of multiple activities is allowed to be executed in existing decision mining methods or it is known as mutually-exclusive rules. Not only mutually-exclusive rules, but also fully deterministic because all factors which influence decisions are recorded. However, because of non-determinism or incomplete   information,   there   are   some   cases   that   are overlapping  in  process  model.  Moreover,  the  rules  which are generated  from  existing  method  are  not  suitable  with  the recorded data. In this paper, a discovery technique for process model with data by considering the overlapping rules from event logs is presented. Discovering overlapping rules uses decision tree learning techniques, which fit the recorded data better than the existing method. Process model discovery from event logs is generated using Modified Time-Based Heuristics Miner Algorithm. Last, online book store management process model is presented in High-level BPMN Process Model

    Weakly supervised segment annotation via expectation kernel density estimation

    Full text link
    Since the labelling for the positive images/videos is ambiguous in weakly supervised segment annotation, negative mining based methods that only use the intra-class information emerge. In these methods, negative instances are utilized to penalize unknown instances to rank their likelihood of being an object, which can be considered as a voting in terms of similarity. However, these methods 1) ignore the information contained in positive bags, 2) only rank the likelihood but cannot generate an explicit decision function. In this paper, we propose a voting scheme involving not only the definite negative instances but also the ambiguous positive instances to make use of the extra useful information in the weakly labelled positive bags. In the scheme, each instance votes for its label with a magnitude arising from the similarity, and the ambiguous positive instances are assigned soft labels that are iteratively updated during the voting. It overcomes the limitations of voting using only the negative bags. We also propose an expectation kernel density estimation (eKDE) algorithm to gain further insight into the voting mechanism. Experimental results demonstrate the superiority of our scheme beyond the baselines.Comment: 9 pages, 2 figure

    An Open Source Based Data Warehouse Architecture to Support Decision Making in the Tourism Sector

    Get PDF
    In this paper an alternative Tourism oriented Data Warehousing architecture is proposed which makes use of the most recent free and open source technologies like Java, Postgresql and XML. Such architecture's aim will be to support the decision making process and giving an integrated view of the whole Tourism reality in an established context (local, regional, national, etc.) without requesting big investments for getting the necessary software.Tourism, Data warehousing architecture

    Utilizing Algorithms for Decision Mining Discovery

    Get PDF
    Organizations are executing operational decisions in fast changing environments, which increases the necessity for managing these decisions adequately. Information systems store information about such decisions in decision- and event logs that could be used for analyzing decisions. This study aims to find relevant algorithms that could be used to mine decisions from such decision- and event logs, which is called decision mining. By conducting a literature review, together with interviews conducted with experts with a scientific background as well as participants with a commercial background, relevant classifier algorithms and requirements for mining decisions are identified and mapped to find algorithms that could be used for the discovery of decisions. Five of the twelve algorithms identified have a lot of potential to use for decision mining, with small adaptations, while six out of the twelve do have potential but the required adaptation would demand too many alterations to their core design. One of the twelve was not suitable for the discovery of decisions
    corecore