• Title/Summary/Keyword: Kernel Functions

Search Result 270, Processing Time 0.019 seconds

Stepwise Estimation for Multiple Non-Crossing Quantile Regression using Kernel Constraints (커널 제약식을 이용한 다중 비교차 분위수 함수의 순차적 추정법)

  • Bang, Sungwan;Jhun, Myoungshic;Cho, HyungJun
    • The Korean Journal of Applied Statistics
    • /
    • v.26 no.6
    • /
    • pp.915-922
    • /
    • 2013
  • Quantile regression can estimate multiple conditional quantile functions of the response, and as a result, it provide comprehensive information of the relationship between the response and the predictors. However, when estimating several conditional quantile functions separately, two or more estimated quantile functions may cross or overlap and consequently violate the basic properties of quantiles. In this paper, we propose a new stepwise method to estimate multiple non-crossing quantile functions using constraints on the kernel coefficients. A simulation study are presented to demonstrate satisfactory performance of the proposed method.

ERROR BOUNDS FOR GAUSS-RADAU AND GAUSS-LOBATTO RULES OF ANALYTIC FUNCTIONS

  • Ko, Kwan-Pyo
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.3
    • /
    • pp.797-812
    • /
    • 1997
  • For analytic functions we give an expression for the kernel $K_n$ of the remainder terms for the Gauss-Radau and the Gauss-Lobatto rules with end points of multiplicity r and prove the convergence of the kernel we obtained. The error bound are obtained for the type $$\mid$R_n(f)$\mid$ \leq \frac{1}{\pi}l(\Gamma) max_{z \in \Gamma} $\mid$K_n(z)$\mid$ max_{z \in \Gamma} $\mid$f(z)$\mid$$, where $l(\Gamma)$ denotes the length of contour $\Gamma$.

  • PDF

MATRICES OF TOEPLITZ OPERATORS ON HARDY SPACES OVER BOUNDED DOMAINS

  • Chung, Young-Bok
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1421-1441
    • /
    • 2017
  • We compute explicitly the matrix represented by the Toeplitz operator on the Hardy space over a smoothly finitely connected bounded domain in the plane with respect to special orthonormal bases consisting of the classical kernel functions for the space of square integrable functions and for the Hardy space. The Fourier coefficients of the symbol of the Toeplitz operator are obtained from zeroth row vectors and zeroth column vectors of the matrix. And we also find some condition for the product of two Toeplitz operators to be a Toeplitz operator in terms of matrices.

STRONG INSERTION OF A CONTRA-BAIRE-1 (BAIRE-.5) FUNCTION BETWEEN TWO COMPARABLE REAL-VALUED FUNCTIONS

  • Mirmiran, Majid;Naderi, Binesh
    • The Pure and Applied Mathematics
    • /
    • v.26 no.1
    • /
    • pp.1-12
    • /
    • 2019
  • Necessary and sufficient conditions in terms of lower cut sets are given for the strong insertion of a Baire-.5 function between two comparable real-valued functions on the topological spaces that $F_{\sigma}-kernel$ of sets are $F_{\sigma}-sets$.

CERTAIN FORM OF HILBERT-TYPE INEQUALITY USING NON-HOMOGENEOUS KERNEL OF HYPERBOLIC FUNCTIONS

  • Santosh Kaushik;Satish Kumar
    • Korean Journal of Mathematics
    • /
    • v.31 no.2
    • /
    • pp.189-201
    • /
    • 2023
  • In this article, we establish Hilbert-type integral inequalities with the help of a non-homogeneous kernel of hyperbolic function with best constant factor. We also study the obtained inequalities's equivalent form. Additionaly, several specific Hilbert's type inequalities with constant factors in the term of the rational fraction expansion of higher order derivatives of cotangent and cosine functions are presented.

A Nature-inspired Multiple Kernel Extreme Learning Machine Model for Intrusion Detection

  • Shen, Yanping;Zheng, Kangfeng;Wu, Chunhua;Yang, Yixian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.702-723
    • /
    • 2020
  • The application of machine learning (ML) in intrusion detection has attracted much attention with the rapid growth of information security threat. As an efficient multi-label classifier, kernel extreme learning machine (KELM) has been gradually used in intrusion detection system. However, the performance of KELM heavily relies on the kernel selection. In this paper, a novel multiple kernel extreme learning machine (MKELM) model combining the ReliefF with nature-inspired methods is proposed for intrusion detection. The MKELM is designed to estimate whether the attack is carried out and the ReliefF is used as a preprocessor of MKELM to select appropriate features. In addition, the nature-inspired methods whose fitness functions are defined based on the kernel alignment are employed to build the optimal composite kernel in the MKELM. The KDD99, NSL and Kyoto datasets are used to evaluate the performance of the model. The experimental results indicate that the optimal composite kernel function can be determined by using any heuristic optimization method, including PSO, GA, GWO, BA and DE. Since the filter-based feature selection method is combined with the multiple kernel learning approach independent of the classifier, the proposed model can have a good performance while saving a lot of training time.

Fuzzy Kernel K-Nearest Neighbor Algorithm for Image Segmentation (영상 분할을 위한 퍼지 커널 K-nearest neighbor 알고리즘)

  • Choi Byung-In;Rhee Chung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.828-833
    • /
    • 2005
  • Kernel methods have shown to improve the performance of conventional linear classification algorithms for complex distributed data sets, as mapping the data in input space into a higher dimensional feature space(7). In this paper, we propose a fuzzy kernel K-nearest neighbor(fuzzy kernel K-NN) algorithm, which applies the distance measure in feature space based on kernel functions to the fuzzy K-nearest neighbor(fuzzy K-NN) algorithm. In doing so, the proposed algorithm can enhance the Performance of the conventional algorithm, by choosing an appropriate kernel function. Results on several data sets and segmentation results for real images are given to show the validity of our proposed algorithm.

MONOTONICITY PROPERTIES OF THE BESSEL-STRUVE KERNEL

  • Baricz, Arpad;Mondal, Saiful R.;Swaminathan, Anbhu
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.6
    • /
    • pp.1845-1856
    • /
    • 2016
  • In this paper our aim is to study the classical Bessel-Struve kernel. Monotonicity and log-convexity properties for the Bessel-Struve kernel, and the ratio of the Bessel-Struve kernel and the Kummer confluent hypergeometric function are investigated. Moreover, lower and upper bounds are given for the Bessel-Struve kernel in terms of the exponential function and some $Tur{\acute{a}}n$ type inequalities are deduced.

THE STUDY OF FLOOD FREQUENCY ESTIMATES USING CAUCHY VARIABLE KERNEL

  • Moon, Young-Il;Cha, Young-Il;Ashish Sharma
    • Water Engineering Research
    • /
    • v.2 no.1
    • /
    • pp.1-10
    • /
    • 2001
  • The frequency analyses for the precipitation data in Korea were performed. We used daily maximum series, monthly maximum series, and annual series. For nonparametric frequency analyses, variable kernel estimators were used. Nonparametric methods do not require assumptions about the underlying populations from which the data are obtained. Therefore, they are better suited for multimodal distributions with the advantage of not requiring a distributional assumption. In order to compare their performance with parametric distributions, we considered several probability density functions. They are Gamma, Gumbel, Log-normal, Log-Pearson type III, Exponential, Generalized logistic, Generalized Pareto, and Wakeby distributions. The variable kernel estimates are comparable and are in the middle of the range of the parametric estimates. The variable kernel estimates show a very small probability in extrapolation beyond the largest observed data in the sample. However, the log-variable kernel estimates remedied these defects with the log-transformed data.

  • PDF

Semiparametric Kernel Fisher Discriminant Approach for Regression Problems

  • Park, Joo-Young;Cho, Won-Hee;Kim, Young-Il
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.2
    • /
    • pp.227-232
    • /
    • 2003
  • Recently, support vector learning attracts an enormous amount of interest in the areas of function approximation, pattern classification, and novelty detection. One of the main reasons for the success of the support vector machines(SVMs) seems to be the availability of global and sparse solutions. Among the approaches sharing the same reasons for success and exhibiting a similarly good performance, we have KFD(kernel Fisher discriminant) approach. In this paper, we consider the problem of function approximation utilizing both predetermined basis functions and the KFD approach for regression. After reviewing support vector regression, semi-parametric approach for including predetermined basis functions, and the KFD regression, this paper presents an extension of the conventional KFD approach for regression toward the direction that can utilize predetermined basis functions. The applicability of the presented method is illustrated via a regression example.