• 제목/요약/키워드: sequential data

Search Result 1,105, Processing Time 0.029 seconds

A Study of Dependent Nonstationary Multiple Sampling Plans (종속적 비평형 다중표본 계획법의 연구)

  • 김원경
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.2
    • /
    • pp.75-87
    • /
    • 2000
  • In this paper, nonstationary multiple sampling plans are discussed which are difficult to solve by analytical method when there exists dependency between the sample data. The initial solution is found by the sequential sampling plan using the sequential probability ration test. The number of acceptance and rejection in each step of the multiple sampling plan are found by grouping the sequential sampling plan's solution initially. The optimal multiple sampling plans are found by simulation. Four search methods are developed U and the optimum sampling plans satisfying the Type I and Type ll error probabilities. The performance of the sampling plans is measured and their algorithms are also shown. To consider the nonstationary property of the dependent sampling plan, simulation method is used for finding the lot rejection and acceptance probability function. As a numerical example Markov chain model is inspected. Effects of the dependency factor and search methods are compared to analyze the sampling results by changing their parameters.

  • PDF

Fast Training of Structured SVM Using Fixed-Threshold Sequential Minimal Optimization

  • Lee, Chang-Ki;Jang, Myung-Gil
    • ETRI Journal
    • /
    • v.31 no.2
    • /
    • pp.121-128
    • /
    • 2009
  • In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for structured SVM problems. FSMO is conceptually simple, easy to implement, and faster than the standard support vector machine (SVM) training algorithms for structured SVM problems. Because FSMO uses the fact that the formulation of structured SVM has no bias (that is, the threshold b is fixed at zero), FSMO breaks down the quadratic programming (QP) problems of structured SVM into a series of smallest QP problems, each involving only one variable. By involving only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection. For the various test sets, FSMO is as accurate as an existing structured SVM implementation (SVM-Struct) but is much faster on large data sets. The training time of FSMO empirically scales between O(n) and O($n^{1.2}$), while SVM-Struct scales between O($n^{1.5}$) and O($n^{1.8}$).

  • PDF

Fixed-accuracy confidence interval estimation of P(X > c) for a two-parameter gamma population

  • Zhuang, Yan;Hu, Jun;Zou, Yixuan
    • Communications for Statistical Applications and Methods
    • /
    • v.27 no.6
    • /
    • pp.625-639
    • /
    • 2020
  • The gamma distribution is a flexible right-skewed distribution widely used in many areas, and it is of great interest to estimate the probability of a random variable exceeding a specified value in survival and reliability analysis. Therefore, the study develops a fixed-accuracy confidence interval for P(X > c) when X follows a gamma distribution, Γ(α, β), and c is a preassigned positive constant through: 1) a purely sequential procedure with known shape parameter α and unknown rate parameter β; and 2) a nonparametric purely sequential procedure with both shape and rate parameters unknown. Both procedures enjoy appealing asymptotic first-order efficiency and asymptotic consistency properties. Extensive simulations validate the theoretical findings. Three real-life data examples from health studies and steel manufacturing study are discussed to illustrate the practical applicability of both procedures.

Wi-Fi Fingerprint-based Indoor Movement Route Data Generation Method (Wi-Fi 핑거프린트 기반 실내 이동 경로 데이터 생성 방법)

  • Yoon, Chang-Pyo;Hwang, Chi-Gon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.05a
    • /
    • pp.458-459
    • /
    • 2021
  • Recently, researches using deep learning technology based on Wi-Fi fingerprints have been conducted for accurate services in indoor location-based services. Among the deep learning models, an RNN model that can store information from the past can store continuous movements in indoor positioning, thereby reducing positioning errors. At this time, continuous sequential data is required as training data. However, since Wi-Fi fingerprint data is generally managed only with signals for a specific location, it is inappropriate to use it as training data for an RNN model. This paper proposes a path generation method through prediction of a moving path based on Wi-Fi fingerprint data extended to region data through clustering to generate sequential input data of the RNN model.

  • PDF

CDMA/TDD system using improved sequential decoding algorithm (개선된 순차적 복호 기법을 적용한 CDMA/TDD 시스템의 성능 분석)

  • Jo, Seong-Cheol;Gwon, Dong-Seung;Jo, Gyeong-Rok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.8
    • /
    • pp.1-6
    • /
    • 2002
  • In this paper, we considered the CDMA/TDD system suitable for high-speed packet data transmission such as Internet and multimedia services, and a sequential decoding scheme which enables fast decoding and retransmission requirement. In addition, we Proposed an improved FANO algorithm, which adopts the competition path in order to reduce the number of revisit nodes. The conventional FANO algorithm suffered from the drawback of much more revisit nodes. Furthermore, we analyzed the performance of the CDMA/TDD system with the sequential decoding scheme we proposed over multipath channel.

A Study of Selecting Sequential Viewpoint and Examining the Effectiveness of Omni-directional Angle Image Information in Grasping the Characteristics of Landscape (경관 특성 파악에 있어서의 시퀀스적 시점장 선정과 전방위 화상정보의 유효성 검증에 관한 연구)

  • Kim, Heung Man;Lee, In Hee
    • KIEAE Journal
    • /
    • v.9 no.2
    • /
    • pp.81-90
    • /
    • 2009
  • Relating to grasping sequential landscape characteristics in consideration of the behavioral characteristics of the subject experiencing visual perception, this study was made on the subject of main walking line section for visitors of three treasures of Buddhist temples. Especially, as a method of obtaining data for grasping sequential visual perception landscape, the researcher employed [momentum sequential viewpoint setup] according to [the interval of pointers arbitrarily] and fisheye-lens-camera photography using the obtained omni-directional angle visual perception information. As a result, in terms of viewpoint selection, factors like approach road form, change in circulation axis, change in the ground surface level, appearance of objects, etc. were verified to make effect, and among these, approach road form and circulation axis change turned out to be the greatest influences. In addition, as a result of reviewing the effectiveness via the subjects, for the sake of qualitative evaluation of landscape components using the VR picture image obtained in the process of acquiring omni-directional angle visual perception information, a positive result over certain values was earned in terms of panoramic vision, scene reproduction, three-dimensional perspective, etc. This convinces us of the possibility to activate the qualitative evaluation of omni-directional angle picture information and the study of landscape through it henceforth.

A study on sequential iterative learning for overcoming catastrophic forgetting phenomenon of artificial neural network (인공 신경망의 Catastrophic forgetting 현상 극복을 위한 순차적 반복 학습에 대한 연구)

  • Choi, Dong-bin;Park, Young-beom
    • Journal of Platform Technology
    • /
    • v.6 no.4
    • /
    • pp.34-40
    • /
    • 2018
  • Currently, artificial neural networks perform well for a single task, but NN have the problem of forgetting previous learning by learning other kinds of tasks. This is called catastrophic forgetting. To use of artificial neural networks in general purpose this should be solved. There are many efforts to overcome catastrophic forgetting. However, even though there was a lot of effort, it did not completely overcome the catastrophic forgetting. In this paper, we propose sequential iterative learning using core concepts used in elastic weight consolidation (EWC). The experiment was performed to reproduce catastrophic forgetting phenomenon using EMNIST data set which extended MNIST, which is widely used for artificial neural network learning, and overcome it through sequential iterative learning.

Deep Learning Framework with Convolutional Sequential Semantic Embedding for Mining High-Utility Itemsets and Top-N Recommendations

  • Siva S;Shilpa Chaudhari
    • Journal of information and communication convergence engineering
    • /
    • v.22 no.1
    • /
    • pp.44-55
    • /
    • 2024
  • High-utility itemset mining (HUIM) is a dominant technology that enables enterprises to make real-time decisions, including supply chain management, customer segmentation, and business analytics. However, classical support value-driven Apriori solutions are confined and unable to meet real-time enterprise demands, especially for large amounts of input data. This study introduces a groundbreaking model for top-N high utility itemset mining in real-time enterprise applications. Unlike traditional Apriori-based solutions, the proposed convolutional sequential embedding metrics-driven cosine-similarity-based multilayer perception learning model leverages global and contextual features, including semantic attributes, for enhanced top-N recommendations over sequential transactions. The MATLAB-based simulations of the model on diverse datasets, demonstrated an impressive precision (0.5632), mean absolute error (MAE) (0.7610), hit rate (HR)@K (0.5720), and normalized discounted cumulative gain (NDCG)@K (0.4268). The average MAE across different datasets and latent dimensions was 0.608. Additionally, the model achieved remarkable cumulative accuracy and precision of 97.94% and 97.04% in performance, respectively, surpassing existing state-of-the-art models. This affirms the robustness and effectiveness of the proposed model in real-time enterprise scenarios.

Flood Routing of Sequential Failure of Dams by Numerical Model (수치모형을 이용한 순차적 댐 붕괴 모의)

  • Park, Se Jin;Han, Kun Yeun;Choi, Hyun Gu
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.5
    • /
    • pp.1797-1807
    • /
    • 2013
  • Dams always have the possibility of failure due to unexpected natural phenomena. In particular, dam failure can cause huge damage including damage for humans and properties when dam downstream regions are densely populated or have important national facilities. Although many studies have been conducted on the analysis of flood waves about single dam failure thus far, studies on the analysis of flood waves about the sequential failure of dams are lacking. Therefore, the purpose of this study was to calculate the peak discharge of sequential failure of dams through flood wave analysis of sequential failure of dams and this analysis techniques to predict flood wave propagation situation in downstream regions. To this end, failure flood wave analysis were conducted for Lawn Lake Dam which is a case of sequential failure of dams among actual failure cases using DAMBRK to test the suitability of the dam failure flood wave analysis model. Based on the results, flood wave analysis of sequential failure of dams were conducted for A dam in Korea assuming a virtual extreme flood to predict flood wave propagation situations and 2-dimensional flood wave analysis were conducted for major flooding points. Then, the 1, 2-dimensional flood wave analysis were compared and analyzed. The results showed goodness-of-fit values exceeding 90% and thus the accuracy of the 1-dimensional sequential failure of dams simulation could be identified. The results of this study are considered to be able to contribute to the provision of basic data for the establishment of disaster prevention measures for rivers related to sequential failure of dams.

A Survey on Neural Networks Using Memory Component (메모리 요소를 활용한 신경망 연구 동향)

  • Lee, Jihwan;Park, Jinuk;Kim, Jaehyung;Kim, Jaein;Roh, Hongchan;Park, Sanghyun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.8
    • /
    • pp.307-324
    • /
    • 2018
  • Recently, recurrent neural networks have been attracting attention in solving prediction problem of sequential data through structure considering time dependency. However, as the time step of sequential data increases, the problem of the gradient vanishing is occurred. Long short-term memory models have been proposed to solve this problem, but there is a limit to storing a lot of data and preserving it for a long time. Therefore, research on memory-augmented neural network (MANN), which is a learning model using recurrent neural networks and memory elements, has been actively conducted. In this paper, we describe the structure and characteristics of MANN models that emerged as a hot topic in deep learning field and present the latest techniques and future research that utilize MANN.