Matrix Decomposition Methods for Data Mining : Computational Complexity and Algorithms

Matrix decompositions, where a given matrix is represented as a product of two other matrices, are regularly used in data mining. Most matrix decompositions have their roots in linear algebra, but the needs of data mining are not always those of linear algebra. In data mining one needs to have results that are interpretable -- and what is considered interpretable in data mining can be very different to what is considered interpretable in linear algebra. --- The purpose of this thesis is to study matrix decompositions that directly address the issue of interpretability. An example is a decomposition of binary matrices where the factor matrices are assumed to be binary and the matrix multiplication is Boolean. The restriction to binary factor matrices increases interpretability -- factor matrices are of the same type as the original matrix -- and allows the use of Boolean matrix multiplication, which is often more intuitive than normal matrix multiplication with binary matrices. Also several other decomposition methods are described, and the computational complexity of computing them is studied together with the hardness of approximating the related optimization problems. Based on these studies, algorithms for constructing the decompositions are proposed. Constructing the decompositions turns out to be computationally hard, and the proposed algorithms are mostly based on various heuristics. Nevertheless, the algorithms are shown to be capable of finding good results in empirical experiments conducted with both synthetic and real-world data.

Shifting centres: Pedagogical relations in the Era of Big Data

This paper presents a cautious argument for re-thinking both the nature and the centrality of the one-to-one teacher/student relationship in contemporary pedagogy. A case is made that learning in and for our times requires us to broaden our understanding of pedagogical relations beyond the singularity of the teacher/student binary and to promote the connected teacher as better placed to lead learning for these times. The argument proceeds in three parts: first, a characterization of our times as defined increasingly by the digital knowledge explosion of Big Data; second, a re-thinking of the nature of pedagogical relationships in the context of Big Data; and third, an account of the ways in which leaders can support their teachers to become more effective in leading learning by being more closely connected to their professional colleagues.

A Floor Control Server in a Distributed Conference Service

The conferencing systems in IP Multimedia (IM) networks are going through restructuring, accomplished in the near future. One of the changes introduced is the concept of floors and floor control in its current form with matching entity roles. The Binary Floor Control Protocol (BFCP) is a novelty to be exploited in distributed tightly coupled conferencing services. The protocol defines the floor control server (FCS), which implements floor control giving access to shared resources. As the newest tendency is to distribute the conferencing services, the locations of different functionality units play an important role in developing the standards. The floor control server location is not yet single-mindedly fixed in different standardization bodies, and the debate goes on where to place it within the media server, providing the conferencing service. The thesis main objective is to evaluate two distinctive alternatives in respect the Mp interface protocol between the respective nodes, as the interface in relation to floor control is under standardization work at the moment. The thesis gives a straightforward preamble in IMS network, nodes of interest including floor control server and conferencing. Knowledge on several protocols – BFCP, SDP, SIP and H.248 provides an important background for understanding the functionality changes introduced in the Mp interface and therefore introductions on those protocols and how they are connected to the full picture is given. The actual analysis on the impact of the floor control server into the Mp reference point is concluded in relation to the locations, giving basic flows, requirements analysis including a limited implementation proposal on supporting protocol parameters. The overall conclusion of the thesis is that even if both choices are seemingly useful, not one of the locations is clearly the most suitable in the light of this work. The thesis suggests a solution having both possibilities available to be chosen from in separate circumstances, realized with consistent standardization. It is evident, that if the preliminary assumption for the analysis is kept regarding to only one right place for the floor control server, more work is to be done in connected areas to discover the one most appropriate location.

Using Mathematical Morphology for Geometric Music Retrieval

The usual task in music information retrieval (MIR) is to find occurrences of a monophonic query pattern within a music database, which can contain both monophonic and polyphonic content. The so-called query-by-humming systems are a famous instance of content-based MIR. In such a system, the user's hummed query is converted into symbolic form to perform search operations in a similarly encoded database. The symbolic representation (e.g., textual, MIDI or vector data) is typically a quantized and simplified version of the sampled audio data, yielding to faster search algorithms and space requirements that can be met in real-life situations. In this thesis, we investigate geometric approaches to MIR. We first study some musicological properties often needed in MIR algorithms, and then give a literature review on traditional (e.g., string-matching-based) MIR algorithms and novel techniques based on geometry. We also introduce some concepts from digital image processing, namely the mathematical morphology, which we will use to develop and implement four algorithms for geometric music retrieval. The symbolic representation in the case of our algorithms is a binary 2-D image. We use various morphological pre- and post-processing operations on the query and the database images to perform template matching / pattern recognition for the images. The algorithms are basically extensions to classic image correlation and hit-or-miss transformation techniques used widely in template matching applications. They aim to be a future extension to the retrieval engine of C-BRAHMS, which is a research project of the Department of Computer Science at University of Helsinki.

An XML Messaging Service for Mobile Devices

In recent years, XML has been accepted as the format of messages for several applications. Prominent examples include SOAP for Web services, XMPP for instant messaging, and RSS and Atom for content syndication. This XML usage is understandable, as the format itself is a well-accepted standard for structured data, and it has excellent support for many popular programming languages, so inventing an application-specific format no longer seems worth the effort. Simultaneously with this XML's rise to prominence there has been an upsurge in the number and capabilities of various mobile devices. These devices are connected through various wireless technologies to larger networks, and a goal of current research is to integrate them seamlessly into these networks. These two developments seem to be at odds with each other. XML as a fully text-based format takes up more processing power and network bandwidth than binary formats would, whereas the battery-powered nature of mobile devices dictates that energy, both in processing and transmitting, be utilized efficiently. This thesis presents the work we have performed to reconcile these two worlds. We present a message transfer service that we have developed to address what we have identified as the three key issues: XML processing at the application level, a more efficient XML serialization format, and the protocol used to transfer messages. Our presentation includes both a high-level architectural view of the whole message transfer service, as well as detailed descriptions of the three new components. These components consist of an API, and an associated data model, for XML processing designed for messaging applications, a binary serialization format for the data model of the API, and a message transfer protocol providing two-way messaging capability with support for client mobility. We also present relevant performance measurements for the service and its components. As a result of this work, we do not consider XML to be inherently incompatible with mobile devices. As the fixed networking world moves toward XML for interoperable data representation, so should the wireless world also do to provide a better-integrated networking infrastructure. However, the problems that XML adoption has touch all of the higher layers of application programming, so instead of concentrating simply on the serialization format we conclude that improvements need to be made in an integrated fashion in all of these layers.

Appalling behaviour

'Appalling Behaviour' is a critically acclaimed contemporary Australian monologue, written by AWGIE Award winning playwright, Stephen House. This production, directed and creatively adapted by Shane Pike, was presented at the Brisbane Powerhouse in February 2016, as part of Queensland's LGBTIQ festival, Melt. This adaptation of the work experimented with notions of gender, taking the original script and manipulating character and scene to investigate expressions of identity beyond the traditional notions of binary gender-norms. To this end, the sole character (and actor) was (re)presented as a homeless bi-sexual queen with the aim of inferring that gender un/ab-normative characters can exist not only as disruptors/comments on/agitators of traditional expectations of performed gender (both onstage and off), but can also exist as accepted characters in and of themselves. Put simply: can a bi-sexual queen just be an actor/character in a play, or do all gender extra-normative characters inherently exist as political, social and cultural challengers? If so, why is this the case and should we be aiming for this kind of character to be an accepted part of the performative fabric, seamless and fitting within any onstage situation and play (why can't Willy Loman, King Lear or Nora be gender non-normative), or should such (re)presentations always exist as 'different'? Is it time for individual expressions of gender to just 'be' and be accepted as givens, or are we not quite there yet?

Effect of fourier domain quantization on matched filtering

It is shown that the use of a coarsely quantized binary digital hologram as a matched filter on an optical computer does not degrade signal-to-noise ratio (SNR) appreciably.

The heat capacity of liquid carbon disulfide + acetonitrile, especially near the upper critical solution temperature

The heat capacity Cp of the binary liquid system CS2 + CH3CN has been studied. This system has an upper critical solution temperature To ≈ 323.4 K and a critical mole fraction of CS2xo ≈ 0.5920. Measurements were made both for mixtures close to and far away from the critical region. The heat capacity of the mixture with x = xo exhibits a symmetric logarithmic anomaly around Tc, which is apparently preserved even for compositions in the immediate vicinity of xc. For compositions far away from xc, only a normal rise in Cp over the covered temperature range is observed.

Optical Barker codes

Certain binary codes having good autocorrelation properties akin to Barker codes are studied.

Microstructure and mechanical properties of unidirectionally solidified Al-Si-Ni ternary eutectic

Al-10.98 pct Si-4.9 pct Ni ternary eutectic alloy was unidirectionally solidified at growth rates from 1.39μm/sec to 6.95μm/sec. Binary Al-Ni and Al-Si eutectics prepared from the same purity metals were also solidified under similar conditions to characterize the growth conditions under the conditions of present study. NiAl3 phase appeared as fibers in the binary Al-Ni eutectic and silicon appeared as irregular plates in the binary Al-Si eutectic. However, in the ternary Al-Si-Ni eutectic alloy both NiAl3 and silicon phases appeared as irregular plates dispersed in α-Al phase, without any regular repctitive arrangement. The size and spacing of NiAl3 and Si platelets in cone shaped colonies decreased with an increase in the growth rate of the ternary eutectic. Examination of specimen quenched during unidirectional solidification indicated that the ternary eutectic grows with a non-planar interface with both Si and NiAl3 phases protruding into the liquid. It is concluded that it will be difficult to grow regular ternary eutectic structures even if only one phase has a high entropy of melting. The tensile strength and modulus of unidirectionally solidified Al-Si-Ni eutectic was lower than the chill cast alloys of the same composition, and decreased with a decrease in growth rate. Tensile modulus and strength of ternary Al-Si-Ni eutectic alloys was greater than binary Al-Si eutectic alloy under similar growth conditions, both in the chill cast and in unidirectionally solidified conditions.

Feature extraction for fingerprint classification

This paper presents two algorithms for smoothing and feature extraction for fingerprint classification. Deutsch's(2) Thinning algorithm (rectangular array) is used for thinning the digitized fingerprint (binary version). A simple algorithm is also suggested for classifying the fingerprints. Experimental results obtained using such algorithms are presented.

On the integration of self-tracking data amongst quantified self members

Self-tracking, the process of recording one's own behaviours, thoughts and feelings, is a popular approach to enhance one's self-knowledge. While dedicated self-tracking apps and devices support data collection, previous research highlights that the integration of data constitutes a barrier for users. In this study we investigated how members of the Quantified Self movement---early adopters of self-tracking tools---overcome these barriers. We conducted a qualitative analysis of 51 videos of Quantified Self presentations to explore intentions for collecting data, methods for integrating and representing data, and how intentions and methods shaped reflection. The findings highlight two different intentions---striving for self-improvement and curiosity in personal data---which shaped how these users integrated data, i.e. the effort required. Furthermore, we identified three methods for representing data---binary, structured and abstract---which influenced reflection. Binary representations supported reflection-in-action, whereas structured and abstract representations supported iterative processes of data collection, integration and reflection. For people tracking out of curiosity, this iterative engagement with personal data often became an end in itself, rather than a means to achieve a goal. We discuss how these findings contribute to our current understanding of self-tracking amongst Quantified Self members and beyond, and we conclude with directions for future work to support self-trackers with their aspirations.

Context-dependent mate choice in the sand goby, Pomatoschistus minutus

The results presented in this thesis show that all females of a given population do not necessarily choose similar mating partners. Specifically, partner preferences of a fish, the sand goby (Pomatoschistus minutus), varied among individual females and depended on the social context at the time of choice. I also show that females assess multiple mate choice cues simultaneously; partner preferences were based more strongly on an interaction effect between different choice cues than on any individual cue. Furthermore, I found that preferred matings involved fitness benefits in the form of increased offspring success, but these benefits were not significantly affected by mate compatibility. Hence, mate choice for partner compatibility does not appear to be an important determinant of the observed variation in female mate preferences in this species. The context-dependency of female mating preferences revealed is relevant to how genetic variation in sexually selected traits might be maintained: as the mating success of a certain male type varies according to the choice context, directional sexual selection on male traits is shown to be less intense than generally thought making for a slower loss of genetic variation in these traits. Mating preferences of sand gobies were assessed by giving females a binary choice between males that differed in body size and/or other focus traits. These association preferences were found to be sexually motivated, repeatable and to correspond to actual mating decisions.

Human action recognition from video sequences

This PhD research has proposed new machine learning techniques to improve human action recognition based on local features. Several novel video representation and classification techniques have been proposed to increase the performance with lower computational complexity. The major contributions are the construction of new feature representation techniques, based on advanced machine learning techniques such as multiple instance dictionary learning, Latent Dirichlet Allocation (LDA) and Sparse coding. A Binary-tree based classification technique was also proposed to deal with large amounts of action categories. These techniques are not only improving the classification accuracy with constrained computational resources but are also robust to challenging environmental conditions. These developed techniques can be easily extended to a wide range of video applications to provide near real-time performance.

On the expressive power of behavioral profiles

Behavioral profiles have been proposed as a behavioral abstraction of dynamic systems, specifically in the context of business process modeling. A behavioral profile can be seen as a complete graph over a set of task labels, where each edge is annotated with one relation from a given set of binary behavioral relations. Since their introduction, behavioral profiles were argued to provide a convenient way for comparing pairs of process models with respect to their behavior or computing behavioral similarity between process models. Still, as of today, there is little understanding of the expressive power of behavioral profiles. Via counter-examples, several authors have shown that behavioral profiles over various sets of behavioral relations cannot distinguish certain systems up to trace equivalence, even for restricted classes of systems represented as safe workflow nets. This paper studies the expressive power of behavioral profiles from two angles. Firstly, the paper investigates the expressive power of behavioral profiles and systems captured as acyclic workflow nets. It is shown that for unlabeled acyclic workflow net systems, behavioral profiles over a simple set of behavioral relations are expressive up to configuration equivalence. When systems are labeled, this result does not hold for any of several previously proposed sets of behavioral relations. Secondly, the paper compares the expressive power of behavioral profiles and regular languages. It is shown that for any set of behavioral relations, behavioral profiles are strictly less expressive than regular languages, entailing that behavioral profiles cannot be used to decide trace equivalence of finite automata and thus Petri nets.