Search

• A CODAS-based group decision model is designed for the T-spherical fuzzy context. • A T-spherical fuzzy Minkowski distance operator based on Heronian mean is proposed. • A novel ordered weighted Heronian Minkowski distance (TSFOWHMD) operator is advanced. • The TSFOWHMD operator is utilized to improve the CODAS method. • The applicability of the developed methodology is verified through a case study. T-spherical fuzzy sets (TSFSs) are more flexible and efficient tools to deal with ambiguous, uncertain and vague information in complex real-world decision-making problems than various extended intuitionistic fuzzy sets. This paper aims to develop a novel T-spherical fuzzy (TSF) Combinative Distance-Based ASsessment (CODAS) based on the Heronian Minkowski distance aggregation operator, this new method can capture interrelationship between input arguments. Some TSF weighted Heronian Minkowski distance (TSFWHMD) aggregation operators with generalization are developed based on Heronian mean and Minkowski-type distance, their properties are discussed as well as their families are analyzed. Furthermore, the TSF MAGDM methodology based on the improved CODAS is designed, where the Minkowski-type distance is used to define the TSF similarity for computing the expert weights and to construct the maximizing deviation method (MDM) for determining the attribute weights, respectively. The TSF ordered weighted Heronian Hamming distance (TSFOWHHD) and TSF ordered weighted Heronian Euclidean distance (TSFOWHED) operators derived from the TSFOWHMD operator are integrated into the CODAS method, which is an improved method for both measuring the deviation of the negative ideal solution from each alternative and capturing the correlation between attributes. Finally, the feasibility and practicality of developed methodology are illustrated with an example of CAE (Computer Aided Engineering) software selection for lithium-ion power battery (LiPB) design, sensitivity analysis and method comparisons are performed to elucidate the reliability and validity of the developed methodology. [ABSTRACT FROM AUTHOR]

Game theory is a powerful tool in modeling actual decision-making problems. In many cases, it is difficult for players to give a crisp value of payoff. To conquer this issue, various extensions of fuzzy sets have been introduced to represent the payoffs. Although type-2 intuitionistic fuzzy (T2IF) set (T2IFS) can solve the game problem effectively, sometimes players prefer to give the primary (secondary) membership and non-membership degrees with some approximate ranges rather than crisp values. T2IFS cannot express such uncertain payoffs. Thus, this paper initiates a new concept called type-2 interval-valued intuitionistic fuzzy (T2IVIF) set (T2IVIFS) which has stronger ability than T2IFS and interval-valued intuitionistic fuzzy set (IVIFS) in representing uncertain information. Hamacher operations of T2IVIFSs are given. Hamming and Euclidean distances between T2IVIFSs are defined respectively. Some Hamacher aggregation operators for T2IVIFSs are developed and some desirable properties are analyzed. Afterwards, an effective method is proposed for solving T2IVIF matrix game, which can make game results more accurate and reliable. An example of new energy vehicle industry development is provided to validate the proposed T2IVIF matrix game. Comparative analyses reveal that the matrix game in T2IVIF environment has better flexibility and reliability than that in T2IF and IVIF environments. [ABSTRACT FROM AUTHOR]

Atanassov's intuitionistic fuzzy sets play a vital role in handling vagueness and uncertainty successfully as they associate an additional non-membership degree to each element of the universal set. Interval-valued intuitionistic fuzzy (IVIF) sets are more generalized quantities in this direction as they use intervals (⊂ [ 0 , 1 ]) to define the membership and non-membership grades of each element of the set. However, without defining basic arithmetic operations on the IVIF values/sets, the study is incomplete. This paper broadly examines the division and subtraction operations over any arbitrary IVIF values/sets using the concept of Hamming distance between them. A deterministic linear optimization model is proposed and solved in order to obtain the complete expressions for these operations. Next, various fundamental properties and relationships are examined and proved for the proposed arithmetic operations over IVIF values/sets. Furthermore, an example of a multi-criteria decision-making problem under uncertain conditions is studied and analyzed using the developed arithmetic operations on IVIF numbers. • Derived the generalized subtraction and division operations for IVIF values/sets. • The notion of Hamming distance and dual-simplex algorithm are used. • A deterministic LPP is proposed to obtain the expressions for the operations. • The fundamental properties and relationships for the basic operations are explored. • A case study of multi-criteria decision-making problems has been discussed. [ABSTRACT FROM AUTHOR]

Intuitionistic fuzzy (IF) theory has become main approach to representing imprecision and vagueness. The IF divergence measure (IFDivM) based on Jensen–Shannon divergence is perhaps the most widely used measure to compare the similarity of multiple intuitionistic fuzzy sets (IFSs). In the present paper, this IFDivM is examined and applied to multiple examples. It is found that some extant IFDivMs hardly satisfy the axiomatic definition, and in a few cases even unable to show divergence of trivial IFSs. To address these inconsistencies, a new IFDivM based on Jensen–Shannon divergence is proposed, free from these problems. The effectiveness of the proposed IFDivM is tested on several critical cases, and precise analysis of its properties is performed. It is proved that the proposed IFDivM satisfies the axiomatic definition of IFDivMs. To illustrate the practical significance of the IFDivM, a novel intuitionistic fuzzy (IF) TODIM method, based on the proposed IFDivM, is developed, termed as GIF-TODIM method. Unlike the existing IF-TODIM methods, GIF-TODIM does not suffer from the revere ordering inconsistencies. The proposed GIF-TODIM method and the proposed IFDivM are applied to a real-world case study on supplier selection. A detailed comparative analysis is performed taking the TOPSIS method and other IFDivMs as baselines. The role of attitude on the final choice is analyzed in great detail. It is found that the proposed GIF-TODIM method is indeed useful, effective, and superior to the counterpart methods, when it comes to real-world situations. Concomitantly, in the present work, it is also revealed that the TOPSIS method based on the 2-D Hamming distance is a special form of the proposed GIF-TODIM method, when decision-makers have the same attitude towards losses and gains. Thus, an interesting relationship between TOPSIS and TODIM is identified under the intuitionistic fuzzy environment, which is bound to propel significant research in the area of decision making under uncertain conditions. As a whole, the article offers comprehensive analyses of IFDivMs and the TODIM method under the intuitionistic fuzzy environment. • Construct a new IF divergence measure (IFDivM) based on Jensen–Shannon divergence. • Develop a GIF-TODIM method based on the new IFDivM. • Apply the proposed GIF-TODIM method to a supplier selection problem. • Provide parameter analysis and comparative analysis with TOPSIS and other IFDivMs. • Show that TOPSIS based on 2-D Hamming distance is a special form of our GIF-TODIM. [ABSTRACT FROM AUTHOR]

Internet giants collects a huge volume of data using the modern technologies and apply them to data mining for prediction and decision making in numerous fields, for instance, health care, web analysis, insurance, market basket analysis and bioinformatics. However, the huge repositories collects variety of data, it inevitably gathers a mass of private and sensitive data about the users. The revelation of such private and sensitive information may harm the user's privacy. In recent years, privacy is becoming an increasingly main concern in many data mining applications. Privacy preserving data mining (PPDM) has been evolved as the solution for the privacy issues. PPDM deals with protecting the individual's data without compromising the data utility. In this paper, privacy-chain based homomorphic encryption scheme along with the statistical transformation method weight of evidence and information value is proposed to preserve the private and sensitive information about the user. The proposed statistical transformation with homomorphic encryption (S T H E) algorithm will perturb both the numerical and categorical values from the adult income, bank marketing and lung cancer datasets without affecting the data utility. In STHE , the quasi-identifiers are initially perturbed with IV and then privacy-chain based homomorphic encryption using RSA is applied to preserve the data privacy. The performance of the STHE algorithm is made compared with the state-of-the-art algorithms using the classifier models, decision tree, random forest, extreme gradient boost, and support vector machines. The experimental results shows that the proposed STHE algorithm outperforms the existing techniques in terms of accuracy, performance, data transformation, data retrieval and privacy preservation level along with the data utility. [ABSTRACT FROM AUTHOR]

Battery is the core component of new energy vehicles. The choice of proper battery supplier is crucial for new energy vehicle companies since it directly affects the market share and core competitiveness. Some criteria of battery suppliers cannot be evaluated in the short period and need to be continuously evaluated at different periods (or time). Decision makers (DMs) may present some hesitancy when giving their evaluations. Thus, this paper formulates the battery supplier selection as a type of time-series based multi-criteria large-scale group decision making (LSGDM) with intuitionistic fuzzy information. A novel method is proposed to effectively resolve the battery supplier selection. Firstly, considering the importance of different periods, the comprehensive time weights are determined by combining the exponential decay model and the maximal entropy ordered weighted averaging (OWA) operator weights determining model. Secondly, DMs are divided into different clusters by using the proposed intuitionistic fuzzy Hamming distance-based fuzzy c-means (FCM) algorithm on each criterion. Combining the confidence levels of DMs and the corresponding clustering results, the DMs' weights with respect to each criterion are determined. Then, the comprehensive criteria weights are obtained by integrating the intuitionistic fuzzy entropy and the constructed multi-objective programming model. Thirdly, the individual consensus level and group consensus degree at each period are defined, respectively. Then, a new identification approach is proposed to identify DMs to be adjusted. Subsequently, a total adjustment minimization model is built to adjust these DMs' evaluation information. The optimal alternative is generated according to the collective global overall evaluations. Finally, a real example of batter supplier selection is demonstrated to verify the feasibility and superiority of the proposed method. [ABSTRACT FROM AUTHOR]

• Machine learning approaches to resolve identity issues. • Implementing TensorFlow to investigate policing dataset. • Predictive models using ML techniques to identify fraudulent or genuine IDs. This paper focuses on applications of various machine learning techniques on an anonymized policing dataset used in EU SPIRIT Horizon 2020 project to identify fraudulent identities and help Law Enforcement Agencies (LEAs) in their investigation in finding potential criminals and identity resolution. Lack of qualitative data and appropriate methodology to carry out research on criminal fraudulent identities is a common reason for fewer research in this area. Additionally, it is a very sensitive data to work with and minor inaccuracy in prediction of result causes massive impact in the society as genuine people could be questioned whereas criminals could be sent free. Both of these issues are addressed in this paper by application of 39 million records from policing dataset and working towards higher accuracy while building the model. Various machine learning approaches are applied to train the dataset to make predictions and the research focus on being able to predict the 5 suspected fraudulent identities out of 39 million records in the policing dataset. One of the applied machine learning techniques include TensorFlow along with Keras model which has seldomly been applied by researchers in detection of criminal data. To compare the results and test accuracy of TensorFlow model, other machine learning techniques such as Support Vector Machine, Naïve Bayes and K-nearest Neighbours are also applied to have a comparative study on the obtained outcomes from each model. The goal of this research is to find fraudulent IDs amongst all the anonymized IDs in the criminal dataset using TensorFlow and three other machine learning models and select the most optimal model out of them. Since the model is comparing two names so string-matching techniques such as Levenshtein edit distance, Hamming Distance, Jaro-Winkler and Soundex were applied to select an effective approach first before building the model and analysing the results. TensorFlow model demonstrated highest accuracy with relatively least execution time and the only model to successfully predict all the 5 suspects from the policing dataset. [ABSTRACT FROM AUTHOR]

Content-based histopathology image retrieval can be a useful technique for help in diagnosing various diseases. The process of retrieving images is often time-consuming and challenging due to the need for high-dimensional features when trying to model complex content. Hashing methods can therefore be employed to resolve the challenge by producing binary codes of different lengths. Deep hashing methods are frequently superior to traditional machine learning approaches but are affected by the size of training sets. In addition, back-propagation learning can further complicate the generation of binary values. Hence, this paper proposes a novel Siamese deep hashing model, named histopathology Siamese deep hashing (HSDH), for histopathology image retrieval. Two designed deep hashing models with shared weights and structures are used to generate hash codes. A Hamming distance layer is then applied to evaluate the similarity of the generated values. A highly effective loss function is also introduced that incorporates a modified version of the standard contrastive loss function with an error estimation term to improve both the training and retrieval phases. In the retrieval phase, the trained model compares a query image with all the training images and ranks the most similar images. According to the experimental results on two publicly available databases, BreakHis and Kather, the HSDH model outperforms other state-of-the-art hashing-based methods in histopathology image retrieval. [ABSTRACT FROM AUTHOR]

Highlights • A novel system for off-line text-independent writer identification is proposed. • Effective feature extraction and dimensionality reduction methods are proposed. • Experiments are conducted on four challenging datasets (two English and two Arabic). • The proposed system provides high identification rates. • The proposed system demonstrates good performance stability across all the datasets. Abstract Feature engineering forms an important component of machine learning and pattern recognition. It is a fundamental process for off-line writer identification of handwritten documents, which continues to be an interesting subject of research in various forensic and authentication areas. In this work, we propose an efficient, yet computationally and conceptually simple framework for off-line text independent writer identification using local textural features in characterizing the writing style of each writer. These include Local Binary Patterns (LBP), Local Ternary Patterns (LTP), and Local Phase Quantization (LPQ). Our approach focuses on exploiting the writing images at small observation regions where a set of connected component sub-images are cropped and extracted from each handwriting sample (document or set of word/text line images). These connected components are seen as texture images where each one of them is subjected to feature extraction using LBP, LPQ, or LTP. Then, a histogram sequence concatenation is applied to the feature image after dimensionality reduction followed by image subdivision into a number of non-overlapping regions. For classification, the 1-NN (Nearest Neighbor) classifier is used to identify the writer of the questioned samples based on the dissimilarity of feature vectors computed from all components in the writing. Experiments on IFN/ENIT (411 writers/Arabic), AHTID/MW (53 writers/Arabic), CVL (309 writers/English), and IAM (657 writers/English) databases demonstrate that our proposed system outperforms old and recent state-of-the-art writer identification systems on Arabic script, and demonstrates a competitive performance on English ones. [ABSTRACT FROM AUTHOR]

Feature engineering is fundamental in applied machine learning. It plays a major role in writer identification of handwritten documents, which has been an active area of research in the literature. In this paper, we propose a conceptually simple, yet high-quality and computationally efficient descriptor referred to as block wise local binary count (BW-LBC) for offline text independent writer identification of handwritten documents. The proposed BW-LBC operator characterizes the writing style of each writer by a set of histograms calculated from all the connected components in the writing. Each histogram is constructed by calculating the occurrence distribution of pixels corresponding to the writing within small blocks in each connected component extracted and cropped from the input handwriting sample (document or set of words/text lines). Specifically, for a given connected component divided into N × N non-overlapping blocks, the appearance probability of writing pixels in the block number i corresponds to the histogram bin number i in the produced corresponding histogram of N × N bins. The samples are classified according to their normalized histogram feature vectors through the nearest-neighbor rule (1-NN) using the Hamming distance. Extensive experiments performed on four challenging handwritten databases (IFN/ENIT, AHTID/MW, CVL and IAM) containing handwritten texts in Arabic and English languages, show that the proposed system using the BW-LBC operator demonstrates superior performance on the Arabic databases (i.e., AHTID/MW and IFN/ENIT) and competitive performance on the English scripts compared to the old and recent state-of-the-art writer identification approaches. [ABSTRACT FROM AUTHOR]

• To learn compact codes, we force mapping matrix of each view to orthogonalize. • A binary graph structure is embedded into one-step binary multi-view clustering. • An effective solving algorithm based on ADM is proposed for the above model. • Empirical experimental results illustrate that the effectiveness of the method. The multi-view clustering problem has attracted considerable attention over recent years for the remarkable clustering performance due to exploiting complementary information from multiple views. Most existing related research work processes data in the decimal real value space that is not the most compatible space for computers. Binary code learning, also known as hashing technology, is well-known for fast Hamming distance computation, less storage requirement and accurate calculation results. The Hamming space is most enjoyed by computers because of binary/hash codes. Several studies combine multi-view clustering with binary code learning for improving clustering performance. However, there is much redundant information contained in the learned binary codes, which negatively affects the clustering performance, but these studies ignore eliminating redundant information for learning compact codes. In addition, they don't give a unified (one-step) clustering framework with binary graph structure, which doesn't lead to the optimal clustering result due to the information loss during the two-step process. In this paper, to cope with the two issues, we propose an orthogonal mapping binary graph method (OMBG) for the multi-view clustering problem, which makes the mapping matrix of every view orthogonalize for eliminating redundant information and embeds a binary graph structure into the unified binary multi-view clustering framework for extracting local geometric structure information of binary codes and achieving the optimal clustering result. Furthermore, we design an effective optimization algorithm based on alternating direction minimization to solve the model of OMBG. Extensive experiments performed on four frequently-used benchmark multi-view datasets illustrate the superiority of OMBG which is compared with some state-of-the-art clustering baselines. [ABSTRACT FROM AUTHOR]

The iris recognition on a mobile phone is different from the conventional iris recognition implemented on a dedicated device in that the computational power of a mobile phone and the space for placing NIR (near infrared) LED (light emitting diode) illuminators and iris camera are limited. This paper raises these issues in detail based on real implementation of an iris recognition system in a mobile phone and proposes some solutions to these issues. An experimental study was conducted to search for the relevant power and wavelength of NIR LED illuminators with their positioning on a phone for capturing a good quality iris image. Subsequently, in view of the disparity between the user's gazing point and the center of the iris camera which causes degradation of acquired iris images, an experiment was performed to locate the appropriate gazing point for good iris image capture. A fast eye detection algorithm was proposed for implementation under the mobile platform with low computational facility. The experiments were conducted on a currently released mobile phone and the results showed promising potential for adoption of iris recognition as a reliable authentication means. As a result, two 850 nm LEDs were selected for iris illumination at 1.1 cm away from the iris camera for the size of a 7 cm × 13.7 cm phone. In the performance, the recognition accuracy was 0.1% EER (equal error rate) and the eye detection rate with the speed of 17.64 ms on a mobile phone was 99.4%. [ABSTRACT FROM AUTHOR]

In evolutionary computation, systematically structuring the population is used to manage the evolution process. Thus controlling the amount of diversity during the algorithm search. Island-based, hierarchical-based, and cellular automata are the most popular structured population models utilized for evolutionary algorithms to improve their diversity and convergence. Specifically, the cellular automata model arranges the population of individuals in a 2D grid spatial structure where the concepts of cells and their neighbors are considered to drive the evolution step. A recent population-based algorithm is proposed called the crow search algorithm (CSA). It stimulates the behavior of crows in keeping their food in hidden places to be retrieved when needed. Like other population-based algorithms, CSA endures from slow convergence because of inadequate diversity. In this paper, the cellular automata model is incorporated with the optimization framework of CSA to control its diversity during the search, thus boosts its efficiency. The proposed method is abbreviated as CCSA. In CCSA, the population is structured as a 2D grid where the active population is iteratively determined. At each iteration, each individual is updated based on current neighboring individuals determined by the topological neighborhood shapes and follows the best neighboring individual in its active population. The CCSA is evaluated using 23 standard benchmark functions well-circulated in the literature. Initially, six cellular topological neighborhood shapes (i.e., L5, L9, C9, C13, C21, and C25) are studied with various problem sizes to investigate their impact on the CCSA convergence. Comparative evaluations against twelve state-of-the-art methods, including four CSA versions, are conducted. The comparative results prove the effectiveness of the proposed CCSA. The diversity of the proposed CCSA has also been stressed using convergence analysis and hamming distance. For further validations, the proposed algorithm is evaluated using three real-world problems published in IEEE-CEC2011 and welded beam design problems. Again, the proposed CCSA yields more fruitful results than other well-established methods using real-world problems. In conclusion, this paper provides an efficient alternative of CSA to perfectly maintain the diversity of the search, which can be further tested using other optimization problems. • Cellular automata is injected with crow search algorithm (CCSA) to empower diversity. • CCSA with six neighborhood shapes (i.e., L5, L9, C9, C13, C21, and C25) are proposed. • CSA is evaluated using 23 test functions, and four Engineering problems. • Results show the superiority of the CCSA against the other comparative algorithms. [ABSTRACT FROM AUTHOR]

In the current scenario to access the data securely from wireless network, e-commerce and internet have become a great concern. As the technologies become commercialized in high markets growth, there is a need for effective and secure implementation to authenticate the identity of the people. Several biometric techniques that exploit physiological and behavioral traits of people have been developed for verification and identification of the individuals to make the system more reliable and secure. In this paper a unique method is used to extract the tragus feature of the ear. The proposed method used is an enhanced edge detection method. A line is drawn connecting the maximum coordinate, midpoint and the minimum coordinate. The mid region of this line gives the tragus of the ear. The ear feature tragus is taken because it is almost free from occlusions. In order to develop an efficient ear authentication system the feature level fusion is applied. The shape of the ear is also extracted. Then the tragus and the shape of the ear are combined together to form the fused template. The authentication rate of the system with the features of tragus, shape of the ear and the fused template is calculated using the Hamming distance technique and Euclidean distance method. The experimental result is carried out on two databases of IIT Delhi ear database and Mathematical Analysis of Images (AMI) ear database including occlusion. The proposed system is to prove that the accuracy of the ear biometric authentication system using Hamming distance technique in fused feature is better than the individual feature of tragus and the ear shape. When a single feature tragus is considered tragus is better than the ear shape as it is a unique feature of the ear. [ABSTRACT FROM AUTHOR]

Highlights: [•] A combination of SVM & Hamming distance approach is used for iris recognition. [•] The proposed method has a recognition rate of 99.91% & 99.88% on CASIA & Chek image database. [•] The accuracy is excellent for the CASIA & Chek image database in terms of FAR & FRR. [Copyright &y& Elsevier]

Abstract: Vein pattern recognition is one of the newest biometric techniques researched today. One of the reliable and robust personal identification authentication approaches using palm vein patterns is presented in this paper. In our work, we consider the palm vein as a piece of texture and apply texture-based feature extraction techniques to palm vein authentication. A Gabor filter provides the optimized resolution in both the spatial and frequency domains, thus it is a basis for extracting local features in the palm vein recognition. However, Gabor filter has many potential parameter combinations to use, and it is a common practice now to use multiple Gabor filters or to determine desired single combination by experience. The overall aim of this work is to discuss the optimization algorithm that determines the best parameter values of a single Gabor filter for palm vein recognition. In order to obtain effective pattern of palm vascular, we proposed an innovative and robust adaptive Gabor filter method to encode the palm vein features in bit string representation. The bit string representation, called VeinCode, offers speedy template matching and enables more effective template storage and retrieval. The similarity of two VeinCodes is measured by normalized Hamming distance. A total of 4140 palm vein images were collected form 207 persons to verify the validity of the proposed palm vein recognition approach. High accuracy has been obtained by the proposed method and the speed of this method is rapid enough for real-time palm vein recognition. Experimental results demonstrate that our proposed approach is feasible and effective in palm vein recognition. [Copyright &y& Elsevier]

Abstract: For intuitionistic fuzzy sets, it is argued that three dimensional distance functions are not necessary because two dimensional distance functions already provide a simple and concise expression of the distance between two intuitionistic fuzzy sets. However, we show that a three dimensional interpretation of intuitionistic fuzzy sets could give different comparison results to the ones obtained with their two dimensional counterparts. In addition to the existing distances, we define a three dimensional Hausdorff distance and compare its consistency with its two dimensional counterpart, which shows the usefulness of the three dimensional functions to model and provide the expression of the distance between two intuitionistic fuzzy sets. [Copyright &y& Elsevier]

Abstract: We analyze the use of the ordered weighted averaging (OWA) operator in the selection of human resources in sport management. We use different business decision-making techniques for doing so. We consider the use of the Hamming distance, the adequacy coefficient and the index of maximum and minimum level. That is, we use the OWA distance (OWAD), the OWA adequacy coefficient (OWAAC) and the OWA index of maximum and minimum level (OWAIMAM) operator. By using the OWA operator, we can parameterize these decision-making techniques from the maximum to the minimum result according to the interests of the decision-maker. We develop an illustrative example regarding the decision-making process to follow in the selection of a football player for a team. [Copyright &y& Elsevier]

• A New framework as a criteria for picture fuzzy entropy. • A new and effective R-Norm picture fuzzy information measure. • A new decision making method based on the concept of VIKOR. • Application of proposed method in forecasting the poll outcome and in investment problem. The Picture Fuzzy Sets (PFS) are well suitable to capture inconsistent, imprecise and uncertain information in multiple-criteria decision-making problems. This communication is intended to introduce one such information measure defined on PFSs called R -norm picture fuzzy information measure. Moreover, a new set of axioms is proposed as a criteria for picture fuzzy entropy. Besides establishing the validity of proposed R -norm picture fuzzy information measure, some of its major properties are also discussed. In application part, the proposed information measure is applied in predicting the outcome of elections in a poll bound country through opinion polls and to solve an investment problem. [ABSTRACT FROM AUTHOR]