Following the previous post on cover sets in q-analysis it is important to consider another way for constructing simple cover sets where key terms represent criteria for determining ranked “meaning” in a text stream. This is particularly relevant in the automated formation of ontologies from a given set of text documents. The recent proliferation of formalized linked vocabularies for domain specific knowledge representations provide a valuable input source for generating new cover sets in the q-language system. The elements (vocabulary words) are the most important features because they correspond directly to the terms we are hoping to cluster documents around. And in a sense we can ensure some level of relatedness between terms and our document vectors through simple cooccurrence calculations. In this way the features, operate as "attractors" -- points at which other terms congregate around due to the rules of a given relation. In this case, it ...
I n my previous post, Q-Analysis of Natural Language I started to describe a path for applying q-analysis in the study of natural language. One of the particularly interesting aspects of q-analysis is the ability to connect hierarchical data in a rather straightforward (although non-trivial) manner. The process of connecting data are described through the definition of a relational mapping and the rules defined for that mapping. The relational mappings result in a new subset consisting of the combinations of the two input sets. The resulting new combinatorial set serves as a cover for constructing q-connected simplicies. Thus allowing for inspection of the q-connectivity of sets across hierarchical scales. The below example described in Beaumont and Gatrell , shows the mappings between elements at different hierarchical levels of N. The structure is the resulting mapping between three interrelated sets defined by the relation. In the language of q-analysis, ...