scholarly journals Automatic F-term Classification of Japanese Patent Documents Using the k-Nearest Neighborhood Method and the SMART Weighting

2007 ◽  
Vol 14 (1) ◽  
pp. 163-189
Author(s):  
Masaki Murata ◽  
Toshiyuki Kanamaru ◽  
Tamotsu Shirado ◽  
Hitoshi Isahara
2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Rajesh Kumar ◽  
Rajeev Srivastava ◽  
Subodh Srivastava

A framework for automated detection and classification of cancer from microscopic biopsy images using clinically significant and biologically interpretable features is proposed and examined. The various stages involved in the proposed methodology include enhancement of microscopic images, segmentation of background cells, features extraction, and finally the classification. An appropriate and efficient method is employed in each of the design steps of the proposed framework after making a comparative analysis of commonly used method in each category. For highlighting the details of the tissue and structures, the contrast limited adaptive histogram equalization approach is used. For the segmentation of background cells, k-means segmentation algorithm is used because it performs better in comparison to other commonly used segmentation methods. In feature extraction phase, it is proposed to extract various biologically interpretable and clinically significant shapes as well as morphology based features from the segmented images. These include gray level texture features, color based features, color gray level texture features, Law’s Texture Energy based features, Tamura’s features, and wavelet features. Finally, the K-nearest neighborhood method is used for classification of images into normal and cancerous categories because it is performing better in comparison to other commonly used methods for this application. The performance of the proposed framework is evaluated using well-known parameters for four fundamental tissues (connective, epithelial, muscular, and nervous) of randomly selected 1000 microscopic biopsy images.


Author(s):  
Ashish Sureka ◽  
Pranav Prabhakar Mirajkar ◽  
Prasanna Nagesh Teli ◽  
Girish Agarwal ◽  
Sumit Kumar Bose

Frequenz ◽  
2020 ◽  
Vol 74 (9-10) ◽  
pp. 351-358
Author(s):  
Duygu Nazan Gençoğlan ◽  
Mustafa Turan Arslan ◽  
Şule Çolak ◽  
Esen Yildirim

AbstractIn this study, estimation of Ultra-Wideband (UWB) characteristics of microstrip elliptic patch antenna is investigated by means of k-nearest neighborhood algorithm. A total of 16,940 antennas are simulated by changing antenna dimensions and substrate material. Antennas are examined by observing Return Loss and Voltage Standing Wave Ratio (VSWR) characteristics. In the study, classification of antennas in terms of having UWB characteristics results in accuracies higher than 97%. Additionally, Consistency based Feature Selection method is applied to eliminate redundant and irrelevant features. This method yields that substrate material does not affect the UWB characteristics of the antenna. Classification process is repeated for the reduced feature set, reaching to 97.44% accuracy rate. This result is validated by 854 antennas, which are not included in the original antenna set. Antennas are designed for seven different substrate materials keeping all other parameters constant. Computer Simulation Technology Microwave Studio (CST MWS) is used for the design and simulation of the antennas.


2013 ◽  
Vol 26 (5) ◽  
pp. 835-845 ◽  
Author(s):  
Sung-Han Lim ◽  
Hyang-Mi Lee ◽  
Seong-Lyong Park ◽  
Tae-Young Heo

Author(s):  
N. Li ◽  
C. Liu ◽  
N. Pfeifer ◽  
J. F. Yin ◽  
Z.Y. Liao ◽  
...  

Feature selection and description is a key factor in classification of Earth observation data. In this paper a classification method based on tensor decomposition is proposed. First, multiple features are extracted from raw LiDAR point cloud, and raster LiDAR images are derived by accumulating features or the “raw” data attributes. Then, the feature rasters of LiDAR data are stored as a tensor, and tensor decomposition is used to select component features. This tensor representation could keep the initial spatial structure and insure the consideration of the neighborhood. Based on a small number of component features a k nearest neighborhood classification is applied.


Author(s):  
M. Kurematsu

We should check whether there are any existing patent documents whose claims fall foul of our idea or innovation before we submit own idea or innovation as a patent. We need a lot of resource to do it, because there are a lot of existing patent documents. These days, we can submit the patent documents by a computer and the number of patent documents is increasing quickly. Therefore, people need a system to support this task. In order to meet this demand, I propose a framework of a system to classify patent documents in this paper. This system uses machine translation to deal with synonym and Rough Set theory to classify patent documents. First, it extracts decision rules by Rough Set Theory from labeled patent documents translated by machine translation. Then, it classifies unlabeled patent documents by estimating labels based on the weight of the matched rules. In this approach, the satisfactory index (SI), the coverage index (CI) and the Lift value are used as the weight of rules and they are compared with the maximum number, the total number and the Mahalanobis distance. I evaluated this idea by classifying Japanese patent documents using a prototype system based on this idea. In the evaluation, the accuracy was about 0.40 and the accuracy has not reached the practical level. Therefore I will apply this approach to other document classification task and improve it based on the analysis result of them.


2019 ◽  
Vol 23 (Suppl. 1) ◽  
pp. 99-111
Author(s):  
Hakan Koyuncu

Fingerprint localisation technique is an effective positioning technique to determine the object locations by using radio signal strength, values in indoors. The technique is subject to big positioning errors due to challenging environmental conditions. In this paper, initially, a fingerprint localisation technique is deployed by using classical k-nearest neighborhood method to determine the unknown object locations. Additionally, several artificial neural networks, are employed, using fingerprint data, such as single-layer feed forward neural network, multi-layer feed forward neural network, multi-layer back propagation neural network, general regression neural network, and deep neural network to determine the same unknown object locations. Fingerprint database is built by received signal strength indicator measurement signatures across the grid locations. The construction and the adapted approach of different neural networks using the fingerprint data are described. The results of them are compared with the classical k-nearest neighborhood method and it was found that deep neural network was the best neural network technique providing the maximum positioning accuracies.


Sign in / Sign up

Export Citation Format

Share Document