IJIEEB Vol. 8, No. 4, Jul. 2016
Cover page and Table of Contents: PDF (size: 229KB)
Graphs have become increasingly important in modeling structures with broad applications like Chemical informatics, Bioinformatics, Web page retrieval and World Wide Web. Frequent graph pattern mining plays an important role in many data mining tasks to find interesting patterns from graph databases. Among different graph patterns, frequent substructures are the very basic patterns that can be discovered in a collection of graphs. We extended the problem of mining frequent subgraph patterns to the problem of mining sequential patterns in a graph database. In this paper, we introduce the concept of Sequential Graph-Pattern Mining and proposed two novel algorithms SFG(Sequential Frequent Graph Pattern Mining) and TCSFG(Top-k Closed Sequential Frequent Graph Pattern Mining). SFG generates all the frequent sequences from the graph database, whereas TCSFG generates top-k frequent closed sequences. We have applied these algorithms on synthetic graph database and generated top-k frequent graph sequences.[...] Read more.
The government of Saudi Arabia is in the phase of transformation. Business process reengineering (BPR) can play a vital role in assessing this conversion. BPR methodologies provide ways to optimize the use of resources while maintaining high-quality services. The aim of this paper is to investigate the introduction of BPR in Saudi Arabia public sector. A framework is proposed to transform change using a knowledge based. The proposed solution is validated through survey. The results of the survey show that Saudi Governmental Agencies acquire the power to implement the BPR successfully especially if it is implemented with knowledge management and the BPR movement started at small scale.[...] Read more.
Keyword extraction approaches based on directed graph representation of text mostly use word positions in the sentences. A preceding word points to a succeeding word or vice versa in a window of N consecutive words in the text. The accuracy of this approach is dependent on the number of active voice and passive voice sentences in the given text. Edge direction can only be applied by considering the entire text as a single unit leaving no importance for the sentences in the document. Otherwise words at the initial or ending positions in each sentence will get less connections/recommendations. In this paper we propose a directed graph representation technique (Thematic text graph) in which weighted edges are drawn between the words based on the theme of the document. Keyword weights are identified from the Thematic text graph using an existing centrality measure and the resulting weights are used for computing the importance of sentences in the document. Experiments conducted on the benchmark data sets SemEval-2010 and DUC 2002 data sets shown that the proposed keyword weighting model is effective and facilitates an improvement in the quality of system generated extractive summaries.[...] Read more.
This paper analyzes the performance of hybrid gigabit passive optical network (GPON) and wireless communication (FSO) system using EDFA and EYDWA as pre-amplification configuration to compensate the losses due to the fiber cable and the free space channel for 2.5 Gb/s of data. The performance for both amplifiers has been compared on the basis of distance, FSO range and number of users, however the results of simulation show enhancement offered by EYDWA as compared as EDFA amplifier. This amplifier was able to reach transmission distance over 245 Km optical fiber and 1Km range FSO with best BER value around 10-9 and good eye diagram. Whereas, the fiber distance has been limited to 64 Km by using EDFA amplifier[...] Read more.
The massive growth of web consists of huge number of redundant information in related to some context. Due to which the need of information through a search provide high number of duplicate results which makes user to navigate number of sites to find the needed information. Users often miss their search pages when they browse the large and complex navigation of the web. Web customization is based on the use of the web logs can take advantage of the knowledge necessary to study the content and the structure of the internet to support. Searching information can be improvised in support of the implicit information generated by the web server in form logs for various web documents visited by users. This paper proposes a web search customization approach (WSCA) using redundant web usage data association and hierarchal clustering. Association generates a multilevel association for redundant data in the web navigation sites and clustering generates a cluster of frequent access patterns. The approach will improvise the real-time customization and also cost requirement for generating customized resources. The experiment evaluation shows an improvisation in precision rate in relevant to different queries against existing clustering approach.[...] Read more.
Design of the software system plays a crucial role in the effective and efficient maintenance of the software system. In the absence of original design structure it might be required to re-identify the design by using the source code of the concerned software. Software clustering is one of the powerful techniques which could be used to cluster large software systems into smaller manageable subsystems containing modules of similar features. This paper examines the use of novel evolutionary imperialist competitive algorithms, genetic algorithms and their combinations for software clustering. Apparently, recursive application of these algorithms result in the best performance in terms of quality of clusters, number of epochs required for convergence and standard deviation obtained by repeated application of these algorithms.[...] Read more.
The advent of Web 2.0 has led to an increase in the amount of sentimental content available in the Web. Such content is often found in social media web sites in the form of movie or product reviews, user comments, testimonials, messages in discussion forums etc. Timely discovery of the sentimental or opinionated web content has a number of advantages, the most important of all being monetization. Understanding of the sentiments of human masses towards different entities and products enables better services for contextual advertisements, recommendation systems and analysis of market trends. The focus of our project is sentiment focussed web crawling framework to facilitate the quick discovery of sentimental contents of movie reviews and hotel reviews and analysis of the same. We use statistical methods to capture elements of subjective style and the sentence polarity. The paper elaborately discusses two supervised machine learning algorithms: K-Nearest Neighbour(K-NN) and Naïve Bayes‘ and compares their overall accuracy, precisions as well as recall values. It was seen that in case of movie reviews Naïve Bayes‘ gave far better results than K-NN but for hotel reviews these algorithms gave lesser, almost same accuracies.[...] Read more.
The problem of searching a digital image in a very huge database is called Content Based Image Retrieval (CBIR). Shape is a significant cue for describing objects. In this paper, we have developed a shape feature extraction of MRI brain tumor image retrieval. We used T1 weighted image of MRI brain tumor images. There are two modules: feature extraction process and classification. First, the shape features are extracted using techniques like Scale invariant feature transform (SIFT), Harris corner detection and Zernike Moments. Second, the supervised learning algorithms like Deep neural network (DNN) and Extreme learning machine (ELM) are used to classify the brain tumor images. Experiments are performed using 1000 brain tumor images. In the performance evaluation, sensitivity, specificity, accuracy, error rate and f-measure are five measures are used. The Experiment result shows that highest average accuracy has got at Zernike Moments– 99%. So, Zernike Moments are better than SIFT and Harris corner detection techniques. The average time taken for DNN- 0.0901 sec, ELM- 0.0218 sec. So, ELM classifier is better than DNN. It increases the retrieval time and improves the retrieval accuracy significantly.[...] Read more.