Soft Computing

Humans have the ability to quickly identify their own environment, understand, judge and analyze it, which is one of the important reasons why human beings can survive in nature for a long time and gradually develop it into a prosperous society today. The key to human's ability to perceive and understand the environment lies in the ability to accurately find and identify objects, understand and describe visual scenes, and even express emotions on this basis. And if computers can realize automatic and accurate image recognition, and even understand the semantics of images correctly, it will surely improve and facilitate human life. Based on this, the author integrated and optimized the computer image recognition system and applied it in this paper. The core technology of the system is to improve the image algorithm, which can complete the training, testing and classification of target images. The experimental data are available. Choosing this algorithm to improve the learning and training of the data generated by the original image processing is more effective than directly training the original image.

Databases obtained from different search engines, market data, patients’ symptoms and behaviours, etc., are some common examples of set-valued data, in which a set of values are correlated with a single entity. In real-world data deluge, various irrelevant attributes lower the ability of experts both in speed and in predictive accuracy due to high dimension and insignificant information, respectively. Attribute selection is the concept of selecting those attributes that ideally are necessary as well as sufficient to better describe the target knowledge. Rough set-based approaches can handle uncertainty available in the real-valued information systems after the discretization process. In this paper, we introduce a novel approach for attribute selection in set-valued information system based on tolerance rough set theory. The fuzzy tolerance relation between two objects using a similarity threshold is defined. We find reducts based on the degree of dependency method for selecting best subsets of attributes in order to obtain higher knowledge from the information system. Analogous results of rough set theory are established in case of the proposed method for validation. Moreover, we present a greedy algorithm along with some illustrative examples to clearly demonstrate our approach without checking for each pair of attributes in set-valued decision systems. Examples for calculating reduct of an incomplete information system are also given by using the proposed approach. Comparisons are performed between the proposed approach and fuzzy rough-assisted attribute selection on a real benchmark dataset as well as with three existing approaches for attribute selection on six real benchmark datasets to show the supremacy of proposed work.

The world has been greatly affected by increased utilization of mobile methods as well as smart devices in field of health. Health professionals are increasingly utilizing these technologies' advantages, resulting in a significant improvement in clinical health care. For this purpose, machine learning (ML) as well as Internet of Things can be utilized effectively. This study aims to propose a novel data analysis method for a health monitoring system based on ML. Goal of research is to create a ML-based smart health monitoring method. It helps the doctors keep an eye on patients from a distance as well as take periodic actions if they need to. Utilizing wearable sensors, a set of five parameters—the electrocardiogram, pulse rate, pressure, temperature, and position detection—have been identified. Kernelized component vector neural networks are used to choose the features in the input data. Then, a sparse attention-based convolutional neural network with a structural search algorithm was used to classify the selected features. For a variety of datasets, the proposed technique attained validation accuracy 95%, training accuracy 92%, RMSE 52%, F-measure 53%, and sensitivity 77%.

We present a category equivalent to that of semi-Nelson algebras. The objects in this category are pairs consisting of a semi-Heyting algebra and one of its filters. The filters must contain all the dense elements of the semi-Heyting algebra and satisfy an additional technical condition. We also show that the category of dually hemimorphic semi-Nelson algebras is equivalent to that of dually hemimorphic semi-Heyting algebras.

We define row path norm and column path norm of a matrix and relate path norms with other standard matrix norms. A row (resp. column) path norm gives a path that maximizes relative row (resp. column) distances starting from the first row (resp. column). The comparison takes place from the last row (resp. column) to the first row (resp. column), tracing the path. We categorize different versions of path norms and provide algorithms to compute them. We show that brute-force methods to compute path norms have exponential running time. We give dynamic programming algorithms, which, in contrast, take quadratic running time for computing the path norms. We define path norms on Church numerals and Church pairs. Finally, we present applications of path norms in computing condition number, and ordering the solutions of magic squares and Latin squares