• Title/Summary/Keyword: Data Partition Algorithm

Search Result 128, Processing Time 0.026 seconds

Meta Analysis of Usability Experimental Research Using New Bi-Clustering Algorithm

  • Kim, Kyung-A;Hwang, Won-Il
    • The Korean Journal of Applied Statistics
    • /
    • v.21 no.6
    • /
    • pp.1007-1014
    • /
    • 2008
  • Usability evaluation(UE) experiments are conducted to provide UE practitioners with guidelines for better outcomes. In UE research, significant quantities of empirical results have been accumulated in the past decades. While those results have been anticipated to integrate for producing generalized guidelines, traditional meta-analysis has limitations to combine UE empirical results that often show considerable heterogeneity. In this study, a new data mining method called weighted bi-clustering(WBC) was proposed to partition heterogeneous studies into homogeneous subsets. We applied the WBC to UE empirical results and identified two homogeneous subsets, each of which can be meta-analyzed. In addition, interactions between experimental conditions and UE methods were hypothesized based on the resulting partition and some interactions were confirmed via statistical tests.

Optimization of Data Recovery using Non-Linear Equalizer in Cellular Mobile Channel (셀룰라 이동통신 채널에서 비선형 등화기를 이용한 최적의 데이터 복원)

  • Choi, Sang-Ho;Ho, Kwang-Chun;Kim, Yung-Kwon
    • Journal of IKEEE
    • /
    • v.5 no.1 s.8
    • /
    • pp.1-7
    • /
    • 2001
  • In this paper, we have investigated the CDMA(Code Division Multiple Access) Cellular System with non-linear equalizer in reverse link channel. In general, due to unknown characteristics of channel in the wireless communication, the distribution of the observables cannot be specified by a finite set of parameters; instead, we partitioned the m-dimensional sample space Into a finite number of disjointed regions by using quantiles and a vector quantizer based on training samples. The algorithm proposed is based on a piecewise approximation to regression function based on quantiles and conditional partition moments which are estimated by Robbins Monro Stochastic Approximation (RMSA) algorithm. The resulting equalizers and detectors are robust in the sense that they are insensitive to variations in noise distributions. The main idea is that the robust equalizers and robust partition detectors yield better performance in equiprobably partitioned subspace of observations than the conventional equalizer in unpartitioned observation space under any condition. And also, we apply this idea to the CDMA system and analyze the BER performance.

  • PDF

Numerical Formula and Verification of Web Robot for Collection Speedup of Web Documents

  • Kim Weon;Kim Young-Ki;Chin Yong-Ok
    • Journal of Internet Computing and Services
    • /
    • v.5 no.6
    • /
    • pp.1-10
    • /
    • 2004
  • A web robot is a software that has abilities of tracking and collecting web documents on the Internet(l), The performance scalability of recent web robots reached the limit CIS the number of web documents on the internet has increased sharply as the rapid growth of the Internet continues, Accordingly, it is strongly demanded to study on the performance scalability in searching and collecting documents on the web. 'Design of web robot based on Multi-Agent to speed up documents collection ' rather than 'Sequentially executing Web Robot based on the existing Fork-Join method' and the results of analysis on its performance scalability is presented in the thesis, For collection speedup, a Multi-Agent based web robot performs the independent process for inactive URL ('Dead-links' URL), which is caused by overloaded web documents, temporary network or web-server disturbance, after dividing them into each agent. The agents consist of four component; Loader, Extractor, Active URL Scanner and inactive URL Scanner. The thesis models a Multi-Agent based web robot based on 'Amdahl's Law' to speed up documents collection, introduces a numerical formula for collection speedup, and verifies its performance improvement by comparing data from the formula with data from experiments based on the formula. Moreover, 'Dynamic URL Partition algorithm' is introduced and realized to minimize the workload of the web server by maximizing a interval of the web server which can be a collection target.

  • PDF

A Genetic Algorithm for the Ship Scheduling Problem (선박운항일정계획 문제의 유전해법)

  • 이희용;김시화
    • Journal of the Korean Institute of Navigation
    • /
    • v.24 no.5
    • /
    • pp.361-371
    • /
    • 2000
  • This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

  • PDF

Fuzzy Rules Generation and Inference System of Scatter Partition Method (분산 분할 방식의 퍼지 규칙 생성 및 추론 시스템)

  • Park, Keon-jun;Jang, Tae-Su;Kim, Sung-Hun;Kim, Yong-kab
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.35-36
    • /
    • 2012
  • The generation of fuzzy rules is inevitable in order to construct fuzzy modeling and in general, has the problem that the number of rules increases exponentially with increasing dimension. To solve this problem, we introduce the system that generate the fuzzy rules and make a inference based on FCM clustering algorithm that partition the input space in the scatter form. The parameters in the premise part of the fuzzy rules is determined as membership matrix by the FCM clustering algorithm and the consequence part of the fuzzy rules is are expressed as a polynomial function. Proposed model evaluated using the numerical data.

  • PDF

Fuzzy inference system and Its Optimization according to partition of Fuzzy input space (퍼지 입력 공간 분할애 따른 퍼지 추론과 이의 최적화)

  • Park, Byoung-Jun;Yoon, Ki-Chan;Oh, Sung-Kwun;Jang, Seong-Whan
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.657-659
    • /
    • 1998
  • In order to optimize fuzzy modeling of nonlinear system, we proposed a optimal fuzzy model according to the characteristic of I/O relationship, HCM method, the genetic algorithm, and the objective function with weighting factor. A conventional fuzzy model has difficulty in definition of membership function. In order to solve its problem, the premise structure of the proposed fuzzy model is selected by both the partition of input space and the analysis of input-output relationship using the clustering algorithm. The premise parameters of the fuzzy model are optimized respectively by the genetic algorithm and the consequence parameters of the fuzzy model are identified by the standard least square method. Also, the objective function with weighting factor is proposed to achieve a balance between the performance results for the training and testing data.

  • PDF

A New Fuzzy Modeling Algorithm Considering Correlation among Components of Input Data (입력 공간의 변환을 이용한 새로운 방식의 퍼지 모델링)

  • 김은태;박민기;박민용
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.111-114
    • /
    • 1997
  • Generally, fuzzy models have the capability of dividing input space into several subspaces. compared to liner ones. But hitherto suggested fuzzy modeling algorithms not take into consideration the correlations between components of sample input data and address them independently of each other, which results in ineffective partition of input space. Therefore, to solve this problem. this letter proposes a new fuzzy modeling algorithm which partitions the input space more efficiently than conventional methods by taking into consideration correlations between components of sample data. As a way to use correlation and divide the input space. the method of principal component is used. Finally, the results of computer simulation are given to demonstrate the validity of this algorithm.

  • PDF

An Efficient Algorithm for Mining Frequent Sequences In Spatiotemporal Data

  • Vhan Vu Thi Hong;Chi Cheong-Hee;Ryu Keun-Ho
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2005.11a
    • /
    • pp.61-66
    • /
    • 2005
  • Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

  • PDF

Error resilience video coding of DMB video stream using Data partitioning method. (데이터 분할방식 적용에 따른 DMB 비디오 스트림의 오류내성부호화)

  • 백선혜;나남웅;홍성훈;이봉호;함영권
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.275-278
    • /
    • 2003
  • Terrestrial DMB(Digital Multimedia Broadcasting) system is the standard that offers multimedia broadcasting services at mobile environment and is based on Eureka-147 DAB(Digital Audio Broadcasting) for transmission method. Also DMB provides the error protection method of convolution coding. In this paper, we study on the effective error resilience coding of MPEG-4 video stream over DMB system. To accomplish error resilience, we first partition one data into several data using the data partitioning, and we control the coding rate of the convolution coding according to the importance of the partitioned data. In this algorithm, we suggest and analyze the efficient rate control algorithm considering convolution code rate.

  • PDF

Error resilience video coding of DMB video stream using Data partitioning method. (데이터 분할방식 적용에 따른 DMB 비디오 스트림의 오류내성부호화)

  • 백선혜;나남웅;홍성훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.279-282
    • /
    • 2003
  • Terrestrial DMB(Digital Multimedia Broadcasting) system is the standard that offers multimedia broadcasting services at mobile environment and is based on Eureka-147 DAB(Digital Audio Broadcasting) for transmission method. Also DMB provides the error protection method of convolution coding. In this paper, we study on the effective error resilience coding of MPEG-4 video stream over DMB system. To accomplish error resilience, we first partition one data into several data using the data partitioning, and we control the coding rate of the convolution coding according to the importance of the partitioned data. In this algorithm, we suggest and analyze the efficient rate control algorithm considering convolution code rate.

  • PDF