Text Classification Using Genetic Programming with Implementation of Map Reduce and Scraping

Classification of text documents on online media is a big data problem and requires automation. Research has developed a text classification system with pre-processing using map-reduce and web scraping data collection. This study aims to evaluate text classification performance by combining genetic programming algorithms, map-reduce and web scraping for processing large data in the form of text. Data collection was carried out by observing web-based scraping. Data was collected by reducing 8126 duplicates. Map-reduce has tokenized and stopped-word removal with 28507 terms with 4306 unique terms and 24201 duplication terms. Text classification evaluation shows that a single tree produces better accuracy (0.7072) than a decision tree (0.6874), and the lowest is a multi-tree (0.6726). For the acquisition of genetic programming support values with the multi-tree, the highest average support is 0.3854, followed by the decision tree with 0.3584 and the smallest single tree with 0.3494. In general, the amount of support is not in line with the accuracy value achieved.

Massive amounts of building operational data are collected and stored in modern buildings, which provide rich information for in-depth investigation and assessment of actual building operational performance. However, the current utilization of big building operational data is far from being effective due to the gaps between building engineering and advanced big data analytics. Data mining is a promising technology for extracting previously unknown yet potentially useful insights from big data. This paper aims to explore the potential application of advanced data mining techniques for effective utilization of big building operational data. A case study of mining the operational data of an educational building for performance improvement is presented. Decision tree, clustering analysis, and association rule mining are adopted to analyze the operational data. The results show that useful knowledge can be extracted for identifying typical building operation patterns, detecting operation deficiencies, and spotting energy conservation opportunities. Practical application:The current utilization of big building operational data in the building industry is rather limited due to the lack in experience of using advanced big data analytics. This study presents a data mining-based method for analyzing massive building operational data. The case study results validate the efficiency and effectiveness of the method proposed. It can help building professionals to discover valuable insights into building operation patterns and thereby developing strategies for improving building energy efficiency. The method can be fully realized using the open-source software R, which provides great flexibilities in its integration with building automation systems.

How to Improve Text Summarization and Classification by Mutual Cooperation on an Integrated Framework

Big Data OverviewDriven by the need to generate business value, the enterprise has started to adopt Big Data as a solution, migrating from the classical databases and data stores which lack the flexibility and are not optimized enough [1].The changes in the environment make big data analytics attractive to all types of organizations, while the market conditions make it practical. The combination of simplified models for development, commoditization, a wider palette of data management tools, and low-cost utility computing has effectively lowered the barrier to entry. [2]. The concept addresses large volumes of complex data, rapid growing data sets that may come from different autonomous sources.In recent approaches, Big Data is characterized by principles known as the 4VVolume, Variety, Velocity and Veracity [3]. There are opinions about accepting other principles as Big Data characteristics, such as Value.Each day more businesses realize that Big Data is relevant as the applications generate large volumes of data generated automatically, from different data sources, centralized or autonomous. As traditional databases hit limitations when the need of analyzing this data, dedicated solutions must be considered.Important BigData Solutions:* Apache HBase/Hadoop is based on Google's BigTable distributed storage system, which runs on top of Hadoop as a distributed and scalable big data store. This means that HBase can leverage the distributed processing paradigm of the Hadoop Distributed File System (HDFS) and benefit from Hadoop's MapReduce programming model. It combines the scalability of Hadoop with real-time data access as a key/value store and deep analytic capabilities of Map Reduce [4].HBase allows to query for individual records as well as derive aggregate analytic reports across a massive amount of data. It can host large tables with billions of rows, millions of columns and run across a cluster of commodity hardware. HBase is composed of three types of servers in a master slave type of architecture. Region servers are responsible to serve data for reads and writes. When accessing data, clients communicate with HBase Region Servers directly. Region assignment, DDL (create, delete tables) operations are handled by the HBase Master process.* Apache Cassandra is a distributed database used for the administration and management of large amounts of structured data across multiple servers, while providing highly available service and no single point of failure. It provides features such as continuous availability, linear scale performance, data distribution across multiple data centers and cloud availability zones. Cassandra inherits its data architecture from Google's BigTable and it borrows its distribution mechanisms from Amazon's Dynamo.The nodes in a Cassandra cluster are completely symmetrical, all having identical responsibilities. Cassandra also employs consistent hashing to partition and replicate data. it has the capability of handling large amounts of data and thousands of concurrent users or operations per second across multiple data centers.Cassandra has a hierarchy of caching mechanisms and carefully orchestrated disk I/O which ensures speed and data safety. Write operations are sent first to a persistent commit log (ensuring a durable write), then to a write-back cache called a memTable; when the memTable fills, it is flushed to a sorted string table - SSTable - on disk. A Cassandra cluster is organized as a ring, and it uses a partitioning strategy to distribute data evenly.* Redis represents an in-memory data structure store used as a database, cache and message broker. It supports data structures such as strings, hashes, lists, sets, sorted sets with range queries, bitmaps, hyperlogs and geospatial indexes with radius queries. Redis stores all data in RAM, allowing lightning fast reads and writes. It runs extremely efficiently in memory and handles high-velocity data, needing simple standard servers to deliver millions of operations per second with submillisecond latency. …

The increasing availability of Earth Observation and geographic data implies great opportunities for those capable to efficiently address the problems arising from the management of this huge amount of data. An efficient management of these data means to respond to the paradigm of the 4 V that usually applies to the problem of the Big Data: Volume - the sheer size of the “data at rest”, Velocity - the speed of new data arriving, Variety - the different manifold, and Veracity - trustworthiness and issues of provenance. The problem of Big Data is not only in the geospatial realm of Earth observation data, but in general in all the location-based data which basically are the main contributors to the deluge of big data. In addition to the need of managing (store, search & find when needed) these data efficiently, the problem arises from the analysis of these data. They need to be quickly processed in order to quickly extract the information content, then they must be analysed in conjunction with other data sources in order to express their real value in the construction of new knowledge. These processes are hastened by the advent of an increasing machine-to-machine communication. The automation of the data analysis requires standardized and linked data so that they can be processed by machines without human intervention. The problem with the standardization of geospatial data is solved by simply observing not only the best practices shared at European level, but mainly the regulatory scenario dictated by the INSPIRE Directive . The publication of spatial data as Linked Open Data may then leverage the reuse of common ontologies and vocabularies that allow the connection of geospatial data with other heterogeneous information. This way new scenarios and business opportunities may arise, as in the case of the real estate market that is mentioned in this article. This contribution aims to identify some business opportunities, related to Linked Open Data and arising from the imminent availability of the Sentinel satellite data, with the European program Copernicus, for companies operating in the so-called downstream services of Earth observation.

Natural Language Processing (NLP) is a science that integrates computer knowledge, mathematical knowledge and linguistic knowledge, and text classification and recognition is considered to be an important research field and direction of natural language processing. This paper mainly studies the realization of text classification model through the processing method of text data in natural language processing and the theoretical knowledge and technical means of machine learning. We summarize the existing text classification algorithms, analyze their applicable scenarios, and optimize on the basis of these algorithm models. The paper proposes a Chinese text classification algorithm based on weight preprocessing. Algorithm based on the weight preprocessing link, so that the optimized classifier model can improve the accuracy of the existing text classifier. In this paper, the English Newsgroups corpus is used for experimental verification. The experimental results show that the classification accuracy and accuracy of the improved algorithm are better than those of the traditional text classification algorithm, thereby improving the accuracy of English text classification.

As we are living in the era of big data, huge volumes of a wide variety of complex data-which can be of different levels of veracity-are generated or collected at a high velocity from rich sources of data in various real-life applications. A rich source of these big data sources is the Internet of Things (IoT), which include a collection of sensors, smartphones and other mobile devices, wearable devices, as well as other "things" that are capable to operate within the existing Internet infrastructure. Embedded in these big data are valuable knowledge and useful information. Hence, the research problem of data mining from big IoT data have drawn attention of many researchers as it aims to discover implicit, previously unknown and potentially useful information and knowledge from the data. For instance, frequent pattern mining finds sets of frequently co-occurring items in the IoT domains. Associative classification discovers rules revealing relationships among items within the frequent patterns and their associations with the corresponding class labels. Induction based classification uses decision tree or random forest to learn from old big IoT for classifying or making predictions on new data. Over the past quarter of a century, many serial, distributed, parallel, and MapReduce-based (Hadook-based and Spark-based) big data mining algorithms have been proposed. These algorithms are run in local computers, distributed and parallel environments, clusters, grids, clouds and/or data centers. In this paper, we review some of these algorithms, discuss issues and research prospective in mining classification patterns from these big IoT data in fog. Our case study on a real-life application shows the feasibility on classifying real-life big IoT data over fog for urban analytics.

Predictive analytics has emerged as a powerful tool in the field of financial engineering, enabling organizations to forecast trends, optimize strategies, and mitigate risks. Data mining techniques play a crucial role in extracting meaningful patterns from large volumes of financial datasets, contributing to the development of predictive modeling techniques. The purpose of this paper is to explore the application of various data mining techniques in predictive analytics within the financial sector, with a focus on their effectiveness in risk management, fraud detection, and portfolio optimization. Machine learning algorithms, such as decision trees, support vector machines, and neural networks, are increasingly being employed to model complex financial systems and enhance predictive accuracy. Additionally, techniques like clustering, association rule mining, and time series analysis are used to uncover hidden relationships and temporal patterns in financial datasets. Despite the significant advancements in these techniques, challenges remain in terms of data quality, computational complexity, and interpretability of results. This paper addresses these challenges and provides a comprehensive review of the most widely used data mining methods in financial engineering. Furthermore, it discusses the potential for future advancements in data mining algorithms and their integration with other emerging technologies like artificial intelligence and big data analytics. The findings indicate that while data mining offers significant potential in financial analytics, careful consideration must be given to the selection of appropriate techniques and the proper handling of data to ensure reliable predictions. Ultimately, this paper aims to contribute to the ongoing development of robust predictive modeling techniques in financial engineering by emphasizing the importance of data mining as an indispensable tool.

<p>Symbolic regression (SR) is a function identification process, the task of which is to identify and express the relationship between the input and output variables in mathematical models. SR is named to emphasise its ability to find the structure and coefficients of the model simultaneously. Genetic Programming (GP) is an attractive and powerful technique for SR, since it does not require any predefined model and has a flexible representation. However, GP based SR generally has a poor generalisation ability which degrades its reliability and hampers its applications to science and real-world modeling. Therefore, this thesis aims to develop new GP approaches to SR that evolve/learn models exhibiting good generalisation ability. This thesis develops a novel feature selection method in GP for high-dimensional SR. Feature selection can potentially contribute not only to improving the efficiency of learning algorithms but also to enhancing the generalisation ability. However, feature selection is seldom considered in GP for high-dimensional SR. The proposed new feature selection method utilises GP’s built-in feature selection ability and relies on permutation to detect the truly relevant features and discard irrelevant/noisy features. The results confirm the superiority of the proposed method over the other examined feature selection methods including random forests and decision trees on identifying the truly relevant features. Further analysis indicates that the models evolved by GP with the proposed feature selection method are more likely to contain only the truly relevant features and have better interpretability. To address the overfitting issue of GP when learning from a relatively small number of instances, this thesis proposes a new GP approach by incorporating structural risk minimisation (SRM), which is a framework to estimate the generalisation performance of models, into GP. The effectiveness of SRM highly depends on the accuracy of the Vapnik-Chervonenkis (VC) dimension measuring model complexity. This thesis significantly extends an experimental method (instead of theoretical estimation) to measure the VC-dimension of a mixture of linear and nonlinear regression models in GP for the first time. The experimental method has been conducted using uniform and non-uniform settings and provides reliable VC-dimension values. The results show that our methods have an impressively better generalisation gain and evolve more compact model, which have a much smaller behavioural difference from the target models than standard GP and GP with bootstrap, The proposed method using the optimised non-uniform setting further improves the one using the uniform setting. This thesis employs geometric semantic GP (GSGP) to tackle the unsatisfied generalisation performance of GP for SR when no overfitting occurs. It proposes three new angle-awareness driven geometric semantic operators (GSO) including selection, crossover and mutation to further explore the geometry of the semantic space to gain a greater generalisation improvement in GP for SR. The angle-awareness brings new geometric properties to these geometric operators, which are expected to provide a greater leverage for approximating the target semantics in each operation, and more importantly, to be resistant to overfitting. The results show that compared with two kinds of state-of-the-art GSOs, the proposed new GSOs not only drive the evolutionary process fitting the target semantics more efficiently but also significantly improve the generalisation performance. A further comparison on the evolved models shows that the new method generally produces simpler models with a much smaller size and containing important building blocks of the target models.</p>

With the rapid development of information technology, the application of VR to English language teaching has gradually become an emerging trend. As the driving force of English learning, the establishment of ESL vocabulary corpus is of great significance for making great progress in teaching in colleges and universities. By analyzing the characteristics of VR technology, the study establishes a data-driven teaching platform for ESL vocabulary corpus in colleges and universities based on this technology. Then, based on the improved graph neural network, the text classification of the ESL vocabulary corpus was carried out to achieve the integration of ESL vocabulary corpus resources. The results show that the improved graph neural network vocabulary text classification model converges at 145 iterations, and the convergence speed is improved by up to 100 generations; Among different datasets, the recognition accuracy of the SADE-GNN model on the MR, R8, SST1, and SUBJ datasets is 90%, 99%, 63%, and 96%, respectively. In the recognition and classification of ESL vocabulary corpora in universities, the accuracy of this model is stable at around 95%, with a maximum value of 97%. In practical teaching applications, students' English listening, reading, writing, and speaking scores have all increased to varying degrees, with the top 50% of students achieving 95 or above in both reading and speaking. The above results indicate that the teaching platform under the research model has high accuracy in text classification, can significantly improve the effectiveness of English teaching, providing new reference ideas for the construction of ESL vocabulary corpus and teaching method reform in universities.

Text classification which is an integral part of text mining has caught much attention in various industries and fields recently. The ability is in assigning text documents to one or more pre-defined categories based on content similarity. While most of application of text classification focuses on document level, question classification works at much granular level such as sentence and phrase. There have been numerous studies on question classification in accordance to Bloom taxonomy in assessments to measure cognitive level of learners in higher learning institutions. But it has not been effective yet to resolve overlapping issue of Bloom taxonomy verb keywords being assigned to more than one category of Bloom taxonomy. The presence of this poses a problem in respect of classifying a particular question into a right category of Bloom taxonomy. And feature extraction plays an important role in improving the accuracy of classifier such as Support Vector Machine in question classification. Much of the past related research work focus on feature extraction methods such as bag of word (BOW) and syntactic analysis to classify questions and to address the issue, an improvement in feature extraction is needed. In view of this, this study proposes an integrated approach in feature extraction involving semantic aspect in classifying questions in accordance to Bloom taxonomy. Support Vector Machine classifier is used as it is well known for its high accuracy in text classification. With all this in place, an improved accuracy in classifying questions in accordance to Bloom taxonomy can be expected.

Text classification attempts to assign written texts to specific group types that share the same linguistic features. One class of features that have been widely employed for a wide range of classification tasks is lexical features. This study explores the impact of stemming on text classification using lexical features. To explore, this study is based on a corpus of thirty texts written by six authors with topics that focus on politics, history, science, prose, sport, and food. These texts are stemmed using a light stemming algorithm. In order to classify these texts according to the topic by means of lexical features, linear hierarchical clustering and non-linear clustering (SOM) is carried out on the stemmed and unstemmed texts. Although both clustering methods are able to classify texts by topic with two models produce accurate and stable results, the results suggest that the impact of a light stemming on the accuracy of text classification by topic is ineffectual. The accuracy is neither increased nor decreased on the stemmed texts, whereby the stemming algorithm helped reducing the dimensionality of feature vector space model.

The Kampus Merdeka program, launched by the Indonesian Ministry of Education, Culture, Research, and Technology in 2020, aims to enhance students' skills through hands-on work experience. Considering the rising significance of social media, particularly Twitter, in gauging public opinion, this research focuses on analyzing the sentiment towards the Kampus Merdeka program. The primary objective is to classify the sentiments expressed in tweets related to the program and compare two feature extraction techniques—TF-IDF and FastText—to identify the best approach for transforming text data into numerical vectors. The sentiment classification model was built using the Support Vector Machine (SVM) algorithm, a machine learning technique known for its accuracy in text classification. A total of 16,730 tweets were collected and analyzed, yielding an accuracy of 73% for FastText and 72% for TF-IDF. Results show that FastText is more effective in capturing semantic relationships, leading to higher accuracy in sentiment classification. Findings indicate that the public sentiment towards the Kampus Merdeka program is predominantly positive (60.7%), with negative and neutral sentiments at 33.5% and 5.8%, respectively. The success of the FastText method underscores the importance of advanced feature extraction techniques in text classification. The novelty of this research lies in its use of FastText for educational policy evaluation, providing a new perspective on using sentiment analysis to assess public perception of educational programs.

Graph Convolutional Networks (GCNs) have received considerable attention in the field of artificial machine intelligence (AMI) and natural language processing research because they can build more sophisticated accompanying graph structures than traditional neural networks for feature engineering. Graph is used as feature in neural network because it is easy to find relations among nodes. In text classification applications, a GCN can create complex and rich relation-based adjacent matrix graphs as features to be trained. The existing methods, on the other hand, only generated adjacent matrix graphs in GCN at the word-document and word-word levels as features. In this paper, we propose a document-relational GCN to achieve superior accuracy in text classification by adding cumulative term frequency-inverse document frequency (TF-IDF) document-document relations as features. The performance of the proposed method is evaluated using five popular benchmark databases. In addition, different hidden nodes and proportions of document-document features are tested to achieve an advantageous outcome.

It is already true that Big Data has drawn huge attention from researchers in information sciences, policy and decision makers in governments and enterprises. A large number of fields and sectors, ranging from economic and business activities to public administration, from national security to scientific researches in many areas, involve with Big Data problems. This talk is aimed to demonstrate a close-up view about Big Data, including Big Data applications, Big Data opportunities and challenges, as well as the state-of-the-art techniques and technologies that we currently adopt to deal with the Big Data problems. The second part is to discuss the deep learning role in Big Data. In recent years, deep learning caves out a research wave in machine learning. With outstanding performance, more and more applications of deep learning in pattern recognition, image recognition, speech recognition, and video processing have been developed. Restricted Boltzmann machine (RBM) plays an important role in current deep learning techniques, as most of existing deep networks are based on or related to it. This talk will also discuss how the big data relates with the deep learning.