Text document clustering can greatly simplify browsing large collections of documents by reorganizing them into a smaller number of manageable clusters. Algorithms to solve this task exist; however, the algorithms are only as good as the data they work on. Problems include ambiguity and synonymy, the former allowing for erroneous groupings and the latter causing similarities between documents to go unnoticed. In this research, naïve, syntax-based disambiguation is attempted by assigning each word a part-of-speech tag and by enriching the 'bag-ofwords' data representation often used for document clustering with synonyms and hypernyms from WordNet.
18 December 2014 in IEEE Transactions on Knowledge and Data Engineering
In time series analysis research, there is a strong interest in discrete representations of real valued data streams. One approach still considered state-of-the-art is the Symbolic Aggregate Approximation (SAX) algorithm. The interest of this paper concerns the SAX assumption of data being highly Gaussian and the use of the standard normal curve to choose partitions to discretize the data. The SAX approach chooses partitions on the standard normal curve that would produce an equal probability for each symbol. This procedure is generally valid as a time series is normalized to have μ = 0 and σ = 1. However, there exists a caveat to this assumption of equi-probability due to the intermediate step of Piecewise Aggregate Approximation (PAA). We show in this paper that when PAA is applied, the distribution of the data is altered, resulting in a shrinking standard deviation that is proportional to the number of points used to create a segment of the PAA representation and the degree of auto-correlation within the series. Data that exhibits statistically significant auto-correlation is less affected by this shrinking distribution. As the standard deviation of the data contracts, the mean remains the same, however the distribution is no longer standard normal and therefore the partitions based on the standard normal curve are no longer valid for the assumption of equal probability.
Machine Learning for Agents and Multi-Agent Systems: 10.4018/978-1-59904-941-0.ch023: In order to be truly autonomous, agents need the ability to learn from and adapt to the environment and other agents. This chapter introduces key concepts of
This article presents results from simulations studying the hypothesis that mechanisms for landmark-based navigation could have served as preadaptations for compositional language. It is argued that sharing directions would significantly have helped bridge the gap between general and language-specific cognitive faculties. A number of different levels of navigational and communicative abilities are considered, resulting in a range of possible evolutionary paths. The selective pressures for, resp. against, increased complexity in either faculty are then evaluated for a range of environments.The study aims specifically to identify whether there is a viable evolutionary path leading to compositional language, and if so, under what circumstances.The results show that environmental conditions can render a step towards more complex communication either desirable or harmul, and suggest that very specific initial conditions and changes in the environment, resp. the ecological niche occupied, would have been needed to select for compositional language. Subject to these conditions, a (proto)language using order, but no hierarchical structure could evolve. This represents a middle ground, which brings closer hypotheses about syntax that have so far appeared difficult to reconcile.