Статьи журнала - International Journal of Intelligent Systems and Applications
Все статьи: 1159
Статья научная
Origin–destination (OD) matrix estimation largely depends on the quality and quantity of the input data, which in turn depends on the number and sites of count locations. In this paper, we focus on the network count location problem (NCLP), namely the identification of informative links in the road network. Also we employ opposition based colonial competitive algorithm (OCCA), which originally inspired by imperialistic competition, to determine the desirable number and locations of counting points satisfying location rules. The model and algorithm is illustrated with numerical examples.
Бесплатно
Статья научная
Gestures are natural means of communication between humans, and therefore their application would benefit to many fields where usage of typical input devices, such as keyboards or joysticks is cumbersome or unpractical (e.g., in noisy environment). Recently, together with emergence of new cameras that allow obtaining not only colour images of observed scene, but also offer the software developer rich information on the number of seen humans and, what is most interesting, 3D positions of their body parts, practical applications using body gestures have become more popular. Such information is presented in a form of skeletal data. In this paper, an approach to gesture recognition based on skeletal data using nearest neighbour classifier with dynamic time warping is presented. Since similar approaches are widely used in the literature, a few practical improvements that led to better recognition results are proposed. The approach is extensively evaluated on three publicly available gesture datasets and compared with state-of-the-art classifiers. For some gesture datasets, the proposed approach outperformed its competitors in terms of recognition rate and time of recognition.
Бесплатно
Статья научная
Energy saving and improve the life time of the sensor node is main focus in the recent years for the researchers hence one of the application domain (Street light monitoring and controlling) of sensor required attention towards this direction. For contributing in this domain we have proposed a scheme for Street light controlling using distributed topology control (TC). The optimize version of A3 protocol reduces the number of messages send/received by the sensors which ultimately leads to the reduction of energy requirement. Experiments are carried on street light scenario for different no. of nodes by maintaining communication using Zigbee protocol. The performance of our extension is evaluated using, no. of messages send/receive & energy consumed during topology building and our approach is having good results as compared to the approach used for this type of network.
Бесплатно
An Automated Real-Time System for Opinion Mining using a Hybrid Approach
Статья научная
In this paper, a novel idea is being presented to perform Opinion Mining in a very simple and efficient manner with the help of the One-Level-Tree (OLT) based approach. To recognize opinions specific for features in customer reviews having a variety of features commingled with diverse emotions. Unlike some previous ventures entirely using one-time structured or filtered data but this is solely based on unstructured data obtained in real-time from Twitter. The hybrid approach utilizes the associations defined in Dependency Parsing Grammar and fully employs Double Propagation to extract new features and related new opinions within the review. The Dictionary based approach is used to expand the Opinion Lexicon. Within the dependency parsing relations a new relation is being proposed to more effectively catch the associations between opinions and features. The three new methods are being proposed, termed as Double Positive Double Negative (DPDN), Catch-Phrase Method (CPM) & Negation Check (NC), for performing criteria specific evaluations. The OLT approach conveniently displays the relationship between the features and their opinions in an elementary fashion in the form of a graph. The proposed system achieves splendid accuracy across all domains and also performs better than the state-of-the-art systems.
Бесплатно
An Automatic Number Plate Recognition System under Image Processing
Статья научная
Automatic Number Plate Recognition system is an application of computer vision and image processing technology that takes photograph of vehicles as input image and by extracting their number plate from whole vehicle image , it display the number plate information into text. Mainly the ANPR system consists of 4 phases: - Acquisition of Vehicle Image and Pre-Processing, Extraction of Number Plate Area, Character Segmentation and Character Recognition. The overall accuracy and efficiency of whole ANPR system depends on number plate extraction phase as character segmentation and character recognition phases are also depend on the output of this phase. Further the accuracy of Number Plate Extraction phase depends on the quality of captured vehicle image. Higher be the quality of captured input vehicle image more will be the chances of proper extraction of vehicle number plate area. The existing methods of ANPR works well for dark and bright/light categories image but it does not work well for Low Contrast, Blurred and Noisy images and the detection of exact number plate area by using the existing ANPR approach is not successful even after applying existing filtering and enhancement technique for these types of images. Due to wrong extraction of number plate area, the character segmentation and character recognition are also not successful in this case by using the existing method. To overcome these drawbacks I proposed an efficient approach for ANPR in which the input vehicle image is pre-processed firstly by iterative bilateral filtering , adaptive histogram equalization and number plate is extracted from pre-processed vehicle image using morphological operations, image subtraction, image binarization/thresholding, sobel vertical edge detection and by boundary box analysis. Sometimes the extracted plate area also contains noise, bolts, frames etc. So the extracted plate area is enhanced by using morphological operations to improve the quality of extracted plate so that the segmentation phase gives more successful output. The character segmentation is done by connected component analysis and boundary box analysis and finally in the last character recognition phase, the characters are recognized by matching with the template database using correlation and output results are displayed. This approach works well for low contrast, blurred, noisy as well as for dark and light/bright category images. The comparison is done between the ANPR with Adaptive Histogram Equalization and Iterative Bilateral Filtering that is the proposed approach and the existing ANPR approach using metrics: MSE, PSNR and Success rate.
Бесплатно
An Efficient Algorithm for Mining Weighted Frequent Itemsets Using Adaptive Weights
Статья научная
Weighted frequent itemset mining is more practical than traditional frequent itemset mining, because it can consider different semantic significance (weight) of items. Many models and algorithms for mining weighted frequent itemsets have been proposed. These models assume that each item has a fixed weight. But in real world scenarios, the weight (price or significance) of the items may vary with time. Therefore, reflecting these changes in item weight is necessary in several mining applications, such as retail market data analysis and web click stream analysis. Recently, Chowdhury F. A. et al. have introduced a novel concept of adaptive weight for each item and propose an algorithm AWFPM (Adaptive Weighted Frequent Pattern Mining). AWFPM can handle the situation where the weight (price or significance) of an item may vary with time. In this paper, we present an improved algorithm named AWFIMiner. Experimental computations show that our AWFIMiner is more efficient and scalable for mining weighted frequent itemsets using adaptive weights. Moreover, because it only requires one single database scan, the AWFIMiner is applicable for mining these itemsets on data streams.
Бесплатно
Статья научная
In recent years, the mining research over data stream has been prominent as they can be applied in many alternative areas in the real worlds. In [20], a framework for mining frequent itemsets over a data stream is proposed by the use of weighted slide window model. Two algorithms of single pass (WSW) and the WSW-Imp (improving one) using weighted sliding model were proposed in there to solve the data stream problems. The disadvantage of these algorithms is that they have to seek all data stream many times and generate a large set of candidates. In this paper, we have proposed a process of mining frequent itemsets with weights over a data stream. Based on the downward closure property and FP-Growth method [8,9] an alternative algorithm called WSWFP-stream has been proposed. This algorithm is proved working more efficiently regarding to computing time and memory aspects.
Бесплатно
An Efficient Method of Steganography using Matrix Approach
Статья научная
A large number of the world business is going on using “INTERNET” and the data over the internet which is vulnerable for attacks from the hackers. Thus, uses of highly efficient methods are required for sensitive data transmission over the internet to ensure data security. One of the solutions to data security is to use an efficient method of steganography. The goal of steganography is to hide messages inside other ‘harmless’ messages in a way that does not allow any enemy to even detect that there is a second message present. Steganography can be used with a large number of file formats most commonly used in the digital world of today. The different file formats popularly used are .bmp, .gif, .txt etc. Thus the techniques of steganography are going to play a very important part in the future of data security and privacy on open systems such as the Internet. This paper presents an efficient method for hiding data into an image and send to the destination in a safe manner. This technique does not need any key for embedding and extracting data. Also, it allows hiding four bits in a block of size 5×5 with minimal distortion. The proposed algorithm ensures security and safety of the hidden information. The experimental results presented in this paper show the efficacy of the proposed method.
Бесплатно
Статья научная
Automated, i.e. machine vision based fabric defect inspection systems have been drawing plenty of attention of the researchers in order to replace manual inspection. Two difficult problems are mainly posed by automated fabric defect inspection systems. They are defect detection and defect classification. Counterpropagation neural network (CPN) is a robust classifier and very promising for defect classification. In general, works reported to date have claimed varying level of successes in detection and classification of different types of defects through CPN; but in particular, no claimed has been made for successful application of CPN for fabric defects detection and classification. In those published works, no investigation has been reported regarding to the variation of major performance parameters of NN based classifiers such as learning time and classification accuracy based on network topology and training parameters. As a result, application engineer has little or no guidance to take design decisions for reaching to optimum structure of NN based defect classifiers in general and CPN based in particular. Our work focuses on empirical investigation of interrelationship between design parameters and performance of CPN based classifier for fabric defect classification. It is believed that such work will be laying the ground to empower application engineers to decide about optimum values of design parameters for realizing most appropriate CPN based classifier.
Бесплатно
Статья научная
This research paper propose experimental support to secure Round Trip Engineering and use of security performance flexibility trusted operating systems for the designing of secure web applications. In this research paper, for security concern, we suggest use of trusted operating systems as a platform to run these web applications. In this regard, a number of trusted operating systems like Argus, Trusted Solaris, and Virtual Vault have been developed by various companies to handle the increasing need of security. For improving the performance of same web applications, we observe that all security checks in a Trusted Operating System are not necessary. As per our suggestion, various unnecessary security checks can be skipped by administrator, so that system performance of these web applications can improve. These unnecessary security checks, system calls and operations can be easily identified at the time of requirement elicitation and Requirement Engineering. For example, as we know, the popular web servers deal with public information. In this web application, the need for security checks during reads from disk seems like a waste of CPU cycles. On the other hand the real security need for servers seems to be of the write accesses. This research paper aims to support the efficiency of object-oriented class-based programming and object oriented modeling in secure software development.
Бесплатно
An Enhanced Adaptive k-Nearest Neighbor Classifier Using Simulated Annealing
Статья научная
The k-Nearest Neighbor classifier is a non-complex and widely applied data classification algorithm which does well in real-world applications. The overall classification accuracy of the k-Nearest Neighbor algorithm largely depends on the choice of the number of nearest neighbors(k). The use of a constant k value does not always yield the best solutions especially for real-world datasets with an irregular class and density distribution of data points as it totally ignores the class and density distribution of a test point’s k-environment or neighborhood. A resolution to this problem is to dynamically choose k for each test instance to be classified. However, given a large dataset, it becomes very tasking to maximize the k-Nearest Neighbor performance by tuning k. This work proposes the use of Simulated Annealing, a metaheuristic search algorithm, to select optimal k, thus eliminating the prospect of an exhaustive search for optimal k. The results obtained in four different classification tasks demonstrate a significant improvement in the computational efficiency against the k-Nearest Neighbor methods that perform exhaustive search for k, as accurate nearest neighbors are returned faster for k-Nearest Neighbor classification, thus reducing the computation time.
Бесплатно
Статья научная
Data Structures and Algorithms (DSA) is a widely explored domain in the world of computer science. With it being a crucial topic during an interview for a software engineer, it is a topic not to take lightly. There are various platforms available to understand a particular DSA, several programming problems, and its implementation. Hacckerank, LeetCode, GeeksForGeeks (GFG), and Codeforces are popular platforms that offer a vast collection of programming problems to enhance skills. However, with the huge content of DSA available, it is challenging for users to identify which one among all to focus on after going through the required domain. This work aims to use a Content-based filtering (CBF) recommendation engine to suggest users programming-based questions related to different DSAs such as arrays, linked lists, trees, graphs, etc. The recommendations are generated using the concept of Natural Language Processing (NLP). The data set consists of approximately 500 problems. Each problem is represented by the features such as problem statement, related topics, level of difficulty, and platform link. Standard measures like cosine similarity, accuracy, precision, and F1-score are used to determine the proportion of correctly recommended problems. The percentages indicate how well the system performed regarding that evaluation. The result shows that CBF achieves an accuracy of 83 %, a precision of 83 %, a recall of 80%, and an F1-score of 80%. This recommendation system is deployed on a web application that provides a suitable user interface allowing the user to interact with other features. With this, a whole E-learning application is built to aid potential software engineers and computer science students. In the future, two more recommendation systems, Collaborative Filtering (CF) and Hybrid systems, can be implemented to make a comparison and decide which is most suitable for the given problem statement.
Бесплатно
An Evolving Cascade System Based on a Set of Neo - Fuzzy Nodes
Статья научная
Neo-fuzzy elements are used as nodes for an evolving cascade system. The proposed system can tune both its parameters and architecture in an online mode. It can be used for solving a wide range of Data Mining tasks (namely time series forecasting). The evolving cascade system with neo-fuzzy nodes can process rather large data sets with high speed and effectiveness.
Бесплатно
An Expert GIS-Based ANP-OWA Decision Making Framework for Tourism Development Site Selection
Статья научная
The selection of a tourism development site involves a complex array of decision criteria that may have interdependence relationships within and between them. In the process of finding the optimum location that meet desired conditions, the analyst is challenged by the tedious manipulation of spatial data and the management of multiple decision-making criteria. This paper presents a novel decision making framework in which expert systems (ES), and geographic information systems–based multicriteria evaluation techniques (Analytical Network Process and fuzzy quantifiers-guided ordered weighted averaging operators (GIS-based ANP-OWA)) are integrated systematically to facilitate the selection of suitable sites for building new tourism facilities. First, ES is used for recommending the proper site selection criteria and their interdependence relationships. Then, the GIS-based ANP-OWA is used to perform the spatial data analysis necessary to generate a wide range of possible candidate sites’ scenarios taking into accounts both the interdependence relationships between sitting criteria and the level of risk the decision-makers wish to assume in their multicriteria evaluation. A typical case study is presented to demonstrate the application of the proposed decision making framework.
Бесплатно
An Exploratory Study on Simulated Annealing for Feature Selection in Learning-to-rank
Статья научная
Learning-to-rank is an applied domain of supervised machine learning. As feature selection has been found to be effective for improving the accuracy of learning models in general, it is intriguing to investigate this process for learning-to-rank domain. In this study, we investigate the use of a popular meta-heuristic approach called simulated annealing for this task. Under the general framework of simulated annealing, we explore various neighborhood selection strategies and temperature cooling schemes. We further introduce a new hyper-parameter called the progress parameter that can effectively be used to traverse the search space. Our algorithms are evaluated on five publicly benchmark datasets of learning-to-rank. For a better validation, we also compare the simulated annealing-based feature selection algorithm with another effective meta-heuristic algorithm, namely local beam search. Extensive experimental results show the efficacy of our proposed models.
Бесплатно
An Extended Neo-Fuzzy Neuron and its Adaptive Learning Algorithm
Статья научная
A modification of the neo-fuzzy neuron is proposed (an extended neo-fuzzy neuron (ENFN)) that is characterized by improved approximating properties. An adaptive learning algorithm is proposed that has both tracking and smoothing properties and solves prediction, filtering and smoothing tasks of non-stationary “noisy” stochastic and chaotic signals. An ENFN distinctive feature is its computational simplicity compared to other artificial neural networks and neuro-fuzzy systems.
Бесплатно
Статья научная
Image segmentation is a basic work in the field of image analysis and computer vision. Thresholding is one of the simplest methods of image segmentation. In general, thresholding approaches based on 1-D histogram do not make use of any space adjacent information of the image, thus it is often ruined by noise; thus, thresholding methods based on 2-D histogram are put forward. These methods have better segmentation performance, but heavy computation is required with these methods. In the paper, to improve the running efficiency of thresholding methods based 2D histogram, ant colony optimization algorithm combined with genetic algorithm are employed to speed up these methods, which view 2-D histogram based thresholding as a kind of optimization problem. The proposed method has been conducted on some images. Experiments results display that the proposed approach is able to achieve improved search performance which is an efficient method and suitable for real time applications.
Бесплатно
An Improved Sampling Dijkstra Approach for Robot Navigation and Path Planning
Статья научная
The task of path planning is extremely investigated in mobile robotics to determine a suitable path for the robot from the source point to the target point. The intended path should satisfy purposes such as collision-free, shortest-path, or power-saving. In the case of a mobile robot, many constraints should be considered during the selection of path planning algorithms such as static or dynamic environment and holonomic or non-holonomic robot. There is a pool of path-planning algorithms in the literature. However, Dijkstra is still one of the effective algorithms due to its simplicity and capabilities to compute single-source shortest-path to every position in the workspace. Researchers propose several versions of the Dijkstra algorithm, especially in mobile robotics. In this paper, we propose an improved approach based on the Dijkstra algorithm with a simple sampling method to sample the workspace to avoid an exhaustive search of the Dijkstra algorithm which consumes time and resources. The goal is to identify the same optimal shortest path resulting from the Dijkstra algorithm with minimum time and number of turns i.e., a smoothed path. The simulation results show that the proposed method improves the Dijkstra algorithm with respect to the running time and the number of turns of the mobile robot and outperforms the RRT algorithm concerning the path length.
Бесплатно
An Initilization Method for Subspace Clustering Algorithm
Статья научная
Soft subspace clustering is an important part and research hotspot in clustering research. Clustering in high dimensional space is especially difficult due to the sparse distribution of the data and the curse of dimensionality. By analyzing limitations of the existing algorithms, the concept of subspace difference and an improved initialization method are proposed. Based on these, a new objective function is given by taking into account the compactness of the subspace clusters and subspace difference of the clusters. And a subspace clustering algorithm based on k-means is presented. Theoretical analysis and experimental results demonstrate that the proposed algorithm significantly improves the accuracy.
Бесплатно
An Intelligent Alarm Based Visual Eye Tracking Algorithm for Cheating Free Examination System
Статья научная
A modern and well established education system is a backbone of any nation’s success. High reputation in international platform can only be achieved when best and deserving students represent your country and earn reputation on their ability and dedication. For this purpose an education system must be a cheating free system so that non-deserving students should not get the positions which they don’t deserve. This research aims to develop such a system which can be used in exam halls to avoid the cheating based on student’s eye movement. The algorithm detects the human from the scene followed by the face detection and recognition. The next phase involves eye detection followed by eye's movement tracking to analyze and decide about whether the student is involved in cheating or not. The system can be used on a large scale in educational institutions as well as in corporate sector wherever exams have been conducted.
Бесплатно
