• Title/Summary/Keyword: Means

Search Result 32,017, Processing Time 0.056 seconds

A Basic strategy of intermodal transfer information at the railway station (철도역에서의 연계교통 환승정보제공 기본전략)

  • Kim, Young-Hoon
    • Proceedings of the KSR Conference
    • /
    • 2006.11b
    • /
    • pp.1556-1561
    • /
    • 2006
  • The railway station is an important intermodal network point of the railway passengers who use the other transportation means and go to the destination. So at the railway station, the device of various intermodal transfer information is needed to transfer the other transportation means. In this paper, we study the passing characteristics of transfer traffic line of the passengers of railway station and the status of information provision for use of transfer facility and we describe the strategies of information provision according to the necessary intermodal transfer to use the other transportation means.

  • PDF

Sequential Estimation with $\beta$-Protection of the Difference of Two Normal Means When an Imprecision Function Is Variable

  • Kim, Sung-Lai;Kim, Sung-Kyun
    • Journal of the Korean Statistical Society
    • /
    • v.31 no.3
    • /
    • pp.379-389
    • /
    • 2002
  • For two normal distribution with unknown means and unknown variances, a sequential procedure for estimating the difference of two normal means which satisfies both the coverage probability condition and the $\beta$-protection is proposed under some smoothness of variable imprecision function, and the asymptotic normality of the proposed stopping time after some centering and scaling is given.

BERGMAN SPACES, BLOCH SPACES AND INTEGRAL MEANS OF p-HARMONIC FUNCTIONS

  • Fu, Xi;Qiao, Jinjing
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.2
    • /
    • pp.481-495
    • /
    • 2021
  • In this paper, we investigate the properties of Bergman spaces, Bloch spaces and integral means of p-harmonic functions on the unit ball in ℝn. Firstly, we offer some Lipschitz-type and double integral characterizations for Bergman space ��kγ. Secondly, we characterize Bloch space ��αω in terms of weighted Lipschitz conditions and BMO functions. Finally, a Hardy-Littlewood type theorem for integral means of p-harmonic functions is established.

Data classification using K-means clustering (K-means 클러스터링을 이용한 데이터 분류)

  • Lim, Seon-Ja;Youn, Sung-Dae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.11a
    • /
    • pp.1087-1088
    • /
    • 2020
  • 본 논문에서는 특징 추출 분석, 관심 영역을 추출하기 위한 몇 가지 종래의 이미지 전처리 방법과 K-means 클러스터링 및 이미지 분할방법을 통해서 얻어진 결과를 정상적인 세포와 비정상 세포를 추출하는 기법을 제안한다. 그 결과 97.8% 분류로 우수한 성능을 보여주었다.

An Efficient K-means Clustering Algorithm using Prediction (예측을 이용한 효율적인 K-Means 알고리즘)

  • Tae-Chang Jee;Hyunjin Lee;Yillbyung Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.3-4
    • /
    • 2008
  • 본 논문에서 k-means 군집화 알고리즘을 효율적으로 적용하는 방법을 제안했다. 제안하는 알고리즘의 특징을 속도 향상을 위해 예측 데이터를 이용한 것이다. 군집화 알고리즘의 각 단계에서 군집을 변경할 데이터만 최인접 군집을 계산함으로써 계산 시간을 줄일 수 있었다. 제안하는 알고리즘의 성능 비교를 위해서 KMHybrid 와 비교했다. 제안하는 알고리즘은 데이터의 차원이 큰 경우에 KMHybrid 보다 높은 속도 향상을 보였다.

A k-means++ Algorithm for Internet Shopping Search Engine

  • Jian-Ji Ren;Jae-kee Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.75-77
    • /
    • 2008
  • Nowadays, as the indices of the major search engines grow to a tremendous proportion, vertical search services can help customers to find what they need. Search Engine is one of the reasons for Internet shopping success in today's world. The import one part of search engine is clustering data. The objective of this paper is to explore a k-means++ algorithm to calculate the clustering data which in the Internet shopping environment. The experiment results shows that the k-means++ algorithm is a faster algorithm to achieved a good clustering.

Creation of Frequent Patterns using K-means Algorithm for Data Mining Preprocess (데이터 마이닝의 전처리를 위한 K-means 알고리즘을 이용한 빈발패턴 생성)

  • Heui-Jong Yoo;Chi-Yeon Park
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.336-339
    • /
    • 2008
  • 우리가 사용하는 데이터베이스 내에는 많은 양의 데이터 들이 들어 있으며, 계속적으로 그 양은 늘어나고 있다. 이러한 데이터들로부터 질의를 통해 얻을 수 있는 기본적이고 단순한 정보들과 달리 고급 정보를 얻게 해주는 방법이 데이터 마이닝이다. 데이터 마이닝의 기법 중에서 본 논문에서는 k-means 알고리즘을 사용하여 트랜잭션을 클러스터링 함으로써 데이터베이스의 트랜잭션 수를 줄여 연관규칙의 대표적인 알고리즘인 Apriori 알고리즘의 단점인 트랜잭션 스캔으로 인한 성능 저하를 개선하고자 한다.

Bayesian Model Selection for Inverse Gaussian Populations with Heterogeneity

  • Kang, Sang-Gil;Kim, Dal-Ho;Lee, Woo-Dong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.2
    • /
    • pp.621-634
    • /
    • 2008
  • This paper addresses the problem of testing whether the means in several inverse Gaussian populations with heterogeneity are equal. The analysis of reciprocals for the equality of inverse Gaussian means needs the assumption of equal scale parameters. We propose Bayesian model selection procedures for testing equality of the inverse Gaussian means under the noninformative prior without the assumption of equal scale parameters. The noninformative prior is usually improper which yields a calibration problem that makes the Bayes factor to be defined up to a multiplicative constant. So we propose the objective Bayesian model selection procedures based on the fractional Bayes factor and the intrinsic Bayes factor under the reference prior. Simulation study and real data analysis are provided.

  • PDF

Clustering Method of Weighted Preference Using K-means Algorithm and Bayesian Network for Recommender System (추천시스템을 위한 k-means 기법과 베이시안 네트워크를 이용한 가중치 선호도 군집 방법)

  • Park, Wha-Beum;Cho, Young-Sung;Ko, Hyung-Hwa
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.3_spc
    • /
    • pp.219-230
    • /
    • 2013
  • Real time accessiblity and agility in Ubiquitous-commerce is required under ubiquitous computing environment. The Research has been actively processed in e-commerce so as to improve the accuracy of recommendation. Existing Collaborative filtering (CF) can not reflect contents of the items and has the problem of the process of selection in the neighborhood user group and the problems of sparsity and scalability as well. Although a system has been practically used to improve these defects, it still does not reflect attributes of the item. In this paper, to solve this problem, We can use a implicit method which is used by customer's data and purchase history data. We propose a new clustering method of weighted preference for customer using k-means clustering and Bayesian network in order to improve the accuracy of recommendation. To verify improved performance of the proposed system, we make experiments with dataset collected in a cosmetic internet shopping mall.

Change Detection in Bitemporal Remote Sensing Images by using Feature Fusion and Fuzzy C-Means

  • Wang, Xin;Huang, Jing;Chu, Yanli;Shi, Aiye;Xu, Lizhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1714-1729
    • /
    • 2018
  • Change detection of remote sensing images is a profound challenge in the field of remote sensing image analysis. This paper proposes a novel change detection method for bitemporal remote sensing images based on feature fusion and fuzzy c-means (FCM). Different from the state-of-the-art methods that mainly utilize a single image feature for difference image construction, the proposed method investigates the fusion of multiple image features for the task. The subsequent problem is regarded as the difference image classification problem, where a modified fuzzy c-means approach is proposed to analyze the difference image. The proposed method has been validated on real bitemporal remote sensing data sets. Experimental results confirmed the effectiveness of the proposed method.