Searching by approximate personal-name matching

We discuss the design, building and evaluation of a method to access theinformation of a person, using his name as a search key, even if it has deformations. We present a similarity function, the DEA function, based on the probabilities of the edit operations accordingly to the involved letters and their position, and using a variable threshold. The efficacy of DEA is quantitatively evaluated, without human relevance judgments, very superior to the efficacy of known methods. A very efficient approximate search technique for the DEA function is also presented based on a compacted trie-tree structure.Postprint (published version

Similarity Reasoning over Semantic Context-Graphs

Similarity is a central cognitive mechanism for humans which enables a broad range of perceptual and abstraction processes, including recognizing and categorizing objects, drawing parallelism, and predicting outcomes. It has been studied computationally through models designed to replicate human judgment. The work presented in this dissertation leverages general purpose semantic networks to derive similarity measures in a problem-independent manner. We model both general and relational similarity using connectivity between concepts within semantic networks. Our first contribution is to model general similarity using concept connectivity, which we use to partition vocabularies into topics without the need of document corpora. We apply this model to derive topics from unstructured dialog, specifically enabling an early literacy primer application to support parents in having better conversations with their young children, as they are using the primer together. Second, we model relational similarity in proportional analogies. To do so, we derive relational parallelism by searching in semantic networks for similar path pairs that connect either side of this analogy statement. We then derive human readable explanations from the resulting similar path pair. We show that our model can answer broad-vocabulary analogy questions designed for human test takers with high confidence. The third contribution is to enable symbolic plan repair in robot planning through object substitution. When a failure occurs due to unforeseen changes in the environment, such as missing objects, we enable the planning domain to be extended with a number of alternative objects such that the plan can be repaired and execution to continue. To evaluate this type of similarity, we use both general and relational similarity. We demonstrate that the task context is essential in establishing which objects are interchangeable

A rule dynamics approach to event detection in Twitter with its application to sports and politics

The increasing popularity of Twitter as social network tool for opinion expression as well as informa- tion retrieval has resulted in the need to derive computational means to detect and track relevant top- ics/events in the network. The application of topic detection and tracking methods to tweets enable users to extract newsworthy content from the vast and somehow chaotic Twitter stream. In this paper, we ap- ply our technique named Transaction-based Rule Change Mining to extract newsworthy hashtag keywords present in tweets from two different domains namely; sports (The English FA Cup 2012) and politics (US Presidential Elections 2012 and Super Tuesday 2012). Noting the peculiar nature of event dynamics in these two domains, we apply different time-windows and update rates to each of the datasets in order to study their impact on performance. The performance effectiveness results reveal that our approach is able to accurately detect and track newsworthy content. In addition, the results show that the adaptation of the time-window exhibits better performance especially on the sports dataset, which can be attributed to the usually shorter duration of football events

A knowledge-intensive approach to process similarity calculation

Process model comparison and similar processes retrieval are key issues to be addressed in many real world situations, and particularly relevant ones in some applications (e.g., in medicine), where similarity quantification can be exploited in a quality assessment perspective. Most of the process comparison techniques described in the literature suffer from two main limitations: (1) they adopt a purely syntactic (vs. semantic) approach in process activity comparison, and/or (2) they ignore complex control flow information (i.e., other than sequence). These limitations oversimplify the problem, and make the results of similarity-based process retrieval less reliable, especially when domain knowledge is available, and can be adopted to quantify activity or control flow construct differences. In this paper, we aim at overcoming both limitations, by introducing a framework which allows to extract the actual process model from the available process execution traces, through process mining techniques, and then to compare (mined) process models, by relying on a novel distance measure. The novel distance measure, which represents the main contribution of this paper, is able to address issues (1) and (2) above, since: (1) it provides a semantic, knowledge-intensive approach to process activity comparison, by making use of domain knowledge; (2) it explicitly takes into account complex control flow constructs (such as AND and XOR splits/joins), thus fully considering the different semantic meaning of control flow connections in a reliable way. The positive impact of the framework in practice has been tested in stroke management, where our approach has outperformed a state-of-the art literature metric on a real world event log, providing results that were closer to those of a human expert. Experiments in other domains are foreseen in the future

Proactive search: Using outcome-based dynamic nearest-neighbor recommendation algorithms to improve search engine efficacy

The explosion of readily available electronic information has changed the focus of data processing from data generation to data discovery. The prevalent use of search engines has generated extensive research into improving the speed and accuracy of searches. The goal of this research is to accurately predict user behavior as a means to proactively improve speed, accuracy, and predictability of search engines. The proactive approach eliminates query entry time and hence reduces the overall processing time, improving speed. Assuming success, the user locates an electronic resource of interest, improving accuracy. Algorithms that have been shown to predict many vastly different aspects of user behavior exist in literature. Two common approaches are used in such prediction: statistical techniques and collaborative actions. This research extends the scope of proactive search by using search histories of users in building a predictive model. The proposed approach was compared to statistical and collaborative behavior models. The test results verified that search engine prediction is a viable approach and supports the intuitive notion that prediction is more successful when user behavior exhibits less entropy. The benefits of the proposed approach go beyond improvement in performance and accuracy. As a result of working with search histories as sequences of resources, it is possible to predict a series of resources that a user will likely select in the immediate future. This makes it possible for search engines to return resource sequences instead of simple resources. Working with sequences allows the search engine user to more effectively locate information of interest. In the end, a proactive search engine improves speed and accuracy through prediction and sequencing of electronic resources --Abstract, page iii

A Social Platform for Knowledge Gathering and Exploitation, Towards the Deduction of Inter-enterprise Collaborations

AbstractSeveral standards have been defined for enhancing the efficiency of B2B web-supported collaboration. However, they suffer from the lack of a general semantic representation, which leaves aside the promise of deducing automatically the inter-enterprise business processes. To achieve the automatic deduction, this paper presents a social platform, which aims at acquiring knowledge from users and linking the acquired knowledge with the one maintained on the platform. Based on this linkage, this platform aims at deducing automatically cross-organizational business processes (i.e. selection of partners and sequencing of their activities) to fulfill any opportunity of collaboration