• Title/Summary/Keyword: unbounded support

Search Result 9, Processing Time 0.021 seconds

SHAPE PRESERVING ADDITIONS OF LR-FUZZY INTERVALS WITH UNBOUNDED SUPPORT

  • Hong, Dug-Hun
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1049-1059
    • /
    • 2009
  • Continuous t-norm based shape preserving additions of LR-fuzzy intervals with unbounded support is studied. The case for bounded support, which was a conjecture suggested by Mesiar in 1997, was proved by the author in 2002 and 2008. In this paper, we give a necessary and sufficient conditions for a continuous t-norm T that induces DR-shape preserving addition of LR-fuzzy intervals with unbounded support. Some of the results can be deduced from the results given in the paper of Mesiar in 1997. But, we give direct proofs of the results.

  • PDF

Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams

  • Kim, Young-Hee;Kim, Won-Young;Kim, Ung-Mo
    • Journal of Information Processing Systems
    • /
    • v.6 no.1
    • /
    • pp.79-90
    • /
    • 2010
  • A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Data mining over data streams should support the flexible trade-off between processing time and mining accuracy. In many application areas, mining frequent itemsets has been suggested to find important frequent itemsets by considering the weight of itemsets. In this paper, we present an efficient algorithm WSFI (Weighted Support Frequent Itemsets)-Mine with normalized weight over data streams. Moreover, we propose a novel tree structure, called the Weighted Support FP-Tree (WSFP-Tree), that stores compressed crucial information about frequent itemsets. Empirical results show that our algorithm outperforms comparative algorithms under the windowed streaming model.

A note on T-sum of bell-shaped fuzzy intervals

  • Hong, Dug-Hun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.6
    • /
    • pp.804-806
    • /
    • 2007
  • The usual arithmetic operations on real numbers can be extended to arithmetical operations on fuzzy intervals by means of Zadeh's extension principle based on a t-norm T. Dombi and Gyorbiro proved that addition is closed if the Dombi t-norm is used with two bell-shaped fuzzy intervals. Recently, Hong [Fuzzy Sets and Systems 158(2007) 739-746] defined a broader class of bell-shaped fuzzy intervals. Then he study t-norms which are consistent with these particular types of fuzzy intervals as applications of a result proved by Mesiar on a strict f-norm based shape preserving additions of LR-fuzzy intervals with unbounded support. In this note, we give a direct proof of the main results of Hong.

T-sum of bell-shaped fuzzy intervals

  • Hong, Dug-Hun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.11a
    • /
    • pp.81-95
    • /
    • 2006
  • The usual arithmetic operations on real numbers can be extended to arithmetical operations on fuzzy intervals by means of Zadeh's extension principle based on a t-norm T. A t-norm is called consistent with respect to a class of fuzzy intervals for some arithmetic operation if this arithmetic operation is closed for this class. It is important to know which t-norms are consistent with a particular type of fuzzy intervals. Recently Dombi and Gyorbiro proved that addition is closed if the Dombi t-norm is used with two bell-shaped fuzzy intervals. A result proved by Mesiar on a strict t-norm based shape preserving additions of LR-fuzzy intervals with unbounded support is recalled. As applications, we define a broader class of bell-shaped fuzzy intervals. Then we study t-norms which are consistent with these particular types of fuzzy intervals. Dombi and Gyorbiro's results are special cases of the results described in this paper.

  • PDF

A Framework for Semantic Interpretation of Noun Compounds Using Tratz Model and Binary Features

  • Zaeri, Ahmad;Nematbakhsh, Mohammad Ali
    • ETRI Journal
    • /
    • v.34 no.5
    • /
    • pp.743-752
    • /
    • 2012
  • Semantic interpretation of the relationship between noun compound (NC) elements has been a challenging issue due to the lack of contextual information, the unbounded number of combinations, and the absence of a universally accepted system for the categorization. The current models require a huge corpus of data to extract contextual information, which limits their usage in many situations. In this paper, a new semantic relations interpreter for NCs based on novel lightweight binary features is proposed. Some of the binary features used are novel. In addition, the interpreter uses a new feature selection method. By developing these new features and techniques, the proposed method removes the need for any huge corpuses. Implementing this method using a modular and plugin-based framework, and by training it using the largest and the most current fine-grained data set, shows that the accuracy is better than that of previously reported upon methods that utilize large corpuses. This improvement in accuracy and the provision of superior efficiency is achieved not only by improving the old features with such techniques as semantic scattering and sense collocation, but also by using various novel features and classifier max entropy. That the accuracy of the max entropy classifier is higher compared to that of other classifiers, such as a support vector machine, a Na$\ddot{i}$ve Bayes, and a decision tree, is also shown.

Trajectory Data Warehouses: Design and Implementation Issues

  • Orlando, Salvatore;Orsini, Renzo;Raffaeta, Alessandra;Roncato, Alessandro;Silvestri, Claudio
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.2
    • /
    • pp.211-232
    • /
    • 2007
  • In this paper we investigate some issues and solutions related to the design of a Data Warehouse (DW), storing several aggregate measures about trajectories of moving objects. First we discuss the loading phase of our DW which has to deal with overwhelming streams of trajectory observations, possibly produced at different rates, and arriving in an unpredictable and unbounded way. Then, we focus on the measure presence, the most complex measure stored in our DW. Such a measure returns the number of distinct trajectories that lie in a spatial region during a given temporal interval. We devise a novel way to compute an approximate, but very accurate, presence aggregate function, which algebraically combines a bounded amount of measures stored in the base cells of the data cube. We conducted many experiments to show the effectiveness of our method to compute such an aggregate function. In addition, the feasibility of our innovative trajectory DW was validated with an implementation based on Oracle. We investigated the most challenging issues in realizing our trajectory DW using standard DW technologies: namely, the preprocessing and loading phase, and the aggregation functions to support OLAP operations.

Design and Implementation of Storage Manager for Real-Time Compressed Storing of Large Volume Datastream (대용량 데이터스트림 실시간 압축 저장을 위한 저장관리자 설계 및 구현)

  • Lee, Dong-Wook;Baek, Sung-Ha;Kim, Gyoung-Bae;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.31-39
    • /
    • 2009
  • Requirement level regarding processing and managing real-time datastream in an ubiquitous environment is increased. Especially, due to the unbounded, high frequency and real-time characteristics of datastream, development of specialized stroge manager for DSMS is necessary to process such datastream. Existing DSMS, e.g. Coral8, can support datastream processing but it is not scalable and cannot perform well when handling large-volume real-time datastream, e.g. 100 thousand over per second. In the case of Oracle10g, which is generally used in related field, it supports storing and management processing. However, it does not support real-time datastream processing. In this paper, we propose specialized storage manager of DSMS for real-time compressed storing on semiconductor or LCD production facility of Samsung electronics, Hynix and HP. Hynix and HP. This paper describes the proposed system architecture and major components and show better performance of the proposed system compared with similar systems in the experiment section.

  • PDF

Parameter Analysis for Design of Pretension Girder Bridge for Urban Maglev Transit (도시형 자기부상열차 프리텐션 거더교의 설계변수 분석)

  • Lee, Jae-Ho;Kim, Do-Hak;Kim, Seung-Hyun;Kim, Sung-Il
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.4
    • /
    • pp.515-525
    • /
    • 2016
  • Parameter analysis of a pretension girder bridge for urban maglev transit was performed to identify the main design parameters and their effect. Girder deflection at mid-span is the most important design criteria of urban maglev transit. Therefore, concrete compressive strength, girder height, girder length, and unbonded tendon length were selected as the design parameters that relate to girder deflection. In addition, tendon layout and unbonded tendon ratios were also considered as design parameters to control the top stress of the pretension girder section at the support. The analysis results show that both the girder height and length are dominant design parameters governing girder deflection, more important than compressive strength and unbounded tendon length. And, sensitivity analysis makes this study suggest design weight value. In terms of stress, a tendon layout that can satisfy the unbounded tendon rule requires an additional tendon or rebar at the upper section to control the tensile stress on top of the section. Therefore, to improve feasibility and constructability in the future, an enhanced unbonded tendon rule considering the load characteristics of the urban maglev system should be studied.