• Title/Summary/Keyword: hierarchical data

Search Result 3,012, Processing Time 0.028 seconds

Hierarchical Bayesian Analysis of Spatial Data with Application to Disease Mapping

  • Kim, Dal-Ho;Kang, Sang-Gil
    • Communications for Statistical Applications and Methods
    • /
    • v.6 no.3
    • /
    • pp.781-790
    • /
    • 1999
  • In this paper we consider estimation of cancer incidence rates for local areas. The raw estimates usually are based on small sample sizes and hence are usually unreliable. A hierarchical Bayes generalized linear model is used which connects the local areas thereby enabling one to 'borrow strength' Random effects with pairwise difference priors model the spatial structure in the data. The methods are applied to cancer incidence estimation for census tracts in a certain region of the state of New York.

  • PDF

Confidence Intervals for the Difference of Binomial Proportions in Two Doubly Sampled Data

  • Lee, Seung-Chun
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.3
    • /
    • pp.309-318
    • /
    • 2010
  • The construction of asymptotic confidence intervals is considered for the difference of binomial proportions in two doubly sampled data subject to false-positive error. The coverage behaviors of several likelihood based confidence intervals and a Bayesian confidence interval are examined. It is shown that a hierarchical Bayesian approach gives a confidence interval with good frequentist properties. Confidence interval based on the Rao score is also shown to have good performance in terms of coverage probability. However, the Wald confidence interval covers true value less often than nominal level.

A development of input and output interfaces for fuzzy hierarchical analysis

  • Kwack, H.Y.;Lee, S.D.;Son, I.M.
    • Proceedings of the ESK Conference
    • /
    • 1996.10a
    • /
    • pp.181-184
    • /
    • 1996
  • Fuzzy hierarchical analysis(FHA) has the usefulness to allow decision maker's ambiguities when comparing two alternatives. But, for easiuly appling it to a decision problem, the handling its many data and for decision makers much not knowing fuzzy theory are the obstacles to must be overcomed even if the results of final fuzzy weights can be computed by a personal computer. This paper decribes that FHA is revised, and input/output interfaces are developed to collect input data easily and interprete the fuzzy resultlts. Finally, a fuzzy decision process is suggested with them.

  • PDF

Topology Aggregation for Hierarchical Wireless Tactical Networks

  • Pak, Woo-Guil;Choi, Young-June
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.344-358
    • /
    • 2011
  • Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

Assessment of Effects of Predictors on the Corporate Bankruptcy Using Hierarchical Bayesian Dynamic Model

  • Sung Min-Je;Cho Sung-Bin
    • Management Science and Financial Engineering
    • /
    • v.12 no.1
    • /
    • pp.65-77
    • /
    • 2006
  • This study proposes a Bayesian dynamic model in a hierarchical way to assess the time-varying effect of risk factors on the likelihood of corporate bankruptcy. For the longitudinal data, we aim to describe dynamically evolving effects of covariates more articulately compared to the Generalized Estimating Equation approach. In the analysis, it is shown that the proposed model outperforms in terms of sensitivity and specificity. Besides, the usefulness of this study can be found from the flexibility in describing the dependence structure among time specific parameters and suitability for assessing the time effect of risk factors.

Agglomerative Hierarchical Clustering Analysis with Deep Convolutional Autoencoders (합성곱 오토인코더 기반의 응집형 계층적 군집 분석)

  • Park, Nojin;Ko, Hanseok
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.1
    • /
    • pp.1-7
    • /
    • 2020
  • Clustering methods essentially take a two-step approach; extracting feature vectors for dimensionality reduction and then employing clustering algorithm on the extracted feature vectors. However, for clustering images, the traditional clustering methods such as stacked auto-encoder based k-means are not effective since they tend to ignore the local information. In this paper, we propose a method first to effectively reduce data dimensionality using convolutional auto-encoder to capture and reflect the local information and then to accurately cluster similar data samples by using a hierarchical clustering approach. The experimental results confirm that the clustering results are improved by using the proposed model in terms of clustering accuracy and normalized mutual information.

Hierarchical Structured Multi-agent for Distributed Databases in Location Based Services

  • Mateo Romeo Mark A.;Lee Jaewan;Kwon Oh-Hyun
    • The Journal of Information Systems
    • /
    • v.14 no.3
    • /
    • pp.17-22
    • /
    • 2005
  • Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

  • PDF

A Neuro-Fuzzy Modeling using the Hierarchical Clustering and Gaussian Mixture Model (계층적 클러스터링과 Gaussian Mixture Model을 이용한 뉴로-퍼지 모델링)

  • Kim, Sung-Suk;Kwak, Keun-Chang;Ryu, Jeong-Woong;Chun, Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.5
    • /
    • pp.512-519
    • /
    • 2003
  • In this paper, we propose a neuro-fuzzy modeling to improve the performance using the hierarchical clustering and Gaussian Mixture Model(GMM). The hierarchical clustering algorithm has a property of producing unique parameters for the given data because it does not use the object function to perform the clustering. After optimizing the obtained parameters using the GMM, we apply them as initial parameters for Adaptive Network-based Fuzzy Inference System. Here, the number of fuzzy rules becomes to the cluster numbers. From this, we can improve the performance index and reduce the number of rules simultaneously. The proposed method is verified by applying to a neuro-fuzzy modeling for Box-Jenkins s gas furnace data and Sugeno's nonlinear system, which yields better results than previous oiles.

Construction of a Remote Monitoring System in Smart Dust Environment

  • Park, Joonsuu;Park, KeeHyun
    • Journal of Information Processing Systems
    • /
    • v.16 no.3
    • /
    • pp.733-741
    • /
    • 2020
  • A smart dust monitoring system is useful for obtaining information on rough terrain that is difficult for humans to access. One of ways to deploy sensors to gather information in smart dust environment is to use an aircraft in the Amazon rainforest to scatter an enormous amount of small and cheap sensors (or smart dust devices), or to use an unmanned spacecraft to throw the sensors on the moon's surface. However, scattering an enormous amount of smart dust devices creates the difficulty of managing such devices as they can be scattered into inaccessible areas, and also causes problems such as bottlenecks, device failure, and high/low density of devices. Of the various problems that may occur in the smart dust environment, this paper is focused on solving the bottleneck problem. To address this, we propose and construct a three-layered hierarchical smart dust monitoring system that includes relay dust devices (RDDs). An RDD is a smart dust device with relatively higher computing/communicating power than a normal smart dust device. RDDs play a crucial role in reducing traffic load for the system. To validate the proposed system, we use climate data obtained from authorized portals to compare the system with other systems (i.e., non-hierarchical system and simple hierarchical system). Through this comparison, we determined that the transmission processing time is reduced by 49%-50% compared to other systems, and the maximum number of connectable devices can be increased by 16-32 times without compromising the system's operations.

A Study on Hierarchical Distributed Intrusion Detection for Secure Home Networks Service (안전한 홈네트워크 서비스를 위한 계층적 분산 침입탐지에 관한 연구)

  • Yu, Jae-Hak;Choi, Sung-Back;Yang, Sung-Hyun;Park, Dai-Hee;Chung, Yong-Wha
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.1
    • /
    • pp.49-57
    • /
    • 2008
  • In this paper, we propose a novel hierarchical distributed intrusion detection system, named HNHDIDS(Home Network Hierarchical Distributed Intrusion Detection System), which is not only based on the structure of distributed intrusion detection system, but also fully consider the environment of secure home networks service. The proposed system is hierarchically composed of the one-class support vector machine(support vector data description) and local agents, in which it is designed for optimizing for the environment of secure home networks service. We support our findings with computer experiments and analysis.