Search results for "Processing"
showing 10 items of 8572 documents
Automatic dynamic texture segmentation using local descriptors and optical flow
2012
A dynamic texture (DT) is an extension of the texture to the temporal domain. How to segment a DT is a challenging problem. In this paper, we address the problem of segmenting a DT into disjoint regions. A DT might be different from its spatial mode (i.e., appearance) and/or temporal mode (i.e., motion field). To this end, we develop a framework based on the appearance and motion modes. For the appearance mode, we use a new local spatial texture descriptor to describe the spatial mode of the DT; for the motion mode, we use the optical flow and the local temporal texture descriptor to represent the temporal variations of the DT. In addition, for the optical flow, we use the histogram of orie…
Turing's error-revised
2016
Many important lines of argumentation have been presented during the last decades claiming that machines cannot think like people. Yet, it has been possible to construct devices and information systems, which replace people in tasks which have previously been occupied by people as the tasks require intelligence. The long and versatile discourse over, what machine intelligence is, suggests that there is something unclear in the foundations of the discourse itself. Therefore, we critically studied the foundations of used theory languages. By looking critically some of the main arguments of machine thinking, one can find unifying factors. Most of them are based on the fact that computers canno…
Biased graph walks for RDF graph embeddings
2017
Knowledge Graphs have been recognized as a valuable source for background information in many data mining, information retrieval, natural language processing, and knowledge extraction tasks. However, obtaining a suitable feature vector representation from RDF graphs is a challenging task. In this paper, we extend the RDF2Vec approach, which leverages language modeling techniques for unsupervised feature extraction from sequences of entities. We generate sequences by exploiting local information from graph substructures, harvested by graph walks, and learn latent numerical representations of entities in RDF graphs. We extend the way we compute feature vector representations by comparing twel…
An intelligent learning support system
2017
Fast-growing technologies are shaping many aspects of societies. Educational systems, in general, are still rather traditional: learner applies for school or university, chooses the subject, takes the courses, and finally graduates. The problem is that labor markets are constantly changing and the needed professional skills might not match with the curriculum of the educational program. It might be that it is not even possible to learn a combination of desired skills within one educational organization. For example, there are only a few universities that can provide high-quality teaching in several different areas. Therefore, learners may have to study specific modules and units somewhere e…
Supporting Institutional Awareness and Academic Advising using Clustered Study Profiles
2017
The purpose of academic advising is to help students with developing educational plans that support their academic career and personal goals, and to provide information and guidance on studies. Planning and management of the students’ study path is the main joint activity in advising. Based on a study log of passed courses, we propose to use robust, prototype-based clustering to identify a set of actual study path profiles. Such profiles identify groups of students with similar progress of studies, whose analysis and interpretation can be used for better institutional awareness and to support evidence-based academic advising. A model of automated academic advising system utilizing the possi…
Determining the number of sources in high-density EEG recordings of event-related potentials by model order selection
2011
To high-density electroencephalography (EEG) recordings, determining the number of sources to separate the signal and the noise subspace is very important. A mostly used criterion is that percentage of variance of raw data explained by the selected principal components composing the signal space should be over 90%. Recently, a model order selection method named as GAP has been proposed. We investigated the two methods by performing independent component analysis (ICA) on the estimated signal subspace, assuming the number of selected principal components composing the signal subspace is equal to the number of sources of brain activities. Through examining wavelet-filtered EEG recordings (128…
Modelling Recurrent Events for Improving Online Change Detection
2016
The task of online change point detection in sensor data streams is often complicated due to presence of noise that can be mistaken for real changes and therefore affecting performance of change detectors. Most of the existing change detection methods assume that changes are independent from each other and occur at random in time. In this paper we study how performance of detectors can be improved in case of recurrent changes. We analytically demonstrate under which conditions and for how long recurrence information is useful for improving the detection accuracy. We propose a simple computationally efficient message passing procedure for calculating a predictive probability distribution of …
Recommending Serendipitous Items using Transfer Learning
2018
Most recommender algorithms are designed to suggest relevant items, but suggesting these items does not always result in user satisfaction. Therefore, the efforts in recommender systems recently shifted towards serendipity, but generating serendipitous recommendations is difficult due to the lack of training data. To the best of our knowledge, there are many large datasets containing relevance scores (relevance oriented) and only one publicly available dataset containing a relatively small number of serendipity scores (serendipity oriented). This limits the learning capabilities of serendipity oriented algorithms. Therefore, in the absence of any known deep learning algorithms for recommend…
Scalable implementation of dependence clustering in Apache Spark
2017
This article proposes a scalable version of the Dependence Clustering algorithm which belongs to the class of spectral clustering methods. The method is implemented in Apache Spark using GraphX API primitives. Moreover, a fast approximate diffusion procedure that enables algorithms of spectral clustering type in Spark environment is introduced. In addition, the proposed algorithm is benchmarked against Spectral clustering. Results of applying the method to real-life data allow concluding that the implementation scales well, yet demonstrating good performance for densely connected graphs. peerReviewed
Are they different? affect, feeling, emotion, sentiment, and opinion detection in text
2014
A major limitation in the automatic detection of affect, feelings, emotions, sentiments, and opinions in text is the lack of proper differentiation between these subjective terms and understanding of how they relate to one another. This lack of differentiation not only leads to inconsistency in terminology usage but also makes the subtleties and nuances expressed by the five terms difficult to understand, resulting in subpar detection of the terms in text. In light of such limitation, this paper clarifies the differences between these five subjective terms and reveals significant concepts to the computational linguistics community for their effective detection and processing in text.