Knowledge discovery in multidimensional knowledge representation framework
- 1.1k Downloads
Visualization of results is one of the central challenges in big data analytics and integrative text mining. With a growing amount of unstructured data and different perspectives on big data, knowledge graphs have difficulties to simultaneously represent and visualize all analyzed dimensions of knowledge. This paper proposes integrative text mining as a solution to combine results from different dimensional analysis in a multidimensional knowledge representation (MKR) for knowledge discovery and visualization purpose. Analysis results from named entity recognition, topic detection, sentiment analysis and the extraction of semantic relationships are, therefore, integrated into a common representation structure. In the implementation part of this research, an application is introduced which utilizes MKR based on the results of stated text mining methods applied on a German and English news data set. State-of-the-art visualizations are used in the application and MKR adaptively transforms the visualization type of the knowledge graph according to the selected context for knowledge discovery.
KeywordsKnowledge representation Knowledge graphs Text mining Natural language processing Information visualization
Today’s time can be characterized as the information age, with advances towards digitalization and connective networking provided by the internet of things. Technological changes are causing constant information growth, which means the production, collection and analysis of unstructured, semi-structured and structured big data. Especially for unstructured data, the volume of user-generated content has enormously increased over recent years as a result of the strong attraction of social media in the World Wide Web (WWW). Consequently, the variety of social media produced data (e.g., text, image, audio, video) and the velocity of the heterogeneous content, makes it difficult to maintain an overview of current news, events, facts, contexts, relationships and the connections between all of them. Nowadays, social media users are even facing a challenge from being influenced by doubtful information. The information overload and stated trends are likely to further increase over the next years.
Semantic technologies facilitate the connection of web data sources and enable the structured representation of relations between pieces of different information . In the semantic context, information is considered to be a set of objects and meaningful relationships which can display a larger, complex picture in a simple and structured representation. To this aim, the visualization of semantic structures is typically a graph which includes graphical mappings of topics, concepts, and, or entities. In addition, these structures, such as semantic networks, contain relationships between these objects. A typical representation and visualization for large semantic networks are knowledge graphs—a graphical representation of a knowledge base. The information in the knowledge base can be organized in various forms, although the typical form of the knowledge base representation is an ontology, a collection of semantic triples or dimensional information which is stored in a multidimensional knowledge base . The analysis and representation of semantic relationships between entities, the information extraction, or the inference on knowledge graphs, are only a few examples for the utilization and application of knowledge graphs. Large knowledge graphs have been established in the past years. Freebase , WikiData1, Yago , NELL2, Microsoft Concept Graph3, and Google Knowledge Graph4 are typical examples.
Integrative text mining is the process of information extraction from textual resources in various analysis perspectives and the combination of the results for further analysis potentials. In general, text mining provides a set of different statistical methods for computers to understand textual unstructured content. Typical applications are text classification or clustering, topic detection, entity recognition, sentiment analysis, automatic document summarization or knowledge fact extraction. With the possibilities of different text mining analysis, topic, sentiment, entities and facts can be determined and represented in separate visualizations. However, in the approach of integrative text mining, different analysis perspectives are combined in order to gain additional information or to exploit further analysis potentials.
Simitsis et al. used a multidimensional structure for analysis and exploration of content by combining keyword search with online analytical processing (OLAP) aggregation, navigation, and reporting . Zhang proposed the usage of topic modeling for OLAP on multidimensional text databases (MTD) . Lin et al. define Text-Cube model on multidimensional text database . Similarly, the proposed multidimensional knowledge representation (MKR) as a framework for text analytics has been conceptualized by the authors . This article is an extension of the approach. It shows how MKR can be applied in practice as a means of integrating various results into a common representation structure and how the benefits of MKR affect visualization and knowledge discovery. MKR captures rich information and puts it into the right context. Moreover, in this paper we show how to utilize MKR in implementation, and for example how results from other analysis dimensions are used for dimensional selection or filtering in knowledge graphs. Therefore, the representation structure allows the adjustment on knowledge graph visualizations without any further analysis or calculation. Thus, by the selection or filtering of dimensions, additional analysis results are achieved, which were initially not considered. Both, MKR as framework based on integrative text mining results and the visualization of MKR by knowledge graphs are discussed in this research.
The article is structured in five sections. Section 2 is a literature review in the area of knowledge graphs, big data analytics, integrative text mining as well as the related methods. Section 3 discusses the MKR and provides further information about the visualization possibilities of analyzed textual content. Section 4 discusses the preparation of the data set and the implementation of this research. Moreover, the section discusses the results which have been produced by the application. Section 5 provides the conclusion and future work, which also summarizes the results.
2 Literature review
This article introduces MKR as a knowledge base representation structure for multidimensional information from unstructured data in large-scale knowledge graphs. Therefore, the state of the art in the fields of knowledge graphs, big data analytics, integrative text mining and related methods have been considered and reviewed.
2.1 Knowledge graphs and visualization
Knowledge graphs which illustrate and represent semantic knowledge are mostly based on the resource description framework (RDF) . Therefore, this section explains what RDF is and how it is used to semantically organize knowledge.
The internet offers a wealth of information, which has drastically increased by the widespread use of the WWW and information sharing across the private sector. In fact, a very large part of the web data has been mostly created by human end users and is therefore designed to meet human readability requirements. It is easily understandable and associable with other information created by the human mind. Computers, however, cannot easily find interconnections between different web resources. More specifically, the task to model the cognitive process of finding relationships is extremely complex.
A common framework to describe interconnections and relations between web resources is the Semantic Web. It is based on the idea of mapping the information in a machine-readable form. To this aim, the World Wide Web Consortium (W3C) has defined several standards in recent years to facilitate this process. This efforts resulted in specifications for the extensible markup language (XML), RDF and the Web Ontology Language (OWL) . The latter two refer specifically to knowledge bases or the knowledge acquired from documents in an application area . RDF was developed in the 1990s and was officially released in 1999 by the W3C. While the focus was mainly on the metadata (data about a given data set) , the Semantic Web increasingly influenced the use of RDF. It is now a formal language for the description of structured information , with which data on the web can be exchanged without loss of meaning, which makes a difference to XML and HTML (typically responsible for the illustration of information). A revised RDF specification was published in February 2004 .
The knowledge graph representation of RDF or a collection of RDF documents is made by the idea of a directed graph, consisting of nodes which are connected by directed edges. Unique identifiers are assigned to both elements. In contrast to XML, RDF has not been designed for hierarchical structures, but for the general description of relationships between resources. In addition, RDF has been developed for the description of data on the WWW and other electronic networks with decentrally store information. The combination of those resources is not a problem in RDF, whereas tree structures like XML are hardly suitable for this.
As mentioned, the nodes and edges in RDF have an identifier. This is motivated by the fact that resources in different data sources are maybe the same, but are not identical, or identical, but described differently. To counteract this, RDF uses an Uniform Resource Identifier (URI). Online documents in the WWW can be uniquely identified by the Uniform Resource Locator (URL), while offline resources do not have a URL, which are then referred to by Uniform Resource Names (URN). URNs and URLs complement each other.
Although the graph-based representation of RDF is descriptive and comprehensible, it is not directly suitable for processing in computer systems. Therefore, a serialization is needed which is the conversion of complex data objects into character strings . This converts the RDF description into a syntactic form which is machine readable. Each edge of an RDF graph is defined by its start and end point, as well as its label. In this way, an RDF statement is composed by these three components, the subject, predicate, and object , and form an RDF triple . Ultimately, the representation of a graph for semantic relationships is realized by a collection of triples.
A method for the extraction of semantic triples (see Sect. 2.4.4), which is a related method from the field of text mining, also uses RDF to represent automatically extracted knowledge facts from textual resources.
Information about data sources, their collection and the characteristics of big data analytics in the relation of knowledge graphs are given in the following section.
2.2 Big data and big data analytics
Big data define very large volumes of data in a wide range of applications. It has become a popular term used to describe the exponential growth, availability, and use of information, both from structured and unstructured data . The application of advanced data analysis methods in real or near-real time is called big data analytics. Big data analytics is the process of investigating large amounts of data with heterogeneous data types to discover hidden patterns, unknown correlations, market trends, user preferences, and other useful information . The results of big data analytics can provide important insights into areas such as the behavior of customers based on social media analysis with regard to a particular product . These results enable companies to improve their productivity and efficiency, and to make efficient and well-informed decisions . Fast big data technologies for big data analytics are using in-memory technologies and apply distributed parallel processing to handle data from different sources . In this way, data processing is much faster compared to conventional processing and storage techniques. For large-data scenarios with an increasing volume of data, NoSQL databases are particularly suitable. These databases do not rely on any fixed schema and are therefore compatible with many data types. Furthermore, they allow data formats and structure to be adjusted without affecting the used application landscape.
Big data are often characterized primarily by the large size of the information. However, there are also other important aspects; typical features are volume, data diversity (variety), and a high speed of data generation (velocity).
Volume: The first feature of big data is the amount of data. Companies are increasingly managing larger amounts of data. This is the case of Google, Yahoo or Facebook, for example, which stores about 500 terabytes of new data per day. A total of more than 4.4 zettabytes of data exist today. The requests from the approximately 1.37 billion daily active users on Facebook5 (average for September 2017) must be processed simultaneously. Relational databases are not very efficient for these data sets; therefore, database technologies with horizontal scalability are necessary. It becomes virtually impossible for a server to process such data alone because the data processing times are too long. The data from current statistics predict that 40 zettabytes of data could be reached in 2020.
Variety: Another important feature of big data is the variety of data. Big data are the storage of structured, semi-structured and unstructured multimedia data (text, images, audio and video) . The unstructured data are mostly information that cannot be stored in a relational database or conventional data structure. Latest statistics show that more than 80% of all available data are unstructured. These data come mostly from different social networks like Facebook, Twitter or YouTube. Such large, polystructured data sets (consisting of numbers, texts, images, videos, relationship data, etc.) have high potential in prediction and forecast analysis .
Velocity: The third mentioned aspect of big data is the velocity. Velocity means the speed at which the data are generated, stored, analyzed and processed . Big data need to be processed quickly to help organizations in making decisions. In the figurative sense, the speed of the data is becoming increasingly faster. For example, sensors, which are placed on streets to analyze road traffic, capture thousands of data values per minute. These data need to be processed in real time to predict traffic. Consequently, the speed of data processing is important in predicting of our climate, financial markets, and many other areas which apply forecasting models and methods.
The analysis of unstructured textual data sources from different perspectives is called integrative text mining. A literature background is given in the following section.
2.3 Integrative text mining
The terms text mining, web mining and data mining are often used in a similar context, although they are different application areas. The term text mining is also often associated with data mining as its upper category. Alternatively, text mining and web mining are described as a special form of data mining . Data mining, also known as knowledge discovery in databases (KDD), is concerned with the search and analysis of large amounts of data and the analysis of recognizable patterns and rules . The core idea here is the extraction of useful, reusable information within the data sets. For example, data mining techniques are used in the field of market research in order to recognize the customer’s buying behavior and to evaluate it accordingly. In addition, future behavioral rules can be derived from the data. For example, within a purchase, milk is purchased with a probability of 90%, if bread and butter are part of the purchase .
Text mining, sometimes synonymously stated as knowledge discovery from text (KDT), is not a clearly defined term . There are different views and definitions depending on the application. Essentially, methods of information retrieval (IR), information extraction (IE), and natural language processing (NLP) are used and combined with KDD methods. On this basis, several definitions can be distinguished which are based on the discipline’s view. In IE, for example, text mining aims at the concrete extracting of facts from texts . Text mining can be also understood as a text data mining process for recognizing meaningful patterns in texts by applying algorithms from the field of machine learning (ML) and statistics. In this case, preprocessing steps and, where appropriate, NLP operations are necessary to prepare the text, so that subsequently adapted data mining methods can be used . Furthermore, text mining can be seen as a KDD process, whereas several individual (pre-processing) steps have to be done in order to apply data mining methods for statistical analysis . As an extension, integrative text mining is an approach where individual, specialized text mining methods are applied in combination in order to process and analyze data from multiple perspectives.
Many different areas influence text mining. The previously stated IR, IE, NLP, and ML are important to be mentioned. In the case of IR, typically search requests from users are processed by finding suitable documents. The automatic processing of text data is achieved using statistical measures and methods to transform text into a suitable mathematical model. IR has been studied in the scientific field for a long time and was initially used for the indexing of documents . It was again given greater importance by the dissemination of the WWW and the associated requirements on mature search engines. IR in the traditional sense deals with questions and the associated answers. However, document retrieval systems based on indexing are often assigned to the IR field . IE aims to extract information relevant to a context from text documents and to make it available (for example in the form of databases) [21, 23]. NLP should provide better understanding of natural language when using computers . NLP tasks include a range from the simple processing of character strings up to the automated question answering with regard to natural language queries . ML is related to artificial intelligence and involves the development of methods for learning by analyzing data. ML can, for example, independently analyze unknown textual data and apply already trained classifiers based on acquired knowledge or experience.
Specialized methods from the text mining field which are from high importance for MKR are introduced in the following section.
2.4 Related text mining methods
This section provides a description of related methods from the integrative text mining domain. Named entity recognition, topic detection, sentiment analysis and semantic triple extraction are described in the following as specialized text mining analysis for the construction of MKR-based knowledge graphs.
2.4.1 Named entity recognition
Named entity recognition (NER) is a process of IE, in which specifically named persons, organizations, locations and other entities are identified within texts. In many NLP, IE, and IR systems, it is one of the first steps  and a core task, for example, in automated summarization or machine translation . Moreover, for knowledge extraction, knowledge graph construction and more specifically, the extraction of semantic triples (in the form of subject, predicate, and object), NER is of considerable importance, since names often represent subjects and, in some cases, objects and therefore must be recognized.
According to Nadeau and Sekine, NER methods are classified according to their learning approach . Therefore, there are existing supervised methods that use, for example, Hidden Markov Model (HMM) , Decision Tree , Support Vector Machine (SVM) , Maximum Entropy Model (MEM) , or Conditional Random Field (CRF) . Semi-supervised approaches require at least small amount of user input, such as a training set. The process is called bootstrapping, in which case the user could provide example names that allow the system to recognize other named entities from similar contexts . The unsupervised methods depend on the analysis. Clustering for example is often used to create named entities from contextually similar groups.
NER is a complex task that depends on many factors such as the language of the data. In English, for example, good candidates for named entities can be already guessed by large initial letters . In contrast, in the German language, this rule-based approach is not possible due to a completely different grammar. Other writings, character or symbol languages need again different approaches.
In general, two variants are available for the realization of NER, the rule-based variant and the list-based variant . While the rule-based variant is based on grammatical, statistical or other information (whether a word, word tuple or n-gram is a named entity), the list-based variant takes potential names and compares them with dictionaries or lexicons from named entities. There are also mixed forms of both variants.
Previous studies like the one from Nadeau and Sekine  show that three learning methods are differentiated in order to recognize named entities. At the beginning of the research in the area of NER, emphasis was placed on the recognition of entities by means of manually created rules. Over the course of time, the supervised learning method of ML was applied for NER. With the help of large annotated document collections, also referred to as corpus, the properties of the entities are studied with positive and negative examples and rules for recognition are automatically created. Supervised methods can be described with the following similarities : (1) Reading in a large annotated corpus; (2) Save a list of entities; (3) Creating disambiguation rules based on exclusionary properties.
If no corresponding corpus is available, the semi-supervised learning or the unsupervised learning methods from ML could be used .
Previous NER research on the MUC-6 and the MUC-7 corpus shows improvements in the NER task. On the basis of the MUC-6 training data Palmer and Day did a transfer of 21% . 42% of the place names, 17% of the organizations and 13% of the family names were reproduced . Mikheev et al. calculated 76% for location names, 49% for organizations, and 26% for family names with a precision of 70–90% on the MUC-7 corpus .
For NER based on supervised learning, statistical machine learning forms the foundation. It is based on sequence labeling problems such as other NLP methods [e.g., Part-of-Speech (POS) Tagging] and is a general problem in machine learning. Jiang formulates it as follows: The sequence of observations is given as \(x = (x_1, x_2, \ldots , x_n)\). Each observation is represented by a feature vector . Each observation \(x_i\) is assigned to a label \(y_i\). The label for \(y_i\) can be predicted based on \(x_i\) in standard classification. However, it is assumed that the label \(y_i\) does not only depend on \(x_i\), but on other observations and labels in the sequence. Typically, this dependency is limited to observations and labels from close neighbors in the sequence of current position i . It is further important to note that the named entity boundaries and named entity types need to be considered. The BIO notation known from text chunking is useful in this regard [36, 37].
2.4.2 Topic detection
Topic detection is a classification task. The classification includes the assignment of documents or parts from documents to predefined classes. Texts (or text fragments) can, for example, be assigned to related subjects (sports, politics, business, culture, etc.). In this case, a training set (a predefined amount of documents) is typically used, where documents have already been assigned to existing classes. The goal in this statistical approach is to derive a model for classification.
A new document is typically compared with documents already allocated to topics. The higher the number of matching features from the new, unassigned document, compared to the documents already classified, the higher is the likelihood to also be related to the comparison document’s topic. One of the methods for generating document features is the TF–IDF measure . It is a combination of the term frequency (TF) and the inverse document frequency (IDF). TF–IDF evaluates single terms from a document and compares them within a document collection. If a term occurs in a small number of documents from the collection and occurs multiple times within a document, it is considered very characterizing.
For the evaluation of assigned documents to topics, the key figures precision and recall are well known. In the former, the relevant (correctly classified) documents are compared with all recorded documents, while recall indicates the relationship to all relevant documents . However, if one of the key figures is to be improved, this inevitably has conflicting consequences for the other. This conflict can be analyzed by determining the F-Score. The F-Score contains both key figures and thus offers an attempt at a compromise .
Latent Dirichlet Allocation (LDA) is a well-known topic model, where each document is understood as a mixture of topics, and topic can be specified as a discrete probability distribution, which tells how likely a word belongs to a given topic . Latent semantic analysis (LSA) is a method for extraction and representation of contextual meaning of words by statistical computations applied on a large text corpora . Compared to LSA which stems from linear algebra and performs a singular value decomposition of co-occurrence tables, Hofmann proposed probabilistic latent semantic analysis (PLSA) which is based on a mixture decomposition derived from a latent class model .
In addition to those models, it is also possible to carry out next-neighbor classification on textual data. On the basis of the texts already assigned, a comparison is made with new documents, which are then sorted into the same class as the one to which it is most similar. The similarity is determined, for example, by coinciding words within the texts . Further similarities are given in . Other alternatives are binary decision trees or classification rules which are discussed in .
For the detection of multiple topics within text document structures, Klahold et al. defined associative gravity as a new method to separate documents into topic-related clusters . The method is based on the text mining method entitled CIMAWA, which imitates the human ability of word association . Different topics are identified within documents by utilization of the word association strength between identified keywords.
2.4.3 Sentiment analysis
Sentiment analysis is a method related to text mining [46, 47]. For the concept of sentiment analysis, different terminologies can be found in the literature. Frequently used terms are opinion mining, sentiment analysis and subjectivity analysis [47, 48]. Others are using the expression polarity detection . The inconsistent terminology is mainly due to the different backgrounds of the researchers. While the term opinion mining has its origins in the fields of web search and IR, the terms sentiment analysis and subjectivity analysis come from NLP research . Although these terms may be used for slightly different tasks or viewing angles, they represent the same research field [50, 51]. Broß defines sentiment analysis in general as a research field that uses NLP techniques to automatically identify and analyze subjective information in natural language texts . One of the objectives is to determine which subjective information is expressed against which objects (entities) in the text . Subjective information can manifest itself both explicitly through the expression of opinions or facts, as well as explicitly in the author’s attitude . In the literature, the sentiment analysis was essentially examined on the following three levels :
Document: At this level, the task of sentiment analysis is to determine whether an entire document expresses a positive or negative sentiment . This form is known as a “document-level sentiment classification” and can, for example, be used to determine whether a product review overall expresses a positive or a negative sentiment about the product . Since a single document can contain several topics and thus different sentiments, the assignment of a single sentiment for the entire document is generally inaccurate.
Sentence: The task of the sentiment analysis on the sentence level is to recognize which sentences of a document express a positive, negative or neutral sentiment . In the example of the product review, the sentiment analysis at the sentence level allows to examine which sentences of the reviews express a positive, negative or no/neutral sentiment about the associated product.
Entity and aspect: Sentiment analysis on entity and aspect levels (also called aspect-oriented sentiment analysis) is a fine-granular form of sentiment analysis. Unlike the other levels, the sentiment is analyzed as to what the author likes or dislikes . There are no documents, paragraphs or sentences as a whole in the focus, but the opinion itself . It is based on the assumption that an opinion consists of a sentiment and objectives (entities), towards which the sentiment is expressed . In this regard, objectives of the sentiment can be entities or their different aspects . In the example of a product review, the reviewed product corresponds to an entity, while product properties represent aspects of the entity.
The polarity in sentiment analysis can be generally divided into positive and negative . It is thus a binary sentiment classification. An example of another binary sentiment classification is the agreement detection . Kaur, Gupta and others, on the other hand, have a neutral polarity as a third possibility of polarity detection .
The importance of sentiment analysis has increased since Web 2.0. Forums, blogs, review portals, social networks etc. are becoming increasingly popular. Here, people write their opinions and feelings on topics that move or interest them. Thus, there is an increasing interest in sentiment analysis from a number of external parties, particularly marketing departments. Due to the enormous number of texts and information, automated sentiment analysis is indispensable in this regard.
New approaches in sentiment analysis are emotion detection, transfer learning, building resources  or the analysis of word associations for sentiment evaluation . Emotion detection is a task of sentiment analysis, which in contrast to classical polarity detection is divided not only in positive and negative. The goal is to recognize concrete emotions. Medhat et al. call the eight emotions joy, sadness, anxiety, fear, trust, disgust, surprise and anticipation . In transfer learning, sentiment classification is transferred from one domain to another. This means, the knowledge gained in a domain is also used to improve the learning process in another domain. Building resources mean that resources are created that support sentiment analysis. For example, dictionaries and corpora are created in which polarities are assigned to the individual concepts .
There are a number of methods that are applied in the field of sentiment analysis. Basically, the methods of sentiment analysis can be divided into two broad areas. These are, on the one hand, the lexicon-based and ML approaches .
Lexicon-based: The lexicon-based sentiment analysis approach is again divided into the areas of dictionary-based approaches and corpus-based approaches . The dictionary-based approach begins with words whose polarity is already known. Now, in word databases such as WordNet, synonyms and antonyms for these words are searched. The found words are then added to the original list. The process is iteratively repeated until no new words can be added to the dictionary . One of the strengths of the corpus-based approach is the search for opinions with context dependency. The corpus-based approach can in turn be divided into two areas, the statistical and the semantic part . The statistical approach considers the occasional frequency. If a word is used more often in positive texts, its polarity is positive. For a more frequent use in negative texts, accordingly negative. If the word is used evenly, the polarity is neutral. On the other hand, the fact is used that similar expressions are frequently used together in one text. If these words are identified, they can be assigned the same polarities . In the semantic approach, in which semantic similarity between words is considered, similar polarities are assigned if two words have a strong semantic similarity. The semantic approach can also be combined with the statistical approach .
Machine learning: The ML-based sentiment analysis methods are divided into the categories supervised and unsupervised learning methods. Supervised machine learning is dependent on the existence of annotated test data to train the methods. Since it is often difficult to obtain such suitable test data, unsupervised machine learning is an alternative. Here, for example, keyword lists and similarity measurements are used to classify the texts . A detailed overview of the methods of sentiment analysis is given by Medhat et al.  and Varghese and Jayasree .
2.4.4 Semantic triple extraction
Akbik and Broß introduced “Wanderlust”, a system by which semantic relations can be derived from grammatically correct English text . The basic idea of this approach is the identification and usage of grammatical connections between words and sentences. Their assumption is that syntactic, grammatical connections also imply semantic associations. Therefore, the aim is to derive triples consisting of a subject, predicate, and object, which should correspond to the statements in RDF . The link grammar (identifying relations between pairs of words) allows to determine the linkages within sentences by means of a detailed linguistic analysis of the sentences . Unlike a PoS Tagger, the individual words are not marked by their own characteristics (tag), but rather their connection to subsequent words. The link between two different words is called linkpath. Akbik and Broß explained it further with the example “Essen” (start term) “is” \(\rightarrow \) “city” \(\rightarrow \) “in” (wordpath) \(\rightarrow \) “Ruhr Area” (end term) . The complete predicate in this example “IsCityIn” can be generated by the concatenation of the elements from the wordpath.
The important condition here is that no further additional semantic information, but only the grammatical structure of the sentences, was used to determine RDF-like triples. Akbik and Broß further integrated NER into their system and created a training set with 46 linkpaths for the analysis of Wikipedia content .
The presented method from Akbik and Broß facilitates an initial semantic analysis on text resources based on grammatical structures. In this way, well-written textual resources can be easily (rule-based) scanned for contained entities and their given relationships. Compared to other methods from semantic analysis or association measures, the presented method does not rely on any large semantically annotated text corpus, ontology or any other training data. However, the facts which are acquired from the grammatical analysis are much lower in the number of occurrence, but with very high precision. Of course, the method cannot be used on content which is not written in sentence structure or without a correct writing style and grammatical correctness.
3 Multidimensional knowledge representation
Typical visualization types for text mining analysis results
Multidimensional knowledge representation (MKR) for text analytic results has been conceptually proposed in related work by the authors . In this article, the practical implementation of MKR and the aspect of method combination through integrative text mining in order to utilize MKR are focused.
MKR is a representation format which allows the combination of different analysis results from integrative text mining and related methods in the knowledge base. Therefore, the results which are achieved by synchronously or asynchronously calculated text mining methods are considered as dimensional information and inserted in a uniform representation structure. By the combination of different analysis perspectives and their results, the knowledge base is able to provide a broad overview on gained information and uses it for further analysis and requests. In this way, the integration of the analysis results into a holistic knowledge representation structure offers advantages in visualization of data and knowledge base inference.
While normal representation structures are limited to and based on a specific predefined analysis result, multidimensional representation structures are able to offer further unexpected analysis results, context or additional information for the process and methods of knowledge discovery. This is especially reflected in the knowledge visualization since suitable knowledge graphs can add further results from different other analysis dimensions or perspectives for adjustment or adaptation. In this way, the results are used to contextualize, filter, compare, combine or even for mining of unexpected results in further analysis.
As an example, if a knowledge base is queried for entities which are directly related to a specific topic in a given time frame, MKR can directly offer more information about sentiment information or extracted facts, both related to the entities, time frame and topics. The visualizations of the entities, e.g., entity type-specific nodes with a color indicator from red (negative) to green (positive), are used in this scenario to show the sentiment relationship within in the same visualization while, if desired, edges could indicate a semantic relationship or other nodes indicate a topic relationship or influence the layout arrangement.
As this example shows, MKR is specifically meaningful in the knowledge visualization since the results from other analysis methods are directly added to the main visualization without modifying the knowledge base query at all. Table 1 provides an overview of the typical visualization possibilities for different text mining methods and MKR provided modification.
3.1 Processing and representation
Typical knowledge management tools are document management systems (DMS). DMS normally use indexing on various variables or features (e.g., metadata) to browse and search for documents in the knowledge base. The representation of documents is typically a set of properties in a relational database. With schema-less structures in NoSQL databases, representation methods are allowed to be more flexible. In this way, the basic document representation format from knowledge bases is dynamically enriched by additional dimensional information or analysis result whenever it is available. The support of this enrichment process is the main intention of MKR.
MKR wants to prevent multiple queries on the knowledge base by the combination and storage of different text mining analysis results in one representation format. The contained additional pieces of information are provided by the methods of integrative text mining, namely named entity recognition, topic detection, sentiment analysis and the extraction of semantic relationships. It is notable that other text mining methods can be added to the MKR process and into the same resulting representation structure. As an example, long-term and short-term word associations from entities within the document could be added into MKR and would be available for temporal analysis on documents over time without re-calculation.
Pre-processed documents are taken from the knowledge base and analyzed essentially in four steps: (1) Extraction of named entities (2) Detection of topics (3) Determination of sentiments (4) Extraction of semantic relations. Afterwards, the analysis results are collected, stored and represented in the database in JSON format. Figure 1 illustrates the MKR process.
It is further important to mention that the MKR process does not necessarily need to follow a four step process. Methods could be skipped; other methods included, or, even executed independently—if no dependencies. Due to schema-less representation of MKR JSON format, results can be added in the knowledge base whenever they appear or have finished calculation.
The next section provides a more detailed description about the visualization possibilities of MKR. State-of-the-art visualization methods are used to explain the benefits of MKR and the utilization of them as multi-dimensional visualization instruments.
3.2 Adaptation of state-of-the-art visualization
In the following, visualization types will be explained which can be mostly considered as state-of-the-art visualizations from related work in data mining and knowledge discovery [57, 58]. By shortly explaining the main goal of the visualization types, the advantages of MKR should be highlighted by description of the visualization modification and adaptation possibilities mentioned in Table 1.
3.2.1 Overview graphs
Overview visualizations are used to provide a summary of the most important, the latest, or the most unexpected information at a given time. In the following, the instruments tile view and topic map are presented as overview visualization tools which work very well in combination with MKR.
Tile view: The tile view is an overview visualization which represents a selected set of items. The items can typically vary in size and/or color. The number of items is also variable. For textual data, a tile normally contains a summary of the textual content or the first part of the text as a preview. Here, results from named entity recognition, sentiment analysis or topic detection, but also semantic triples can be used to modify the colors and size of the tiles. For results from named entity recognition, images are also useful to represent the text’s containing entities and they can be used for visualization purpose in the background of a tile for example.
Topic map: The topic map is another overview visualization which represents a selected set of items. The items can typically vary in size and/or color. Each part of the topic map represents a dimensional information at a certain hierarchy level. Figure 2a provides an example of the topic map visualization. Each rectangle represents the topic of a collection of documents in which the topics have been recognized based on a topic detection method and the analysis results have been stored in MKR. Related subtopics, also referenced to topics and represented in MKR, are further visualized here—in order to preview the distribution of the document collection based on rectangle size. The topic map is interactive and allows to navigate to different hierarchy or dimensional levels. For example, a navigation from all topics into a specific topic is shown in Fig. 2c where the topic “society” has been selected and the layout of the topic map has been changed to visualize related entities of type “person” represented in MKR (similar to a drill down operation). As shown in Fig. 2c the small collection of rectangles inside the topic indicates the number of occurrence of the corresponding entity in the document collection. Further drill down into the document subset which matches the “society” topic, and a specific entity is again possible to select and so forth. In general, MKR structure enables the adjustment of the topic map in desired dimensions. Another example is shown in Fig. 5 in which the sentiment analysis results from MKR representation are used as another filter.
3.2.2 Statistical graphs
Statistical graphs are usually used to visualize information from a category (e.g., knowledge dimension) over a given time dimension. Therefore, statistical graphs typically represent the time dimension with an adjustable scaling. Area chart, bar chart and scatter chart are typical examples and are explained in the following.
Area chart: In the area chart different time series are represented in the form of stacked areas. All data values of the time series represent a summary of analysis results at a given time (or time period). Colors and the appearance as well as number of stacked areas are modified based on selected dimensions.
Bar chart: Typically, an amount of data is represented horizontally or vertically at different given discrete values (e.g., time stamps) in order to create a bar chart. Bars can include different categories and represent analysis results in stacked or grouped form. Figure 2b illustrates an example in which the topic map has changed to a bar chart while the same result MKR representation is active. Here, different topics are visualized together with a time dimension and show the number of documents related to topics over time.
3.2.3 Entity graphs
The entity graph is a visualization type which uses nodes and edges to show relationships between data. Each node typically represents an entity or a collection of entities. Nodes and edges can vary in size, distance and color to illustrate additional information. The layout of the entity graph can be adjusted based on several layout algorithms. Figure 2e illustrates an example in which documents are visually connected to the extracted entities from the textual content. The entity graph is the best option to visualize the semantic relationship from extracted entities and RDF triples (e.g., nodes for subjects/objects, and labels for predicates).
3.2.4 Map graphs
Documents which contain named entities with type “location” can be used for abstract visualization in a map graph. Each named geographic location can be used to highlight different parts of the map. For example, countries are visualized on the map and can be used to show analysis results. Figure 2f illustrates an example with countries which are mentioned as named entities in the contents of a document collection. The color intensity is for example based on the frequency of named entity occurrence or based on other method results, stored in MKR, such as the sentiment or topic relationship.
Knowledge graph visualization examples based on MKR
MKR enables an easier transformation from one knowledge visualization into another because of the generic representation structure and combination of dimensional analysis results. Dimensional selection and dimensional filtering are two potential MKR operations which can be used to adjust the MKR analysis results for visualization purpose. An overview about exemplary visualization transformations is given in Table 2. It further describes use cases of MKR by potential combination of different dimensions in different visualizations.
Dimensional selection separates the knowledge base’s MKR data set into a smaller subset by choosing one or multiple values for the data source, time, or language. In this way, a specific subset from the knowledge base can be prepared or adjusted dynamically.
The dimensional filtering operation creates a smaller MKR subset by filtering of analysis results with specific values from one or multiple dimensions. The analysis results and therefore searched knowledge items, represented by MKR in the knowledge base, can be greatly reduced through dimensional filtering. As an example, a dimensional filtering creates a knowledge base query, which executes a search for documents which are related to a specific topic (e.g., politics), have a specific range of sentiment (e.g., positive) and contain at least the occurrence of specified entity (e.g., White House).
4 Results and discussion
The main implementation of this research was created in C# and the Windows Presentation Foundation (WPF) framework. For the data collection task, a script written in R has been used to externally crawl German and English news portals on distributed machines and storage in a NoSQL database (MongoDB). PhantomJS (a headless browser used for automating web page interaction) is executed by the R script to load and iteratively crawl the content of websites. A test data set has been created between September 2016 and April 2017. The data set is about 19.7 GB in size and includes 305,281 articles, together with images and pre-processed content from different typical news domains (e.g., finance, economy, politics, sport, lifestyle, culture, science and others) with an average length of 6,115.77 characters and 618.56 words each. German and English languages have been chosen by the authors to see how the implemented methods can be adjusted or directly used on both languages and to identify language-specific problems in order to solve them in this research and future work.
4.1.1 Data collection
Dynamic web crawling: Due to the individual, dynamic structure of web pages in the WWW, it is hardly possible to know where the actual headline, body, date, author name or other metadata from a published (textual) news is located on a specific website. For example, some pages use simple <p> elements (text paragraphs), others use <div> elements (block of paragraphs and multiple elements, such as images, tables, etc.) to define parts of the HTML document. Elements normally also use class or id attributes in conjunction with Cascading Style Sheets (CSS) to apply a defined layout or style on the web page. To extract text information from a website, it must therefore be known a priori in which HTML tags or CSS elements the actual message text can be found. Moreover, the news text can also spread over several elements.
In general, there are two possibilities to solve the web crawling problem. For each news portal, a customized web crawler has to be developed which is specially adapted to the characteristics of the web page, or a generic crawler needs to be used which stores all the elements of a web page and, if available, all the associated information such as CSS identifiers. The disadvantage of the first variant lies in the fact that with an increasingly large number of different news portals also many crawlers or crawler variations would have to be written, updated or even adjusted in case of changes in the structure of the portal or web pages. The second approach is a generic web crawling approach which can be applied on almost every CSS styled web page. The crawling is done based on CSS element selection. Each available class or id attributes from the HTML elements on a web page, formatted with CSS, are used as selection parameter in XML Path Language (XPath) queries. This results in the extraction of different larger meaningful parts from web pages. Of course, a lot of unnecessary content is extracted in the same way, too. However, the rule-based cleaning and pre-processing of the documents that result from the second crawling approach are easier than the manual customization of different web crawlers depending on the target news portal or even web page level customization.
4.1.2 Data pre-processing
The pre-processing steps which are implemented in the C# prototype are described in the following sections. The tasks which are applied on loaded documents from the MongoDB include language detection, POS tagging and sentence splitting. An own implementation of the pre-processing steps within the prototype has been chosen over state-of-the-art because of customization possibilities, research purpose and especially for future work adaptation.
Language detection: The prototype uses a language detection system which analyzes the textual content from MongoDB documents and determines the stop words within the news text. Two different lists of stop words for German and English language are available and contain several language-specific, non-meaningful words. Each word from the document is compared to the entries in the stop word lists and the corresponding language with the most matches is finally detected as the document’s language. This detection approach works very well with large documents and considerably well with short texts. Documents which contain very small text fragments or text phrases without using any stop word are labeled for manual user detection.
Sentence splitting: A logic process has been implemented in the prototype which splits documents into sentences. A rule-based model has been created to split sentences based on a set of regular expressions (e.g., applied on punctuation). Moreover, additional language-specific rule sets are used to avoid wrong sentence splitting in many different occasions.
Part-of-speech tagging: The prototype has an implemented POS tagger based on Hidden Markov Model (HMM). The POS tagger uses the STTS tagset  for German language and the Penn Treebank tagset  for English language. Both implemented POS taggers are using a separate corpus (training set) with POS annotated sentences and around 1 million words. Also the viterbi algorithm  is applied in both taggers.
4.1.3 Data analysis
In the data analysis step, pre-processed documents are analyzed by the introduced text mining methods, in order to extract dimensional information for the MKR structure. Therefore, the data analysis in the implementation follows the steps of the MKR process which have been explained in Sect. 3.1 and visualized in Fig. 1. The implementation details of named entity recognition, sentiment analysis, topic detection and semantic triple extraction are given in the following sections.
Named entity recognition: Named entities are firstly recognized within documents based on the POS tags in splitted sentences. The POS tag sequences provided from pre-processing are further analyzed in a second step to combine coherent words, which all have been tagged as named entity into one entity. Afterwards, a lexical resource and reference to German or English Linked Open Data is used to evaluate and distinguish potential suggested named entities. The resources which are language dependent contain the named entity categories date, location, organization, person and miscellaneous. Identified named entities are placed into the categories by a classification approach. Within the application, a blacklisting of wrongly tagged named entities is also possible to improve the quality of the named entity collection. Each of the document’s entities can be selectively edited, updated or deleted for manual adjustments.
Sentiment analysis: Sentiment analysis has been implemented in the application to identify words and n-grams which express a positive or negative polarity. Adjectives and adverbs are recognized based on POS tag information and language-specific lexical resources are used to evaluate them. In the English language, polarity shifters (“no”, “not” or the ending “n’t") before adjectives or adverbs are recognized within sentences and the corresponding sentiment values are turned around for negation handling. In the German language, the token “nicht" is another typical example for a polarity shifter. Sentiment intensifiers are used in the prototype’s sentiment analysis to increase the sentiment value of several words or n-grams in the positive or negative sense. Typical examples for the English language are “most”, “many”, “biggest”, “much”, “more”, “major”, “all”, “very”, “big”, “strong”, “every”, “truly”, “slightly”, “overwhelming” or “increasingly”. The evaluation of the document’s sentiment is based on the German corpus SentiWS  and the English corpus NRC Emotion Lexicon . Both corpora contain terms with negative and positive evaluation on a scale from − 1 to + 1. Sentiment detection is also done on more detailed level. Sentences which contain named entity information are further analyzed and a relationship between n-grams from the text and the entity is stored in MKR.
Topic detection: For the detection of topics two language-specific lexical resources were created, which contain words and n-grams on different subject areas. For the German language the corpus is based on Dornseiff, a German thesaurus arranged by subject groups . Topics and subtopics have been extracted in the scope of this research. An English version of the topic corpus has been created manually from the German corpus to also cover translated topics and subtopics. In the implementation, a document is assigned to a topic and subtopic area according to the word occurrences and correspondences of the n-grams with the annotated corpora. The classification process based on n-gram occurrence works very well for longer documents. In the case of shorter documents or documents which frequently change the topic focus, the implemented topic recognition is susceptible to errors. To eliminate the errors, a function has been implemented which provides the user with a notification for disambiguation on frequent occurrence of words from several topic areas. The list of topics based on  contains “nature and environment” with 25 subtopics, “life” (43), “room, position, shape” (46) “size, quantity, number” (52), “entity, relationship, event” (47), “time” (35), “visibility, light, color, sound, temperature, weight, aggregate conditions” (68), “location and location change” (46), “will and action” (83), “feeling, affects, character traits” (60), “thinking” (56), “sign, message, speech” (63), “science” (27), “arts and culture” (24), “human living” (80), “food and drink” (22), “sport and leisure” (28), “society” (33), “devices and technology” (27), “economy and finance” (50), “law and ethics” (35), “religion and spiritual” (20) and “other” topics. A dictionary with translations of topics and subtopics from English to German and vice versa has been created and is used by the application to sort the analysis results into a uniform topic structure.
Semantic triple extraction: For the semantic triple extraction, the approach from Akbik and Broß (see Sect. 2.4.4) is used in the application on the pre-processed sentences. A chunker has been implemented to assist the POS tagger in order to identify noun phrases (NP), proper noun phrases (PNP) and verb phrases (VP). For each sentence, it is checked whether two NP or PNP are contained. The results from named entity recognition are used in this step. If there are two such phrases, rules determine whether they are extracted as subject and object with an associated predicate.
The details of the extraction process are described as follows: First of all, cases in which NP or PNP pairs have been recognized in subordinate clause are removed from the analysis set. The extraction is also interrupted for certain punctuation marks between the phrases. Analogously, this is the case with text sections in brackets. Next, there must be at least one verb between the potential subject and the object, and a maximum of five words should be between these two, so that a direct semantic context is likely. If an NP is followed by a PNP, this is chosen instead of the NP, for a maximum of five words. This number has been found to be satisfactory during the development since larger distances sometimes led to incorrect associations and smaller distances to missing information. If these decision criteria are satisfied, a predicate is formed from the words between the subject and the object, in which, all the articles are omitted. Another rule-based filter which is similar to the one presented in Akbik and Broß  is applied in the last step on the created predicate to check whether it represents a semantic relationship (e.g., relation is “is-a” type).
After the text mining methods have been applied and the results have been collected, the MKR is created by the implementation and inserted in the knowledge base. Therefore, the MKR is saved in the MongoDB by utilizing a JSON format. Listing 1 describes the MKR structure for a referenced document in the knowledge base, while all the mentioned relationships are shown by way of example. A time stamp is created with all relationships in order to use the time as another analysis dimension and necessary information for different visualizations.
In the structure depicted in Listing 1, the results from previously mentioned sentiment analysis, topic detection, entity recognition and semantic relation are shown. Sentiment n-grams are provided with an ObjectId for further analysis of relationships between documents and entities with similar polarity. The relation between the sentiment n-gram and entity information (both referenced by ObjectId) is further described with additional details about intensification or sentiment shifting in negation cases. The (multi-) topic relation is represented by referenced topic names and subtopic names. In the entity relation part, named entities from the document are listed with their name, type, document language and their created timestamp for temporal analysis and potential analysis of entity occurrence over time. Semantic relationships between entities of the document are represented in the last part of MKR representation in Listing 1. Here, the subject, predicate and object of one RDF triple are stored in the knowledge base together with the timestamp and related Ids for further analysis of similarity and correspondence of entity references.
4.3 Knowledge discovery
MKR is especially important for graphical search and the knowledge discovery process in knowledge-based systems. Through the integration of different analysis results from text mining methods and their availability (pre-calculated results), MKR empowers different kinds of knowledge graphs to visualize a multidimensional perspective. Importantly, further analysis results from other dimensions can be integrated in the knowledge visualization by request. MKR operations and transformations, namely the selection and filtering of dimensions, adapt visualizations for specific queries. Moreover, knowledge graphs can be even exchanged by other visualizations and still integrate the same dimensions in the graph.
Figure 5 shows different components which can be used in the knowledge discovery progress. The different types of knowledge graphs (selectable in red highlighted area) provided by the prototype support the user by the search and visualization of desired information. The preview of further (not necessarily expected or desired) results from MKR besides the current visualization (purple) contextualizes the information and indicates results from other dimensions or further possibilities for dimensional filtering or selection. If such a filter is selected, the query on the knowledge base is automatically adjusted and the potential unexpected results are provided. In this way, the knowledge discovery process is exploratory and different information visualizations can be transformed into each other in order to adapt the knowledge graph to show suggested or desired results. The results from the knowledge discovery are always provided as list of knowledge items (e.g., documents) in the prototype and also single documents can be selected to read details, modify or export them in order to support the user’s knowledge discovery process or information search.
The data set which contains articles from various news domains in German and English language has been analyzed by the presented text mining methods. The results have been integrated in the presented MKR structure for knowledge discovery and information visualization purpose. Each of the 305,281 articles has been analyzed for topics (and related subtopics), sentiment on different levels, named entities (with types person, location, organization and miscellaneous) and semantic relationships in RDF triple format.
The results show an average of 9.45 extracted named entities per document. The most assigned topics are “human living” and “will and action”. According to the topic detection analysis results, the corpus contains the lowest amounts of documents which are related to “science” and “food and drink”. A total amount of 3131 semantic relationships have been extracted from the documents by further analysis of the named entities. The average sentiment from the overall analysis is slightly negative with a value of − 0.002. Documents assigned to the topics “religion and spiritual” have the most positive sentiment values in average (0.064), whereas “law and ethics” related documents the most negative sentiment values (− 0.072).
5 Conclusion and future work
MKR has been presented in this research as a knowledge representation method based on integrative text mining results. MKR enables knowledge graphs to visualize multidimensional perspectives on analysis results by transformation operations namely dimensional selection and filtering. Through a dynamic adjustment of the knowledge graphs, further analysis results from other knowledge dimensions are integrated in the visualization by request without any additional analysis or calculation. This is considered advantageous compared to traditional knowledge representation (e.g., the combination of RDF, XML and OWL, text databases or other knowledge base representation types such as frames or rules), and state-of-the-art visualization methods which are focused only on selected analysis dimensions. In this research, a data set of German and English news articles has been analyzed by an implementation which uses the presented MKR structure in order to integrate different text mining methods in the analysis and visualization. Therefore, the methods named entity recognition, topic detection, sentiment analysis and semantic triple extraction have been implemented in the application and used for knowledge graph visualization.
In future work, the MKR framework will be used as a basis for knowledge discovery processes and intelligent selection mechanism for extractive and abstractive text summarization, computer-aided writing and text generation. The authors are currently working on an extension of the prototype towards this direction, which is used for text summarization based on dimensional selection and filtering. In this way, a knowledge-intensive search process is supported which is able to retrieve and summarize relevant information in the knowledge base, already filtered by other dimensions (e.g., an extractive text summarization of all relevant sources related to entity e in topic t above entity-level sentiment value s in a selected time frame between \(t_x\) and \(t_y\)).
- 2.Zenkert, J., Fathi, M.: Multidimensional knowledge representation of text analytics results in knowledge bases. In: Electro Information Technology (EIT), 2016 IEEE International Conference on. IEEE, pp. 0541–0546. (2016)Google Scholar
- 3.Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. pp. 1247–1250. ACM, (2008)Google Scholar
- 4.Fabian, M., Gjergji, K., Gerhard, W., et al.: Yago: A core of semantic knowledge unifying wordnet and wikipedia. In: 16th International World Wide Web Conference, WWW, pp. 697–706. (2007)Google Scholar
- 6.Zhang, D.: Integrative text mining and management in multidimensional text databases. Ph.D. dissertation, University of Illinois at Urbana-Champaign, (2013)Google Scholar
- 7.Lin, C. X., Ding, B., Han, J., Zhu, F., Zhao, B.: Text cube: Computing ir measures for multidimensional text database analysis. In: Data Mining, 2008. ICDM’08. Eighth IEEE International Conference on IEEE, pp. 905–910. (2008)Google Scholar
- 8.Lassila, O., Swick, R. R.: Resource description framework (RDF) model and syntax specification. (1999)Google Scholar
- 9.McGuinness, D.L., Van Harmelen, F., et al.: OWL web ontology language overview. W3C Recomm. 10(10), 2004 (2004)Google Scholar
- 10.Hitzler, P., Krötzsch, M., Rudolph, S., Sure, Y.: Semantic Web: Grundlagen. Springer, Berlin Heidelberg (2007). http://www.springer.com/de/book/9783540339939
- 12.Michalik, P., Stofa, J., Zolotova, I.: Concept definition for big data architecture in the education system. In: Applied Machine Intelligence and Informatics (SAMI), 2014 IEEE 12th International Symposium on IEEE, pp. 331–334. (2014)Google Scholar
- 16.Fasel, D., Meier, A.: Big Data: Grundlagen, Systeme und Nutzungspotenziale. Springer, Fachmedien Wiesbaden (2016). http://www.springer.com/de/book/9783658115883
- 17.Gadatsch, A., Landrock, H.: Zielsetzung von big-data-projekten. In: Big Data für Entscheider. pp. 11–16. Springer, (2017)Google Scholar
- 18.Nandury, S. V., Begum, B. A.: Strategies to handle big data for traffic management in smart cities. In: Advances in Computing, Communications and Informatics (ICACCI), 2016 International Conference on IEEE, pp. 356–364. (2016)Google Scholar
- 19.Bohnacker, U., Dehning, L., Franke, J., Renz, I.: Textual analysis of customer statements for quality control and help desk support. In: Classification, Clustering, and Data Analysis, pp. 437–445. Springer, (2002)Google Scholar
- 20.Abts, D., Mülder, W.: Grundkurs Wirtschaftsinformatik: eine kompakte und praxisorientierte Einführung. Springer, Fachmedien Wiesbaden (2009). http://www.springer.com/de/book/9783658163785
- 21.Hotho, A., Nürnberger, A., Paaß, G.: A brief survey of text mining. InLdv Forum 20(1), 19–62 (2005)Google Scholar
- 23.Wilks, Y.: Information extraction as a core language technology. In: Information Extraction A Multidisciplinary Approach to an Emerging Information Technology, pp. 1–9. (1997)Google Scholar
- 24.Kodratoff, Y.: Knowledge discovery in texts: a definition, and applications. In: Foundations of Intelligent Systems, pp. 16–29. (1999)Google Scholar
- 25.Lin, D., Wu, X.: Phrase clustering for discriminative learning. In: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2-Volume 2. Association for Computational Linguistics, pp. 1030–1038. (2009)Google Scholar
- 26.Balasuriya, D., Ringland, N., Nothman, J., Murphy, T., Curran, J. R.: Named entity recognition in wikipedia. In: Proceedings of the 2009 Workshop on The People’s Web Meets NLP: Collaboratively Constructed Semantic Resources. Association for Computational Linguistics, pp. 10–18. (2009)Google Scholar
- 28.Bikel, D. M., Miller, S., Schwartz, R., Weischedel, R.: Nymble: a high-performance learning name-finder. In: Proceedings of the Fifth Conference on Applied Natural Language Processing. Association for Computational Linguistics, pp. 194–201. (1997)Google Scholar
- 29.Sekine, S., et al.: “Nyu: Description of the japanese ne system used for met-2. In: Proc. Message Understanding Conference, (1998)Google Scholar
- 30.Asahara, M., Matsumoto, Y.: Japanese named entity extraction with redundant morphological analysis. In: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology-Volume 1. Association for Computational Linguistics, pp. 8–15. (2003)Google Scholar
- 31.Borthwick, A., Sterling, J., Agichtein, E., Grishman, R.: Nyu: Description of the mene named entity system as used in muc-7. In: Proceedings of the Seventh Message Understanding Conference MUC-7. Citeseer (1998)Google Scholar
- 32.McCallum, A., Li, W.: Early results for named entity recognition with conditional random fields, feature induction and web-enhanced lexicons. In: Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL 2003-Volume 4. Association for Computational Linguistics, pp. 188–191. (2003)Google Scholar
- 33.Downey, D., Broadhead, M., Etzioni, O.: Locating complex named entities in web text. IJCAI 7, 2733–2739 (2007)Google Scholar
- 34.Palmer, D. D., Day, D. S.: A statistical profile of the named entity task. In: Proceedings of the Fifth Conference on Applied Natural Language Processing. Association for Computational Linguistics, pp. 190–193. (1997)Google Scholar
- 35.Mikheev, A., Moens, M., Grover, C.: Named entity recognition without gazetteers. In: Proceedings of the Ninth Conference on European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics, pp. 1–8. (1999)Google Scholar
- 36.Jiang, J.: Information extraction from text. In: Mining Text Data. pp. 11–41. Springer, (2012)Google Scholar
- 37.Ramshaw, L. A., Marcus, M. P.: Text chunking using transformation-based learning. In: Natural Language Processing Using Very Large Corpora. pp. 157–176. Springer, (1999)Google Scholar
- 41.Hofmann, T.: Probabilistic latent semantic analysis. In: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pp. 289–296. Morgan Kaufmann Publishers Inc., (1999)Google Scholar
- 42.Baeza-Yates, R., Ribeiro-Neto, B., et al.: Modern Information Retrieval, vol. 463. ACM Press, New York (1999)Google Scholar
- 43.Kuhlen, R., Seeger, T., Strauch, D.: Grundlagen der praktischen Information und Dokumentation: Band 1: Handbuch zur Einführung in die Informationswissenschaft und -praxis, Band 2: Glossar. Walter de Gruyter, (2004)Google Scholar
- 45.Uhr, P., Klahold, A., Fathi, M.: Imitation of the human ability of word association. Int. J. Soft Comput. Softw. Eng. (JSCSE) 3(3), 248 (2013)Google Scholar
- 49.Kaur, A., Gupta, V.: A survey on sentiment analysis and opinion mining techniques. J. Emerg. Technol. Web Intell. 5(4), 367–371 (2013)Google Scholar
- 52.Broß, J.: Aspect-oriented sentiment analysis of customer reviews using distant supervision techniques. Ph.D. dissertation, Freie Universität Berlin (2013)Google Scholar
- 54.Uhr, P., Zenkert, J., Fathi, M.: Sentiment analysis in financial markets a framework to utilize the human ability of word association for analyzing stock market news reports. In: Systems, Man and Cybernetics (SMC), 2014 IEEE International Conference on IEEE, pp. 912–917. (2014)Google Scholar
- 55.Akbik, A., Broß, J.: Wanderlust: Extracting semantic relations from natural language text using dependency grammar patterns. In: WWW Workshop (2009)Google Scholar
- 56.Sleator, D. D., Temperley, D.: Parsing English with a link grammar (1995). arXiv:cmp-lg/9508004
- 57.Fayyad, U.M., Wierse, A., Grinstein, G.G.: Information Visualization in Data Mining and Knowledge Discovery. Morgan Kaufmann, Burlington (2002)Google Scholar
- 59.Schiller, A., Teufel, S., Thielen, C.: Guidelines für das tagging deutscher textcorpora mit stts. Universitäten Stuttgart und Tübingen, (1995)Google Scholar
- 60.Marcus, M.P., Marcinkiewicz, M.A., Santorini, B.: Building a large annotated corpus of English: the Penn treebank. Comput. Linguist. 19(2), 313–330 (1993)Google Scholar
- 62.Remus, R., Quasthoff, U., Heyer, G.: Sentiws-a publicly available german-language resource for sentiment analysis. In: LREC (2010)Google Scholar