5,386 research outputs found
Taming Wild High Dimensional Text Data with a Fuzzy Lash
The bag of words (BOW) represents a corpus in a matrix whose elements are the
frequency of words. However, each row in the matrix is a very high-dimensional
sparse vector. Dimension reduction (DR) is a popular method to address sparsity
and high-dimensionality issues. Among different strategies to develop DR
method, Unsupervised Feature Transformation (UFT) is a popular strategy to map
all words on a new basis to represent BOW. The recent increase of text data and
its challenges imply that DR area still needs new perspectives. Although a wide
range of methods based on the UFT strategy has been developed, the fuzzy
approach has not been considered for DR based on this strategy. This research
investigates the application of fuzzy clustering as a DR method based on the
UFT strategy to collapse BOW matrix to provide a lower-dimensional
representation of documents instead of the words in a corpus. The quantitative
evaluation shows that fuzzy clustering produces superior performance and
features to Principal Components Analysis (PCA) and Singular Value
Decomposition (SVD), two popular DR methods based on the UFT strategy
Fredkin Gates for Finite-valued Reversible and Conservative Logics
The basic principles and results of Conservative Logic introduced by Fredkin
and Toffoli on the basis of a seminal paper of Landauer are extended to
d-valued logics, with a special attention to three-valued logics. Different
approaches to d-valued logics are examined in order to determine some possible
universal sets of logic primitives. In particular, we consider the typical
connectives of Lukasiewicz and Godel logics, as well as Chang's MV-algebras. As
a result, some possible three-valued and d-valued universal gates are described
which realize a functionally complete set of fundamental connectives.Comment: 57 pages, 10 figures, 16 tables, 2 diagram
- …