Power Aggregation Operators and Similarity Measures Based on Improved Intuitionistic Hesitant Fuzzy Sets and their Applications to Multiple Attribute Decision Making

Intuitionistic hesitant fuzzy set(IHFS)is amixture of two separated notions called intuitionistic fuzzy set(IFS)and hesitant fuzzy set(HFS),as an important technique to cope with uncertain and awkward information in realistic decision issues.IHFS contains the grades of truth and falsity in the formof the subset of the unit interval.The notion of IHFS was defined by many scholars with different conditions,which contain several weaknesses.Here,keeping in view the problems of already defined IHFSs,we will define IHFS in another way so that it becomes compatible with other existing notions.To examine the interrelationship between any numbers of IHFSs,we combined the notions of power averaging(PA)operators and power geometric(PG)operators with IHFSs to present the idea of intuitionistic hesitant fuzzy PA(IHFPA)operators,intuitionistic hesitant fuzzy PG(IHFPG)operators,intuitionistic hesitant fuzzy power weighted average(IHFPWA)operators,intuitionistic hesitant fuzzy power ordered weighted average(IHFPOWA)operators,intuitionistic hesitant fuzzy power ordered weighted geometric(IHFPOWG)operators,intuitionistic hesitant fuzzy power hybrid average(IHFPHA)operators,intuitionistic hesitant fuzzy power hybrid geometric(IHFPHG)operators and examined as well their fundamental properties.Some special cases of the explored work are also discovered.Additionally,the similarity measures based on IHFSs are presented and their advantages are discussed along examples.Furthermore,we initiated a new approach to multiple attribute decision making(MADM)problem applying suggested operators and a mathematical model is solved to develop an approach and to establish its common sense and adequacy.Advantages,comparative analysis,and graphical representation of the presented work are elaborated to show the reliability and effectiveness of the presented works.

P-Indeterminate Vector Similarity Measures of Orthopair Neutrosophic Number Sets and Their Decision-MakingMethod with Indeterminate Degrees

In the complexity and indeterminacy of decision making(DM)environments,orthopair neutrosophic number set(ONNS)presented by Ye et al.can be described by the truth and falsity indeterminacy degrees.Then,ONNS demonstrates its advantages in the indeterminate information expression,aggregations,and DM problems with some indeterminate ranges.However,the existing research lacks some similarity measures between ONNSs.They are indispensable mathematical tools and play a crucial role in DM,pattern recognition,and clustering analysis.Thus,it is necessary to propose some similaritymeasures betweenONNSs to supplement the gap.To solve the issue,this study firstly proposes the p-indeterminate cosine measure,p-indeterminate Dice measure,p-indeterminate Jaccard measure of ONNSs(i.e.,the three parameterized indeterminate vector similarity measures of ONNSs)in vector space.Then,a DMmethod based on the parameterized indeterminate vector similarity measures of ONNSs is developed to solve indeterminate multiple attribute DM problems by choosing different indeterminate degrees of the parameter p,such as the small indeterminate degree(p=0)or the moderate indeterminate degree(p=0.5)or the big indeterminate degree(p=1).Lastly,an actual DM example on choosing a suitable logistics supplier is provided to demonstrate the flexibility and practicability of the developed DM approach in indeterminate DM problems.By comparison with existing relative DM methods,the superiority of this study is that the established DMapproach indicates its flexibility and suitability depending on decision makers’indeterminate degrees(decision risks)in ONNS setting.

Synthetic Lethal Interactions Prediction Based on Multiple Similarity Measures Fusion

The synthetic lethality(SL)relationship arises when a combination of deficiencies in two genes leads to cell death,whereas a deficiency in either one of the two genes does not.The survival of the mutant tumor cells depends on the SL partners of the mutant gene,thereby the cancer cells could be selectively killed by inhibiting the SL partners of the oncogenic genes but normal cells could not.Therefore,there is an urgent need to develop more efficient computational methods of SL pairs identification for cancer targeted therapy.In this paper,we propose a new approach based on similarity fusion to predict SL pairs.Multiple types of gene similarity measures are integrated and/c-nearest neighbors algorithm(k-NN)is applied to achieve the similarity-based classification task between gene pairs.As a similarity-based method,our method demonstrated excellent performance in multiple experiments.Besides the effectiveness of our method,the ease of use and expansibility can also make our method more widely used in practice.

SOME NEW SIMILARITY MEASURES FOR INTUITIONISTIC FUZZY VALUES AND THEIR APPLICATION IN GROUP DECISION MAKING

We first propose a series of similarity measures for intuitionistic fuzzy values （IFVs） based on the intuitionistic fuzzy operators （Atanassov 1995）. The parameters in the proposed similarity measures can control the degree of membership and the degree of non-membership of an IFV, which can reflect the decision maker’s risk preference. Moreover, we can obtain some known similarity measures when some fixed values are assigned to the parameters. Furthermore, we apply the similarity measures to aggregate IFVs and develop some aggregation operators, such as the intuitionistic fuzzy dependent averaging operator and the intuitionistic fuzzy dependent geometric operator, whose prominent characteristic is that the associated weights only depend on the aggregated intuitionistic fuzzy arguments and can relieve the influence of unfair arguments on the aggregated results. Based on these aggregation operators, we develop some group decision making methods, and finally extend our results to interval-valued intuitionistic fuzzy environment.

A Content-Based Medical Image Retrieval Method Using Relative Difference-Based Similarity Measure

Content-based medical image retrieval(CBMIR)is a technique for retrieving medical images based on automatically derived image features.There are many applications of CBMIR,such as teaching,research,diagnosis and electronic patient records.Several methods are applied to enhance the retrieval performance of CBMIR systems.Developing new and effective similarity measure and features fusion methods are two of the most powerful and effective strategies for improving these systems.This study proposes the relative difference-based similarity measure(RDBSM)for CBMIR.The new measure was first used in the similarity calculation stage for the CBMIR using an unweighted fusion method of traditional color and texture features.Furthermore,the study also proposes a weighted fusion method for medical image features extracted using pre-trained convolutional neural networks(CNNs)models.Our proposed RDBSM has outperformed the standard well-known similarity and distance measures using two popular medical image datasets,Kvasir and PH2,in terms of recall and precision retrieval measures.The effectiveness and quality of our proposed similarity measure are also proved using a significant test and statistical confidence bound.

An Information Content and Set of Common Superconcepts-Based Algorithm to Estimate Similarity between Concepts of Ontologies

Ontologies have been used for several years in life sciences to formally represent concepts and reason about knowledge bases in domains such as the semantic web, information retrieval and artificial intelligence. The exploration of these domains for the correspondence of semantic content requires calculation of the measure of semantic similarity between concepts. Semantic similarity is a measure on a set of documents, based on the similarity of their meanings, which refers to the similarity between two concepts belonging to one or more ontologies. The similarity between concepts is also a quantitative measure of information, calculated based on the properties of concepts and their relationships. This study proposes a method for finding similarity between concepts in two different ontologies based on feature, information content and structure. More specifically, this means proposing a hybrid method using two existing measures to find the similarity between two concepts from different ontologies based on information content and the set of common superconcepts, which represents the set of common parent concepts. We simulated our method on datasets. The results show that our measure provides similarity values that are better than those reported in the literature.

An intelligent automatic correlation method of oilbearing strata based on pattern constraints:An example of accretionary stratigraphy of Shishen 100 block in Shinan Oilfield of Bohai Bay Basin,East China

Aiming at the problem that the data-driven automatic correlation methods which are difficult to adapt to the automatic correlation of oil-bearing strata with large changes in lateral sedimentary facies and strata thickness,an intelligent automatic correlation method of oil-bearing strata based on pattern constraints is formed.We propose to introduce knowledge-driven in automatic correlation of oil-bearing strata,constraining the correlation process by stratigraphic sedimentary patterns and improving the similarity measuring machine and conditional constraint dynamic time warping algorithm to automate the correlation of marker layers and the interfaces of each stratum.The application in Shishen 100 block in the Shinan Oilfield of the Bohai Bay Basin shows that the coincidence rate of the marker layers identified by this method is over 95.00%,and the average coincidence rate of identified oil-bearing strata reaches 90.02% compared to artificial correlation results,which is about 17 percentage points higher than that of the existing automatic correlation methods.The accuracy of the automatic correlation of oil-bearing strata has been effectively improved.

A Portfolio Selection Method Based on Pattern Matching with Dual Information of Direction and Distance

Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world.

Measuring Musical Rhythm Similarity: Further Experiments with the Many-to-Many Minimum-Weight Matching Distance

Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of sounded pulses made up of low-pitched (dum) and high-pitched (tak) sounds. Experiments are described that compare the effectiveness of the many-to-many minimum-weight matching between two sequences to serve as a measure of similarity that correlates well with human judgements of rhythm similarity. This measure is also compared to the often used edit distance and to the one-to-one minimum-weight matching. New results are reported from experiments performed with three widely different datasets of real- world and artificially generated musical rhythms (including Afro-Cuban rhythms), and compared with results previously reported with a dataset of Middle Eastern dum-tak rhythms.

Deep image retrieval using artificial neural network interpolation and indexing based on similarity measurement

In content-based image retrieval(CBIR),primitive image signatures are critical because they represent the visual characteristics.Image signatures,which are algorithmically descriptive and accurately recognized visual components,are used to appropriately index and retrieve comparable results.To differentiate an image in the category of qualifying contender,feature vectors must have image information's like colour,objects,shape,spatial viewpoints.Previous methods such as sketch-based image retrieval by salient contour(SBIR)and greedy learning of deep Boltzmann machine(GDBM)used spatial information to distinguish between image categories.This requires interest points and also feature analysis emerged image detection problems.Thus,a proposed model to overcome this issue and predict the repeating pattern as well as series of pixels that conclude similarity has been necessary.In this study,a technique called CBIR-similarity measure via artificial neural network interpolation(CBIR-SMANN)has been presented.By collecting datasets,the images are resized then subject to Gaussian filtering in the pre-processing stage,then by permitting them to the Hessian detector,the interesting points are gathered.Based on Skewness,mean,kurtosis and standard deviation features were extracted then given to ANN for interpolation.Interpolated results are stored in a database for retrieval.In the testing stage,the query image was inputted that is subjected to pre-processing,and feature extraction was then fed to the similarity measurement function.Thus,ANN helps to get similar images from the database.CBIR-SMANN have been implemented in the python tool and then evaluated for its performance.Results show that CBIR-SMANN exhibited a high recall value of 78%with a minimum retrieval time of 980 ms.This showed the supremacy of the proposed model was comparatively greater than the previous ones.

A Multisource Contour Matching Method Considering the Similarity of Geometric Features

The existing multi-source contour matching studies have focused on the matching methods with consideration of topological relations and similarity measurement based on spatial Euclidean distance,while it is lack of taking the contour geometric features into account,which may lead to mismatching in map boundaries and areas with intensive contours or extreme terrain changes.In light of this,it is put forward that a matching strategy from coarse to precious based on the contour geometric features.The proposed matching strategy can be described as follows.Firstly,the point sequence is converted to feature sequence according to a feature descriptive function based on curvature and angle of normal vector.Then the level of similarity among multi-source contours is calculated by using the longest common subsequence solution.Accordingly,the identical contours could be matched based on the above calculated results.In the experiment for the proposed method,the reliability and efficiency of the matching method are verified using simulative datasets and real datasets respectively.It has been proved that the proposed contour matching strategy has a high matching precision and good applicability.

Audio Segmentation via the Similarity Measure of Audio Feature Vectors

A formula to compute the similarity between two audio feature vectors is proposed, which can map arbitrary pair of vectors with equivalent dimension to [0,1）. To fulfill the task of audio segmentation, a self-similarity matrix is computed to reveal the inner structure of an audio clip to be segmented. As the final result must be consistent with the subjective evaluation and be adaptive to some special applications, a set of weights is adopted, which can be modified through relevance feedback techniques. Experiments show that satisfactory result can be achieved via the algorithm proposed in this paper.

Cotangent Similarity Measure of Consistent Neutrosophic Sets and Application to Multiple Attribute Decision-Making Problems in Neutrosophic Multi-Valued Setting

A neutrosophic multi-valued set(NMVS)is a crucial representation for true,false,and indeterminate multivalued information.Then,a consistent single-valued neutrosophic set(CSVNS)can effectively reflect the mean and consistency degree of true,false,and indeterminate multi-valued sequences and solve the operational issues between different multi-valued sequence lengths in NMVS.However,there has been no research on consistent single-valued neutrosophic similarity measures in the existing literature.This paper proposes cotangent similarity measures and weighted cotangent similarity measures between CSVNSs based on cotangent function in the neutrosophic multi-valued setting.The cosine similarity measures showthe cosine of the angle between two vectors projected into amultidimensional space,rather than their distance.The cotangent similaritymeasures in this study can alleviate several shortcomings of cosine similarity measures in vector space to a certain extent.Then,a decisionmaking approach is presented in viewof the established cotangent similarity measures in the case of NMVSs.Finally,the developed decision-making approach is applied to selection problems of potential cars.The proposed approach has obtained two different results,which have the same sort sequence as the compared literature.The decision results prove its validity and effectiveness.Meantime,it also provides a new manner for neutrosophic multi-valued decision-making issues.

The Construction of Statisticaly Self-similar Measures

We have studied statistically self similar measures together with statistically self similar sets in this paper.A special kind of statistically self similar measures has been constructed and a class of statistically self similar sets as well.

A Service Discovery Approach Based on a Quantitative Similarity Measure for M-Tourism Platforms

This paper presents a localization architecture for an m-tourism services delivery platform. The aim of the system is to deliver services for nomads (e-tourists) according to their localization and according to the results given by the search engine. This engine is based on a quantitative similarity measure. The discovered services are presented via a Web Map Service. Moreover, the platform integrates an adaptation sub-system for heterogeneous environments and an e-negotiation module.

A Spacecra Equipment Layout Optimization Method for Diverse and Competitive Design

The spacecraequipment layout optimization design(SELOD)problems with complicated performance con-straints and diversity are studied in this paper.The previous literature uses the gradient-based algorithm to obtain optimized non-overlap layout schemes from randomly initialized cases eectively.However,these local optimal solutions are too dicult to jump out of their current relative geometry relationships,signi􀀀cantly limiting their further improvement in performance indicators.Therefore,considering the geometric diversity of layout schemes is put forward to alleviate this limitation.First,similarity measures,including modi􀀀ed cosine similarity and gaussian kernel function similarity,are introduced into the layout optimization process.Then the optimization produces a set of feasible layout candidates with the most remarkable dierence in geometric distribution and the most representative schemes are sampled.Finally,these feasible geometric solutions are used as initial solutions to optimize the physical performance indicators of the spacecra,and diversi􀀀ed layout schemes of spacecraequipment are generated for the engineering practice.The validity and eectiveness of the proposed methodology are demonstrated by two SELOD applications.

Analysis of TOPSIS techniques based on bipolar complex fuzzy N-soft setting and their applications in decision-making problems

A novel model termed a bipolar complex fuzzy N-soft set(BCFN-SS)is initiated for tackling information that involves positive and negative aspects,the second dimension,and parameterised grading simultaneously.The theory of BCFN-SS is the generalisation of two various theories,that is,bipolar complex fuzzy(BCF)and N-SS.The invented model of BCFN-SS helps decision-makers to cope with the genuine-life dilemmas containing BCF information along with parameterised grading at the same time.Further,various algebraic operations,including the usual type of union,intersection,complements,and a few others types,are invented.Certain primary operational laws for BCFNSS are also invented.Moreover,a technique for order preference by similarity to the ideal solution(TOPSIS)approach is devised in the setting of BCFN-SS for managing strategic decision-making(DM)dilemmas containing BCFN-SS information.Keeping in mind the usefulness and benefits of the TOPSIS approach,two various types of TOPSIS approaches in the environment of BCFN-SS are devised and then a numerical example for exposing the usefulness of the devised TOPSIS approach is interpreted.To disclose the prominence and benefits of the devised work,the devised approaches with numerous prevailing work are compared.

A Quantum Tanimoto Coefficient Fidelity for Entanglement Measurement

Fidelity plays an important role in quantum information processing,which provides a basic scale for comparing two quantum states.At present,one of the most commonly used fidelities is Uhlmann-Jozsa(U-J)fidelity.However,U-J fidelity needs to calculate the square root of the matrix,which is not trivial in the case of large or infinite density matrices.Moreover,U-J fidelity is a measure of overlap,which has limitations in some cases and cannot reflect the similarity between quantum states well.Therefore,a novel quantum fidelity measure called quantum Tanimoto coefficient(QTC)fidelity is proposed in this paper.Unlike other existing fidelities,QTC fidelity not only considers the overlap between quantum states,but also takes into account the separation between quantum states for the first time,which leads to a better performance of measure.Specifically,we discuss the properties of the proposed QTC fidelity.QTC fidelity is compared with some existing fidelities through specific examples,which reflects the effectiveness and advantages of QTC fidelity.In addition,based on the QTC fidelity,three discrimination coefficients d_(1)^(QTC),d_(2)^(QTC),and d_^(3)^(QTC)are defined to measure the difference between quantum states.It is proved that the discrimination coefficient d_(3)^(QTC)is a true metric.Finally,we apply the proposed QTC fidelity-based discrimination coefficients to measure the entanglement of quantum states to show their practicability.

2D matrix based indexing with color spectralhistogram for efficient image retrieval

A novel content based image retrieval （CBIR） algorithmusing relevant feedback is presented. The proposed frameworkhas three major contributions： a novel feature descriptor calledcolor spectral histogram （CSH） to measure the similarity betweenimages; two-dimensional matrix based indexing approach proposedfor short-term learning （STL）; and long-term learning （LTL）.In general, image similarities are measured from feature representationwhich includes color quantization, texture, color, shapeand edges. However, CSH can describe the image feature onlywith the histogram. Typically the image retrieval process starts byfinding the similarity between the query image and the imagesin the database; the major computation involved here is that theselection of top ranking images requires a sorting algorithm to beemployed at least with the lower bound of O（n log n）. A 2D matrixbased indexing of images can enormously reduce the searchtime in STL. The same structure is used for LTL with an aim toreduce the amount of log to be maintained. The performance ofthe proposed framework is analyzed and compared with the existingapproaches, the quantified results indicates that the proposedfeature descriptor is more effectual than the existing feature descriptorsthat were originally developed for CBIR. In terms of STL,the proposed 2D matrix based indexing minimizes the computationeffort for retrieving similar images and for LTL, the proposed algorithmtakes minimum log information than the existing approaches.

Facial Expression Recognition Based on the Q-shift DT-CWT and Rotation Invariant LBP

In this paper, a novel method based on dual-tree complex wavelet transform(DT-CWT) and rotation invariant local binary pattern(LBP) for facial expression recognition is proposed. The quarter sample shift (Q-shift) DT-CWT can provide a group delay of 1/4 of a sample period, and satisfy the usual 2-band filter bank constraints of no aliasing and perfect reconstruction. To resolve illumination variation in expression verification, low-frequency coefficients produced by DT-CWT are set zeroes, high-frequency coefficients are used for reconstructing the image, and basic LBP histogram is mapped on the reconstructed image by means of histogram specification. LBP is capable of encoding texture and shape information of the preprocessed images. The histogram graphs built from multi-scale rotation invariant LBPs are combined to serve as feature for further recognition. Template matching is adopted to classify facial expressions for its simplicity. The experimental results show that the proposed approach has good performance in efficiency and accuracy.