Consensus clustering and meta clustering are two important extensions of the classical clustering problem. Given a set of input clusterings of a given dataset, consensus clustering aims to find a single final clustering which is a better fit in some sense than the existing clusterings, and meta clustering aims to group similar input clusterings together so that users only need to examine a small number of different clusterings. In this paper, we present a new approach, MCC (stands for multiple consensus clustering), to explore multiple clustering views of a given dataset from the input clusterings by combining consensus clustering and meta clustering. In particular, given a set of input clusterings of a particular data set, MCC employs meta clustering to cluster the input clusterings and then uses consensus clustering to generate a consensus for each cluster of the input clusterings. Extensive experimental results on 11 real world data sets demonstrate the effectiveness of our proposed method.

We consider the problem of planning, on the fly, a path whereby a robotic vehicle will cover every point in an initially unknown spatial environment. We describe four strategies (Iterated WaveFront, Greedy-Scan, Delayed Greedy-Scan and Closest-First Scan) for generating cost-effective coverage plans in real time for unknown environments. We give theorems showing the correctness of our planning strategies. Our experiments demonstrate that some of these strategies work significantly better than others, and that the best ones work very well; e.g., in environments having an average of 64,000 locations for the robot to cover, the best strategy returned plans with less than 6% redundant coverage, and took only an average of 0.1 milliseconds per action.

Historically, causal markers, syntactic structures and connectives have been the sole identifying features for automatically extracting causal relations in natural language discourse. However various connectives such as “and,” prepositions such as “as” and other syntactic structures are highly ambiguous in nature, and it is clear that one cannot solely rely on lexico-syntactic markers for detection of causal phenomenon in discourse. This paper introduces the theory of granularity and describes different approaches to identify granularity in natural language. As causality is often granular in nature, we use granularity relations to discover and infer the presence of causal relations in text. We compare this with causal relations identified using just causal markers. We achieve a precision of 0.91 and a recall of 0.79 using granularity for causal relation detection, as compared to a precision of 0.79 and a recall of 0.44 using pure causal markers for causality detection.

With the rapid development of technologies for fast access to the Internet and the popularization of digital cameras, enormous digital images are posted and shared online everyday. Simultaneously, web images are usually organized by topics of events and are often assigned appropriate topic-related text descriptions. Given a set of images along with corresponding texts, a challenging problem is how to utilize the available information to perform image retrieval tasks, such as image classification and image clustering. Previous works on image categorization focus on either adopting text or image features, or simply combining these two types of information together. In this paper, we propose two novel approaches (Dynamic Weighting and Region-based Semantic Concept Integration) to categorize the images under the "supervision" of topic-related text descriptions; In addition, we provide a comparative experimental investigation on utilizing text and image information to tackle image classification. Empirical experiments on a manually collected image dataset (consisting of images related to the events after disasters) demonstrate the efficacy of our proposed classification methods.

This paper presents a novel multimodal approach to automatically detect learner’s uncertainty through the integration of multiple sensors. An acquisition protocol was established to record participants’ electrical brain activity and physiological signals while interacting with a problem solving system specifically designed for uncertainty elicitation. Data were collected from 38 subjects using 8 sensors and two video feeds. Results from machine learning classifiers support the feasibility of our approach. 81% of accuracy was reached using Support Vector Machine (SVM) algorithm.

We describe a software tool to select among camera feeds from multiple virtual cameras in a virtual environment using semiring constraint satisfaction problem techniques (SCSP), a soft constraint approach. We show how to encode a designer's preferences, and select the best camera feed even in over-constrained or under-constrained environments. The system functions in real time for dynamic scenes, using only current information (ie. no prediction). To reduce computation costs for a final implementation, the SCSP evaluation can be cached and converted to native code. Our approach is implemented in two virtual environments: a virtual hockey game using a spectator viewpoint, and a virtual 3D maze game using a third person perspective. Comparisons against hard constraints (constraint satisfaction problems) are made.

The results of 2,256 neuroimaging experiments were an- alyzed using singular value decomposition (SVD) and non-negative matrix factorization (NMF) to extract pat- terns in the data. To evaluate the techniques’ efficacy at capturing regularities in the data, one positive and one negative result from each of 100 random experi- ments were treated as missing, and the values were it- eratively reconstructed using each technique for dimen- sionality reduction. Under the best conditions, preci- sion and recall of roughly 78% was achieved for each method. Weighting the domain matrix and area matrix to have equal first eigenvalues before combining them, a technique known as blending, significantly improved re- sults for both methods. While using unnormalized data appeared to produce a peak in results for 10-15 dimen- sions, normalizing to take into account variation in the popularity of experiment types removed the effect. The basis vectors produced by each method do not support the idea that current cognitive ontologies map well to individual brain areas.

This paper investigates feature level fusion for enhancing fault detection from vibration signals in an ocean turbine. Changes in vibration signatures from such rotating machinery typically indicate the presence of a problem such as a shift in its orientation or mechanical impact from its environment. We applied feature level fusion to vibration data acquired from two accelerometers attached to a box fan, and then assessed the abilities of twelve well known machine learners to detect changes in state from the raw accelerometer data and from the fused data. Analysis of the performance of these classifiers showed an overall performance improvement in all twelve classifiers in detecting the state of the fan from the fused data versus from the data from the two individual sensor channels.

Thomas K. Landauer (Pearson Knowledge Technologies) The recently created word maturity (WM) metric uses the computational language model LSA to mimic the average evolutionary growth of individual word and paragraph knowledge as a function of the total amount and order of simulated reading. The simulator traces the separate growth trajectories of an unlimited number of different words from the beginning of reading to adult level.

List of the organizers and conference committees for FLAIRS-24, including special tracks.