• Title/Summary/Keyword: Co-occurrence

Search Result 1,058, Processing Time 0.036 seconds

Terrain Classification Using Three-Dimensional Co-occurrence Features (3차원 Co-occurrence 특징을 이용한 지형분류)

  • Jin Mun-Gwang;Woo Dong-Min;Lee Kyu-Won
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.1
    • /
    • pp.45-50
    • /
    • 2003
  • Texture analysis has been efficiently utilized in the area of terrain classification. In this application features have been obtained in the 2D image domain. This paper suggests 3D co-occurrence texture features by extending the concept of co-occurrence to 3D world. The suggested 3D features are described using co-occurrence histogram of digital elevations at two contiguous position as co-occurrence matrix. The practical construction of co-occurrence matrix limits the number of levels of digital elevation. If the digital elevation is quantized into the number of levels over the whole DEM(Digital Elevation Map), the distinctive features can not be obtained. To resolve the quantization problem, we employ local quantization technique which preserves the variation of elevations. Experiments has been carried out to verify the proposed 3D co-occurrence features, and the addition of the suggested features significantly improves the classification accuracy.

Language Identification by Fusion of Gabor, MDLC, and Co-Occurrence Features (Gabor, MDLC, Co-Occurrence 특징의 융합에 의한 언어 인식)

  • Jang, Ick-Hoon;Kim, Ji-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.277-286
    • /
    • 2014
  • In this paper, we propose a texture feature-based language identification by fusion of Gabor, MDLC (multi-lag directional local correlation), and co-occurrence features. In the proposed method, for a test image, Gabor magnitude images are first obtained by Gabor transform followed by magnitude operator. Moments for the Gabor magniude images are then computed and vectorized. MDLC images are then obtained by MDLC operator and their moments are computed and vectorized. GLCM (gray-level co-occurrence matrix) is next calculated from the test image and co-occurrence features are computed using the GLCM, and the features are also vectorized. The three vectors of the Gabor, MDLC, and co-occurrence features are fused into a feature vector. In classification, the WPCA (whitened principal component analysis) classifier, which is usually adopted in the face identification, searches the training feature vector most similar to the test feature vector. We evaluate the performance of our method by examining averaged identification rates for a test document image DB obtained by scanning of documents with 15 languages. Experimental results show that the proposed method yields excellent language identification with rather low feature dimension for the test DB.

ANNs on Co-occurrence Matrices for Mobile Malware Detection

  • Xiao, Xi;Wang, Zhenlong;Li, Qi;Li, Qing;Jiang, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2736-2754
    • /
    • 2015
  • Android dominates the mobile operating system market, which stimulates the rapid spread of mobile malware. It is quite challenging to detect mobile malware. System call sequence analysis is widely used to identify malware. However, the malware detection accuracy of existing approaches is not satisfactory since they do not consider correlation of system calls in the sequence. In this paper, we propose a new scheme called Artificial Neural Networks (ANNs) on Co-occurrence Matrices Droid (ANNCMDroid), using co-occurrence matrices to mine correlation of system calls. Our key observation is that correlation of system calls is significantly different between malware and benign software, which can be accurately expressed by co-occurrence matrices, and ANNs can effectively identify anomaly in the co-occurrence matrices. Thus at first we calculate co-occurrence matrices from the system call sequences and then convert them into vectors. Finally, these vectors are fed into ANN to detect malware. We demonstrate the effectiveness of ANNCMDroid by real experiments. Experimental results show that only 4 applications among 594 evaluated benign applications are falsely detected as malware, and only 18 applications among 614 evaluated malicious applications are not detected. As a result, ANNCMDroid achieved an F-Score of 0.981878, which is much higher than other methods.

Histogram Equalized Eigen Co-occurrence Features for Color Image Classification (컬러이미지 검색을 위한 히스토그램 평활화 기반 고유 병발 특징에 관한 연구)

  • Yoon, TaeBok;Choi, YoungMee;Choo, MoonWon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.705-708
    • /
    • 2010
  • An eigen color co-occurrence approach is proposed that exploits the correlation between color channels to identify the degree of image similarity. This method is based on traditional co-occurrence matrix method and histogram equalization. On the purpose of feature extraction, eigen color co-occurrence matrices are computed for extracting the statistical relationships embedded in color images by applying Principal Component Analysis (PCA) on a set of color co-occurrence matrices, which are computed on the histogram equalized images. That eigen space is created with a set of orthogonal axes to gain the essential structures of color co-occurrence matrices, which is used to identify the degree of similarity to classify an input image to be tested for various purposes. In this paper RGB, Gaussian color space are compared with grayscale image in terms of PCA eigen features embedded in histogram equalized co-occurrence features. The experimental results are presented.

An Investigation on Expanding Co-occurrence Criteria in Association Rule Mining (연관규칙 마이닝에서의 동시성 기준 확장에 대한 연구)

  • Kim, Mi-Sung;Kim, Nam-Gyu;Ahn, Jae-Hyeon
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.1
    • /
    • pp.23-38
    • /
    • 2012
  • There is a large difference between purchasing patterns in an online shopping mall and in an offline market. This difference may be caused mainly by the difference in accessibility of online and offline markets. It means that an interval between the initial purchasing decision and its realization appears to be relatively short in an online shopping mall, because a customer can make an order immediately. Because of the short interval between a purchasing decision and its realization, an online shopping mall transaction usually contains fewer items than that of an offline market. In an offline market, customers usually keep some items in mind and buy them all at once a few days after deciding to buy them, instead of buying each item individually and immediately. On the contrary, more than 70% of online shopping mall transactions contain only one item. This statistic implies that traditional data mining techniques cannot be directly applied to online market analysis, because hardly any association rules can survive with an acceptable level of Support because of too many Null Transactions. Most market basket analyses on online shopping mall transactions, therefore, have been performed by expanding the co-occurrence criteria of traditional association rule mining. While the traditional co-occurrence criteria defines items purchased in one transaction as concurrently purchased items, the expanded co-occurrence criteria regards items purchased by a customer during some predefined period (e.g., a day) as concurrently purchased items. In studies using expanded co-occurrence criteria, however, the criteria has been defined arbitrarily by researchers without any theoretical grounds or agreement. The lack of clear grounds of adopting a certain co-occurrence criteria degrades the reliability of the analytical results. Moreover, it is hard to derive new meaningful findings by combining the outcomes of previous individual studies. In this paper, we attempt to compare expanded co-occurrence criteria and propose a guideline for selecting an appropriate one. First of all, we compare the accuracy of association rules discovered according to various co-occurrence criteria. By doing this experiment we expect that we can provide a guideline for selecting appropriate co-occurrence criteria that corresponds to the purpose of the analysis. Additionally, we will perform similar experiments with several groups of customers that are segmented by each customer's average duration between orders. By this experiment, we attempt to discover the relationship between the optimal co-occurrence criteria and the customer's average duration between orders. Finally, by a series of experiments, we expect that we can provide basic guidelines for developing customized recommendation systems. Our experiments use a real dataset acquired from one of the largest internet shopping malls in Korea. We use 66,278 transactions of 3,847 customers conducted during the last two years. Overall results show that the accuracy of association rules of frequent shoppers (whose average duration between orders is relatively short) is higher than that of causal shoppers. In addition we discover that with frequent shoppers, the accuracy of association rules appears very high when the co-occurrence criteria of the training set corresponds to the validation set (i.e., target set). It implies that the co-occurrence criteria of frequent shoppers should be set according to the application purpose period. For example, an analyzer should use a day as a co-occurrence criterion if he/she wants to offer a coupon valid only for a day to potential customers who will use the coupon. On the contrary, an analyzer should use a month as a co-occurrence criterion if he/she wants to publish a coupon book that can be used for a month. In the case of causal shoppers, the accuracy of association rules appears to not be affected by the period of the application purposes. The accuracy of the causal shoppers' association rules becomes higher when the longer co-occurrence criterion has been adopted. It implies that an analyzer has to set the co-occurrence criterion for as long as possible, regardless of the application purpose period.

The Extraction of Liver from the CT Images Using Co-occurrence Matrix (Co-occurrence Matrix를 이용한 CT 영상에서의 간 영역 추출)

  • 김규태
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04b
    • /
    • pp.508-510
    • /
    • 2000
  • 본 논문은 의료 영상 중에서 복부 방사선 분야에서 보편적으로 사용되고 있는 CT 영상으로부터 간영역을 분할해내는 방법을 제시한다. 본 논문에서는 복부 CT영상에서 근육 부분과 척추, 늑골 부분을 제거하고, co-occurrence matrix를 이용한 국부 영상 이진화(local image thresholding) 방법을 통해 영상에서 간 영역을 분할한다.

  • PDF

Priority Method on Same Co-occurrence Count in Adaptive Rank-based Reindexing Scheme (적응적 순위 기반 재인덱싱 기법에서의 동일 빈도 값에 대한 우선순위 방법)

  • You Kang Soo;Yoo Hee Jin;Jang Euee S.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12C
    • /
    • pp.1167-1174
    • /
    • 2005
  • In this paper, we propose a priority method on same co-occurrence count in adaptive rank-based reindexing scheme for lossless indexed image compression. The priority on same co-occurrence count in co-occurrence count matrix depends on a front count value on each raw of co-occurrence count matrix, a count value around diagonal line on each raw of the matrix, and a count value around large co-occurrence count on each raw of the matrix. Experimental results show that our proposed method can be reduced up to 1.71 bpp comparing with Zeng's and Pinho's method.

A Study on Multi-frequency Keyword Visualization based on Co-occurrence (다중빈도 키워드 가시화에 관한 연구)

  • Lee, HyunChang;Shin, SeongYoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.103-104
    • /
    • 2018
  • Recently, interest in data analysis has increased as the importance of big data becomes more important. Particularly, as social media data and academic research communities become more active and important, analysis becomes more important. In this study, co-word analysis was conducted through altmetrics articles collected from 2012 to 2017. In this way, the co-occurrence network map is derived from the keyword and the emphasized keyword is extracted.

  • PDF

A Study on Multi-frequency Keyword Visualization based on Co-occurrence (다중빈도 키워드 가시화에 관한 연구)

  • Lee, HyunChang;Shin, SeongYoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.424-425
    • /
    • 2018
  • Recently, interest in data analysis has increased as the importance of big data becomes more important. Particularly, as social media data and academic research communities become more active and important, analysis becomes more important. In this study, co-word analysis was conducted through altmetrics articles collected from 2012 to 2017. In this way, the co-occurrence network map is derived from the keyword and the emphasized keyword is extracted.

  • PDF

An Investigation on Expanding Co-occurrence Criteria in Association Rule Mining (온라인 연관관계 분석의 장바구니 기준에 대한 연구)

  • Kim, Mi-Sung;Kim, Nam-Gyu
    • CRM연구
    • /
    • v.4 no.2
    • /
    • pp.19-29
    • /
    • 2011
  • There is a large difference between purchasing patterns in an online shopping mall and in an offline market. This difference may be caused mainly by the difference in accessibility of online and offline markets. It means that an interval between the initial purchasing decision and its realization appears to be relatively short in an online shopping mall, because a customer can make an order immediately. Because of the short interval between a purchasing decision and its realization, an online shopping mall transaction usually contains fewer items than that of an offline market. In an offline market, customers usually keep some items in mind and buy them all at once a few days after deciding to buy them, instead of buying each item individually and immediately. On the contrary, more than 70% of online shopping mall transactions contain only one item. This statistic implies that traditional data mining techniques cannot be directly applied to online market analysis, because hardly any association rules can survive with an acceptable level of Support because of too many Null Transactions. Most market basket analyses on online shopping mall transactions, therefore, have been performed by expanding the co-occurrence criteria of traditional association rule mining. While the traditional co-occurrence criteria defines items purchased in one transaction as concurrently purchased items, the expanded co-occurrence criteria regards items purchased by a customer during some predefined period (e.g., a day) as concurrently purchased items. In studies using expanded co-occurrence criteria, however, the criteria has been defined arbitrarily by researchers without any theoretical grounds or agreement. The lack of clear grounds of adopting a certain co-occurrence criteria degrades the reliability of the analytical results. Moreover, it is hard to derive new meaningful findings by combining the outcomes of previous individual studies. In this paper, we attempt to compare expanded co-occurrence criteria and propose a guideline for selecting an appropriate one. First of all, we compare the accuracy of association rules discovered according to various co-occurrence criteria. By doing this experiment we expect that we can provide a guideline for selecting appropriate co-occurrence criteria that corresponds to the purpose of the analysis. Additionally, we will perform similar experiments with several groups of customers that are segmented by each customer's average duration between orders. By this experiment, we attempt to discover the relationship between the optimal co-occurrence criteria and the customer's average duration between orders. Finally, by a series of experiments, we expect that we can provide basic guidelines for developing customized recommendation systems.

  • PDF