Due to its wide use in personal, but most importantly, professional contexts, email represents a valuable source of information that can be harvested for understanding, reengineering and repurposing undocumented business processes of companies and institutions. Towards this aim, a few researchers investigated the problem of extracting process oriented information from email logs in order to take benefit of the many available process mining techniques and tools. In this paper we go further in this direction, by proposing a new method for mining process models from email logs that leverage unsupervised machine learning techniques with little human involvement. Moreover, our method allows to semi-automatically label emails with activity names, that can be used for activity recognition in new incoming emails. A use case demonstrates the usefulness of the proposed solution using a modest in size, yet real-world, dataset containing emails that belong to two different process models
Another category of works deal with the problem of conversation detection in email systems (see for exemple @cite_6 ). While conversation detection is closed to the problem of process instance discovery, they are also different: a conversation is defined as taking place among the same group of people, while a process instance involves different persons, each one having a limited view on the overall set of exchanged emails (i.e., the travel agent only books the tickets, is not implied in the other exchanges).
@cite_6
1749480759 2101707957 2111436316 1979545636
This work explores a novel approach for conversation detection in email mailboxes. This approach clusters messages into coherent conversations by using a similarity function among messages that takes into consideration all relevant email attributes, such as message subject, participants, date of submission, and message content. The detection algorithm is evaluated against a manual partition of two email mailboxes into conversations. Experimental results demonstrate the superiority of our detection algorithm over several other alternative approaches. Current techniques towards information security have limited capabilities to detect and counter attacks that involve different kinds of masquerade and spread of misinformation executed over long time periods to achieve malicious goals. Detection of such deceptive information obtained during online interactions (emails, chat room conversations) is the first step before counter strategies can be developed. With the large-scale use of information technologies as a general communication medium, facilitating deception detection is a key enabler to utilizing information systems to their fullest potential. This article presents a framework for computer-aided deception detection building on the interpersonal deception theory (IDT) of human interpersonal communication research and text-processing techniques for facilitating deception analysis of text-oriented communication. A state-transition diagram based framework is proposed to model the dynamic evolution of an interpersonal conversation between a sender and receiver based on the IDT-based process schemata. The framework is then utilized to develop a deception detection agent to process textual information. Deception detection is defined as a process of model verification. Architecture of a prototype under development and open problems for further research in this area are outlined. Multi-category classification of short dialogues is a common task performed by humans. When assigning a question to an expert, a customer service operator tries to classify the customer query into one of N different classes for which experts are available. Similarly, questions on the web (for example questions at Yahoo Answers) can be automatically forwarded to a restricted group of people with a specific expertise. Typical questions are short and assume background world knowledge for correct classification. With exponentially increasing amount of knowledge available, with distinct properties (labeled vs unlabeled, structured vs unstructured), no single knowledge-transfer algorithm such as transfer learning, multi-task learning or selftaught learning can be applied universally. In this work we show that bag-of-words classifiers performs poorly on noisy short conversational text snippets. We present an algorithm for leveraging heterogeneous data sources and algorithms with significant improvements over any single algorithm, rivaling human performance. Using different algorithms for each knowledge source we use mutual information to aggressively prune features. With heterogeneous data sources including Wikipedia, Open Directory Project (ODP), and Yahoo Answers, we show 89.4 and 96.8 correct classification on Google Answers corpus and Switchboard corpus using only 200 features class. This reflects a huge improvement over bag of words approaches and 48-65 error reduction over previously published state of art (Gabrilovich et. al. 2006). The objective of this work is recognition and spatiotemporal localization of two-person interactions in video. Our approach is person-centric. As a first stage we track all upper bodies and heads in a video using a tracking-by-detection approach that combines detections with KLT tracking and clique partitioning, together with occlusion detection, to yield robust person tracks. We develop local descriptors of activity based on the head orientation (estimated using a set of pose-specific classifiers) and the local spatiotemporal region around them, together with global descriptors that encode the relative positions of people as a function of interaction type. Learning and inference on the model uses a structured output SVM which combines the local and global descriptors in a principled manner. Inference using the model yields information about which pairs of people are interacting, their interaction class, and their head orientation (which is also treated as a variable, enabling mistakes in the classifier to be corrected using global context). We show that inference can be carried out with polynomial complexity in the number of people, and describe an efficient algorithm for this. The method is evaluated on a new dataset comprising 300 video clips acquired from 23 different TV shows and on the benchmark UT--Interaction dataset.