• Journal of the Korean Data and Information Science Society
• /
• v.22 no.1
• /
• pp.19-27
• /
• 2011

Recommendation systems are developed to overcome the problems of selection and to promote intention to use. In this study, we propose a recommendation system using adjacency data according to user's behavior over time. For this, the product adjacencies are identified from the adjacency matrix based on graph theory. This research finds that there is a trend in the users' behavior over time though product adjacency fluctuates over time. The system is tested on its usability. The tests show that implementing this recommendation system increases users' intention to purchase and reduces the search time.

• Honam Mathematical Journal
• /
• v.41 no.1
• /
• pp.67-87
• /
• 2019

The main aim of this study is to characterize new classes of multicone graphs which are determined by their adjacency spectra, their Laplacian spectra, their complement with respect to signless Laplacian spectra and their complement with respect to their adjacency spectra. A multicone graph is defined to be the join of a clique and a regular graph. If n is a positive integer, a friendship graph $F_n$ consists of n edge-disjoint triangles that all of them meet in one vertex. It is proved that any connected graph cospectral to a multicone graph $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ is determined by its adjacency spectra as well as its Laplacian spectra. In addition, we show that if $n{\neq}2$, the complement of these graphs are determined by their adjacency spectra. At the end of the paper, it is proved that multicone graphs $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ are determined by their signless Laplacian spectra and also we prove that any graph cospectral to one of multicone graphs $F_n{\nabla}F_n$ is perfect.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1107-1116
• /
• 2014

In this paper, we review recent developments in network analysis using the graph theory, and introduce ongoing research area with relevant theoretical results. In specific, we introduce basic notations in graph, and conditional and marginal approach in constructing the adjacency matrix. Also, we introduce the Marcenko-Pastur law, the Tracy-Widom law, the white Wishart distribution, and the spiked distribution. Finally, we mention the relationship between degrees and eigenvalues for the detection of hubs in a network.

• Korean Journal of Remote Sensing
• /
• v.27 no.6
• /
• pp.717-728
• /
• 2011

An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.215-224
• /
• 2006

We call the bipartite graph G is normal provided the reduced adjacency matrix A of G is normal. In this paper we give graph representations of normal matrices. In addition we shall have the characterization of signed bipartite normal graphs.

• The KIPS Transactions:PartB
• /
• v.12B no.1 s.97
• /
• pp.31-38
• /
• 2005

This paper proposes an object-based image retrieval scheme using color adjacency and clustering method. Color adjacency features in boundary regions are utilized to extract candidate blocks of interest from image database and a clustering method is used to extract the regions of interest(ROI) from candidate blocks of interest. To measure the similarity between the query and database images, the histogram intersection technique is used. The color pair information used in the proposed method is robust against translation, rotation, and scaling. Consequently, experimental results have shown that the proposed scheme is superior to existing methods in terms of ANMRR.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.3E
• /
• pp.33-39
• /
• 2000

This study investigated whether the adjacency principle. demonstrated in a perceived visual space, can be applied to auditory space. In order to demonstrate an auditory adjacency principle, multiple sound sources were varied in direction and distance in an acoustically absorbant space. Specifically, a NEAR sound source was located 10° to the left of the listener's midline at a distance of 2 meters; a FAR sound source was located 10° to the right at a distance of 5 meters. These sources served as perceptual reference points with respect to the localization of three test sounds, all at a distance of 3 meters. Two of three test sounds were directionally closer to the NEAR and FAR reference sounds, respectively. The other was between the reference sources directionally. The listener was asked to judge the perceived distances and the loudness of the three test sounds and the two reference sounds. The results indicated that the apparent distances of the test sounds were most determined by the disparity of distance between each test sound and the reference sound most directionally adjacent to it. Therefore, the findings offer evidence that the adjacency principle can be applied to the auditory space.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.4
• /
• pp.359-365
• /
• 2011

This study aims at filtering ALS points into ground and non-ground effectively through labeling and window based algorithm by utilizing 2D adjacency based on scan line. Firstly, points adjacency is constructed through minimal search based on scan line. Connected component labeling algorithm is applied to classify raw ALS points into ground and non-ground by utilizing the adjacency structure. Then, some small objects are removed by morphology filtering, and isolated ground points are restored by IDW estimation. The experimental results shows that the method provides good filtering performance( about 97% accuracy) for diverse sites, and the overall processing takes less time than converting raw data into TIN or raster grid.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.3
• /
• pp.304-310
• /
• 2009

In this paper, target extraction method in FLIR(forward-looking infrared) images based on fuzzy thresholding which used bi-modality and adjacency to determine membership value is proposed. The bi-modality represents how a pixel is classified into a part of target using distribution of pixel values in a local region, and The adjacency is a measure to represent how each pixel is far from the target region. First, membership value is calculated using above two measures, and then fuzzy thresholding is performed to extract the target. To evaluate performance of proposed target extraction method, we compare other segmentation methods using various FLIR tank image. Experimental results show that the proposed algorithm is a good segmentation performance.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.157-160
• /
• 2000

This paper proposes a color-based image retrieval method using color adjacency and gradient. In proposed method, both the adjacency of different colors and gradient of a color in homogeneous region are considered as features of an image. The gradient, defined as the maximum distance along the direction with largest change of color, is computed for each pixel to determine whether the center color is similar or different to the neighboring colors. Therefore the problems caused by uniform quantization, which is popularly used at most existing retrieval, can be avoided. And furthermore, the storage of the feature is reduced by the proposed binary representation.