International Journal of Business Intelligence and Data Mining

Sivakumaran, A.R.; Marikkannu, P.

doi: 10.1504/IJBIDM.2018.088419pmid: N/A

Browsing information through web has become part and parcel of life. There is hardly any user who does not browse through web. Generally, any user when in search for content only looks at the top ten pages that get displayed in the web search. Therefore, it has been proposed that the information such as the link that is created between both visited and unvisited web pages along with the path that is chosen in the search query needs a novel technique to give the best performance. The operation feature matrix (OFM) is used as one of the novel functionalities that have been used for extracting the data from the web. The automatically identified user profile is the graph-based that is called as the modified page outlook (MPO) graph was proposed that involves a link between the visited and the unvisited web pages.

Thenmozhi, K.; Babu, M. Rajesh

doi: 10.1504/IJBIDM.2018.088422pmid: N/A

Early diagnosis of cutaneous melanoma is very hard for experienced dermatologists. Even though a lot of advanced imaging techniques and clinical diagnostic algorithms such as dermoscopy and the ABCD rule of dermoscopy respectively are available. The accuracy is an issue of distress (estimated to be about 75%-85%) especially with oblique pigmented lesions. An effective diagnosis can be achieved by reducing the viewer variability's found in dermatologists' examinations. In order to improve some of existing methods and budding new techniques to ease accurate, fast and reliable diagnosis of cutaneous melanoma. In this paper, different types diagnostic system of melanoma namely, pre-processing feature extraction, feature selection and classification is explained. The results of feature selection were optimised from advanced classes of classification techniques; namely, two weighted k-nearest neighbour (k-NN) classifiers (k = 1, 30), a decision tree (DT), and the random forest (RF) algorithm are employed.

Kannayeram, G.; Manoharan, P.S.; Iruthayarajan, M. Willjuice; Sivakumar, T.

doi: 10.1504/IJBIDM.2018.088425pmid: N/A

In this paper, modified non-dominated sorting genetic algorithm-II (MNSGA-II)-based optimal damping control of unified power flow controller (UPFC) has been designed to enhance the damping of low frequency oscillations in power systems. The robust damping of UPFC controller design is formulated as a multi-objective optimisation problem, thereby minimising the integral squared error (ISE) of speed deviation and input control signal (u) under a wide range of operating conditions. The effectiveness of the proposed controller is confirmed through nonlinear time domain simulation and Eigen value analysis. The results are compared with NSGA-II and conventional method. Simulation result reveals that the obtained Pareto-front using MNSGA-II-based UPFC controllers are better and uniformly distributed due to the controlled elitism and dynamic crowding distance concepts. The proposed modulation index of shunt inverter (mE)-based damping controller is superior to the other damping controllers under different loading conditions and improves the stability of system.

Kalpana, N.; Balamurugan, S. Appavu Alias

doi: 10.1504/IJBIDM.2018.088427pmid: N/A

Presently, sight and sound information becomes available quickly because of the propelled interactive media catching gadgets such as computerised video recorder, portable camera, etc. As ordinary inquiry by-content recovery does not fulfil clients' needs in finding the desired recordings viably, content-based video recovery stands out as the most sensible answer to enhance the recovery quality. Moreover, video recovery utilising inquiry by picture is not effective in partnership with the recordings to the client's advantage. In this manuscript, we intend a creative strategy to accomplish the high calibre substance-based video recovery by finding the transient examples. On premise of the found lobbyist designs, a productive indexing procedure and a powerful grouping coordinating strategy are incorporated to diminish the calculation cost and to raise the recovery precision. Trial result uncover that our methodology is extremely encouraging in upgrading content-based video recovery with regard to proficiency and adequacy in NPTEL.

Bhuvaneswari, A.; Karpagam, G.R.

doi: 10.1504/IJBIDM.2018.088421pmid: N/A

The process of service discovery is the most important task in web services. But this service discovery process may degrade network performance due to the mobile environment. To overcome these issues, a new approach called 'semantic mobile web services (SMWS)' is proposed. This proposed semantic mobile web services is used for a better discovery process even in the high mobile environment. By using the query request (QRY REQ), response (RSP) packets, user can identify the location of the mobile node as well as discover the web services with the minimum utilisation of bandwidth resources. During the service discovery process, a service registrar is included between service requester and service provider to reduce overhead. The process of matchmaking produces the exact match responses for the respective requestor queries. This helps to increase the quality of performance and network efficiency. Simulation has analysed the performance of the proposed semantic mobile web services.

Rani, K. Sasi Kala; Rasi, D.; Deepa, S.N.

doi: 10.1504/IJBIDM.2018.088424pmid: N/A

This paper focuses on the visual-based colour image segmentation with a global biotic cross pollination algorithm (GBCPA). The global biotic cross pollination algorithm segments the structurally challenging objects based on the colour, edge, entropy and edge information in the CIE L*a*b* colour space. The L*a*b* colour space is a colour-opponent space considered to approximate human vision. L* denotes the luminosity or brightness layer, chromaticity layer a* indicates colour falls along red-green axis and chromaticity layer b* indicates the blue-yellow axis. The FPO algorithm considering the global biotic cross pollination is proposed to improve the quality of the solution and computational speed. GBCPA is first introduced to find the locality of the solution. The performance of GBCPA is tested on a standard Berkeley segmentation dataset with 300 images. The dataset is illustrated under different evaluating strategies.

Daoud, Daoud M.

doi: 10.1504/IJBIDM.2018.088423pmid: N/A

In Twitter and in other social media channels, detecting events is very important and has many applications. However, this task is very challenging because of the huge number of tweets that are posted every minute and the massive scale of the spamming activities. In this paper, we present an innovative approach for detecting events using data posted to Twitter. The proposed approach is based on the concept of user's attention by quantitatively modelling the diversity of hashtags using Shannon's index. Our method records the diversity values on an hourly basis time-series. Using statistical techniques, the method locates the intervals having diversity values that fall outside the range of forecasted ones (normal state). We also present the labelling and ranking techniques that are implemented in this research. Experimental results on a dataset consisting of 15 million Arabic tweets show that our proposed approach can effectively detect real-world events in Twitter.

Reshmy, A.K.; Paulraj, D.

doi: 10.1504/IJBIDM.2018.088430pmid: N/A

Hadoop Distributed File System, Talend, MapReduce (MR), YARN and Cloudera model have gotten to be prevalent advancements for expansive scale information association and investigation. In our work, we distinguish the prerequisites of the covered information association and propose an augmentation to the present programming model, called Comprehensive Hadoop Distributed File System along with MapReduce (C-HDFS-MR), to address them. The expanded interface is exhibited as application programming interface and actualised with regards to image processing application space. In our work, we show viability of C-HDFS-MR through contextual investigations of picture handling capacities along with the outcomes. Despite the fact that C-HDFS-MR has minimal overhead in information stockpiling and I/O operations, it enormously upgrades the framework execution and improves the application advancement process. Our proposed framework, C-HDFS-MR, works in the absence of progressions for the current prototypes, and is used by numerous applications to prerequisite of covered information.