Aspect categorisation and its utmost importance in the eld of Aspectbased Sentiment Analysis (ABSA) has encouraged researchers to improve topic model performance for modelling the aspects into categories. In general, a majority of its current methods implement parametric models requiring a pre-determined number of topics beforehand. However, this is not e ciently undertaken with unannotated text data as they lack any class label. Therefore, the current work presented a novel non-parametric model drawing a number of topics based on the semantic association present between opinion-targets (i.e., aspects) and their respective expressed sentiments. The model incorporated the Semantic Association Rules (SAR) into the Hierarchical Dirichlet Proce

Convolutional Neural Networks (CNN) have high performance in the fields of object recognition and classification. The strength of CNNs comes from the fact that they are able to extract information from raw-pixel content and learn features automatically. Feature extraction and classification algorithms can be either hand-crafted or Deep Learning (DL) based. DL detection approaches can be either two stages (region proposal approaches) detector or a single stage (non-region proposal approach) detector. Region proposal-based techniques include R-CNN, Fast RCNN, and Faster RCNN. Non-region proposal-based techniques include Single Shot Detector (SSD) and You Only Look Once (YOLO). We are going to compare the speed and accuracy of Faster RCNN,

􀀨􀀅􀀆􀀔􀀜􀀄􀀂􀀆􀀈􀀓􀀌􀀩􀀏􀀆􀀉􀀅􀀆􀀉􀀅􀀉􀀚􀀝􀀔􀀄􀀗􀀉􀀚􀀆􀀂􀀓􀀚􀀁􀀔􀀄􀀓􀀅􀀆􀀄􀀂􀀆􀀔􀀓􀀆􀀃􀀂􀀔􀀄􀀟􀀉􀀔􀀃􀀆􀀔􀀜􀀃􀀆􀀛􀀃􀀜􀀄􀀗􀀚􀀃􀀆􀀗􀀌􀀄􀀔􀀄􀀗􀀉􀀚􀀆􀀂􀀘􀀃􀀃􀀊􀀂􀀆􀀓􀀖􀀆􀀓􀀛􀀃􀀌􀀔􀀁􀀌􀀅􀀄􀀅􀀕􀀢􀀆􀀪􀀜􀀃􀀆􀀄􀀅􀀛􀀃􀀂􀀔􀀄􀀕􀀉􀀔􀀄􀀓􀀅􀀂􀀆 􀀉􀀌􀀃􀀆􀀙􀀉􀀂􀀃􀀊􀀆􀀓􀀅􀀆􀀉􀀁􀀔􀀓􀀟􀀓􀀙􀀄􀀚􀀃􀀆􀀚􀀉􀀔􀀃􀀌􀀉􀀚􀀆􀀂􀀘􀀉􀀗􀀃􀀆􀀟􀀄􀀊􀀂􀀔􀀆􀀔􀀜􀀃􀀆􀀗􀀃􀀅􀀔􀀃􀀌􀀚􀀄􀀅􀀃􀀂􀀆􀀓􀀖􀀆􀀔􀀜􀀃􀀆􀀙􀀉􀀂􀀃􀀆

Visual analytics becomes an important approach for discovering patterns in big data. As visualization struggles from high dimensionality of data, issues like concept hierarchy on each dimension add more difficulty and make visualization a prohibitive task. Data cube offers multi-perspective aggregated views of large data sets and has important applications in business and many other areas. It has high dimensionality, concept hierarchy, vast number of cells, and comes with special exploration operations such as roll-up, drill-down, slicing and dicing. All these issues make data cubes very difficult to visually explore. Most existing approaches visualize a data cube in 2D space and require preprocessing steps. In this paper, we propose a visu

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

Extended utilization of adaptive algorithms, Evaluative Algorithms (EAs), to address these issues offers a way to handle massive multi-objective optimization, even if the algorithmic method for handling combinations of objectives (CO) has been accessible for quite some time. Combining the idea of superiority with the Hypervolume (HV) tag approach, the GSA algorithm utilizes various target effects to explain several algorithms depending on the Hypervolume (HV) spacing. The Multi-objective Gravitational Search Algorithm with Hypervolume (MOGSA/HV). Since rapid convergence could result from GSA foundation work, Hypervolume rewrites the multi-objective problem (MOP) as a sequence of Tchebycheff solutions, improving it. Since the one in charge h