• Title/Summary/Keyword: Generalization

Search Result 2,133, Processing Time 0.024 seconds

A study on the completeness of 'the understanding' in the generalization process and justification - centered on the arithmetical, geometric and harmonic average - (일반화 과정과 그 정당화에서 '이해'의 완전성에 대한 연구 - 산술, 기하, 조화평균을 중심으로)

  • Kim, ChangSu
    • The Mathematical Education
    • /
    • v.51 no.4
    • /
    • pp.377-393
    • /
    • 2012
  • The understanding demands the different degree of the understanding according to student's learning situation. In this paper, we investigate what is the foundation for the complete understanding for the generalization in the generalization-process and justification of some concepts or some theories, through a case. We discovered that the completeness of the understanding in the generalization-process and justification requires 'the meaningful-mental object' which can give the meaning about the concept or theory to students. Students can do the generalization-process through the construction of 'the meaningful-mental object' and confirm the validity of generalization through 'the meaningful-mental object' which is constructed by them. And we can judge the whether students construct the completeness of the understanding or not, by 'the meaningful-mental object' of the student. Hence 'the meaningful-mental object' are vital condition for the generalization-process and justification.

The alignment between contextual and model generalization: An application with PISA 2015

  • Wan Ren;Wendy Chan
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.5
    • /
    • pp.467-485
    • /
    • 2024
  • Policymakers and educational researchers have grown increasingly interested in the extent to which study results generalize across different groups of students. Current generalization research in education has largely focused on the compositional similarity among students based on a set of observable characteristics. However, generalization is defined differently across various disciplines. While the concept of compositional similarity is prominent in causal research, generalization among the statistical learning community refers to the extent to which a model produces accurate predictions across samples and populations. The purpose of this study is to assess the extent to which concepts related to contextual generalization (based on compositional similarity) are associated with the ideas related to model generalization (based on accuracy of prediction). We use observational data from the Programme for International Student Assessment (PISA) 2015 wave as a case study to examine the conditions under which contextual and model generalization are aligned. We assess the correlations between statistical measures that quantify compositional similarity and prediction accuracy and discuss the implications for generalization research.

The Theoretical Generalization Appling the Strategy(WIOS) finding an Intrinsic Attribute (본질적 속성 찾기 전략(WIOS)을 통한 이론적 일반화)

  • Roh, Eun-Hwan;Jun, Young-Bae;Kang, Jeong-Gi
    • Communications of Mathematical Education
    • /
    • v.26 no.1
    • /
    • pp.51-69
    • /
    • 2012
  • The cognition of an intrinsic attribute play an important role in the process of theoretical generalization. It is the aim of this paper to study how the theoretical generalization is made. First of all, we suggest the What-if-only-strategy(WIOS) which is the strategy helping the cognition of an intrinsic attribute. And we propose the process of the theoretical generalization that go on the cognitive stage, WIOS stage, conjecture stage, justification stage and insight into an intrinsic attribute in order. We propose the process of generalization adding the concrete process cognizing an intrinsic attribute to the existing process of generalization. And we applied the proposed process of generalization to two mathematical theorem which is being managed in middle school. We got a conclusion that the what-if-only strategy is an useful method of generalization for the proposition. We hope that the what-if-only strategy is helpful for both teaching and learning the mathematical generalization.

The LR-Tree : A spatial indexing of spatial data supporting map generalization (LR 트리 : 지도 일반화를 지원하는 공간 데이터를 위한 공간 인덱싱)

  • Gwon, Jun-Hui;Yun, Yong-Ik
    • The KIPS Transactions:PartD
    • /
    • v.9D no.4
    • /
    • pp.543-554
    • /
    • 2002
  • GIS (Geographic Information Systems) need faster access and better visualization. For faster access and better visualization in GIS, map generalization and levels of detail are needed. Existing spatial indexing methods do not support map generalization. Also, a few existing spatial indexing methods supporting map generalization do not support ail map generalization operations. We propose a new index structure, i.e. the LR-tree, supporting ail map generalization operations. This paper presents algorithms for the searching and updating the LR-tree and the results of performance evaluation. Our index structure works better than other spatial indexing methods for map generalization.

Comparative Study of Map Generalization Algorithms with Different Tolerances (임계치 설정에 따른 지도 일반화 기법의 성능 비교 연구)

  • Lee, Jae-Eun;Park, Woo-Jin;Yu, Ki-Yun
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2010.04a
    • /
    • pp.19-21
    • /
    • 2010
  • In this study, regarding to the generalization of the map, we analyze how the different tolerances influence on the performances of linear generalization operators. For the analysis, we apply the generalization operators, especially two simplification algorithms provided in the commercial GIS software, to 1:1000 digital topographic map for analyzing the aspect of the changes in positional error depending on the tolerances. And we evaluate the changes in positional error with the quantitative assessments. The results show that the analysis can be used as the criteria for determining proper tolerance in linear generalization.

  • PDF

MARGIN-BASED GENERALIZATION FOR CLASSIFICATIONS WITH INPUT NOISE

  • Choe, Hi Jun;Koh, Hayeong;Lee, Jimin
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.2
    • /
    • pp.217-233
    • /
    • 2022
  • Although machine learning shows state-of-the-art performance in a variety of fields, it is short a theoretical understanding of how machine learning works. Recently, theoretical approaches are actively being studied, and there are results for one of them, margin and its distribution. In this paper, especially we focused on the role of margin in the perturbations of inputs and parameters. We show a generalization bound for two cases, a linear model for binary classification and neural networks for multi-classification, when the inputs have normal distributed random noises. The additional generalization term caused by random noises is related to margin and exponentially inversely proportional to the noise level for binary classification. And in neural networks, the additional generalization term depends on (input dimension) × (norms of input and weights). For these results, we used the PAC-Bayesian framework. This paper is considering random noises and margin together, and it will be helpful to a better understanding of model sensitivity and the construction of robust generalization.

Rules for Control Propagation of Geospatial Data Generalization (공간데이터 일반화의 파급을 처리하기 위한 규칙)

  • Kang, He-Gyoung;Li, Ki-Joune
    • Journal of Korea Spatial Information System Society
    • /
    • v.4 no.1 s.7
    • /
    • pp.5-14
    • /
    • 2002
  • The generalization of geospatial data is an important way in deriving a new database from an original one. The generalization of a geospatial object changes not only its geometric and aspatial attributes but also results in propagation to other objects along their relationship. We call it generalization propagation of geospatial databases. Without proper handling of the propagation, it brings about an inconsistent database or loss of semantics. Nevertheless, previous studies in the generalization have focused on the derivation of an object by isolating it from others. And they have proposed a set of generalization operators, which were intended to change the geometric and aspatial attributes of an object. In this paper we extend the definition of generalization operators to cover the propagation from an object to others. In order to capture the propagation, we discover a set of rules or constraints that must be taken into account during generalization procedure. Each generalization operator with constraints is expressed in relational algebra and it can be converted to SQL statements with ease. A prototype system was developed to verify the correctness of extended operators.

  • PDF

Dynamic Generation Methods of the Wireless Map Database using Generalization and Filtering (Generalization과 Filtering을 이용한 무선 지도 데이터베이스의 동적 생성 기법)

  • Kim, Mi-Ran;Choe, Jin-O
    • The KIPS Transactions:PartD
    • /
    • v.8D no.4
    • /
    • pp.367-376
    • /
    • 2001
  • For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.

  • PDF

Examining the Students' Generalization Method in Relation with the Forms of Pattern - Focused on the 6th Grade Students - (패턴의 유형에 따른 학생들의 일반화 방법 조사 - 초등학교 6학년 학생들을 중심으로 -)

  • Lee, Muyng-Gi;Na, Gwi-Soo
    • School Mathematics
    • /
    • v.14 no.3
    • /
    • pp.357-375
    • /
    • 2012
  • This research intends to examine how 6th graders (age 12) generalize various increasing patterns. In this research, 6 problems corresponding to the ax, x+a, ax+c, ax2, and ax2+c patterns were given to 290 students. Students' generalization methods were analysed by the generalization level suggested by Radford(2006), such as arithmetic and algebraic (factual, contextual, and symbolic) generalization. As the results of the study, we identified that students revealed the most high performance in the ax pattern in the aspect of the algebraic generalization, and lower performance in the ax2, x+a, ax+c, ax2+c in order. Also we identified that students' generalization methods differed in the same increasing patterns. This imply that we need to provide students with the pattern generalization activities in various contexts.

  • PDF

Mobile Vector Map Generalization Methods for Location Information Search

  • Choi, Jin-Oh
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.187-191
    • /
    • 2008
  • In the mobile environments for the vector map services, a map simplification work through the map generalization steps helps improve the readability of the map on a large scale. The generalization operations are various such as selection, aggregation, simplification, displacement, and so on, the formal operation algorithms have not been built yet. Because the algorithms require deep special knowledge and heuristic, which make it hard to automate the processes. This thesis proposes some map generalization algorithms specialized in mobile vector map services, based on previous works. This thesis will show the detail to adapt the approaches on the mobile environment, to display complex spatial objects efficiently on the mobile devices which have restriction on the resources.