Weighted Association Rule Mining using Weighted Support and Significance Framework [PDF]
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to handle weighted association rule mining problems where each item is allowed to
Feng Tao +5 more
core +2 more sources
A Weighted Problem for p-Laplacian Discussed with a Result of Saddle Point Type
Weighted problems for the p-Laplacian represent a wide range of models arising from real-world research. Solving such problems involves, in many situations, variational approaches that are various and a virtually inexhaustible resource.
Irina Meghea
doaj +1 more source
Extinction and Positivity of the Solutions for a 𝑝-Laplacian Equation with Absorption on Graphs
We deal with the extinction of the solutions of the initial-boundary value problem of the discrete p-Laplacian equation with absorption 𝑢𝑡=Δ𝑝,𝜔𝑢−𝑢𝑞 with p > 1, q > 0, which is said to be the discrete p-Laplacian equation on weighted graphs. For 0 < q < 1,
Qiao Xin, Chunlai Mu, Dengming Liu
doaj +1 more source
Coordinated motions of multiple robotic manipulators with matrix-weighted network
This paper addresses coordinated problem of uncertain robotic manipulators with matrix-weighted network. Given interconnections between agents are weighted by nonnegative definite matrices, we present a sufficient and necessary condition about zero ...
Liyun Zhao, Yan Ren, Rui Wang
doaj +1 more source
On stochastic completeness of weighted graphs [PDF]
Huang X. On stochastic completeness of weighted graphs. Bielefeld: Universität; 2011.In this thesis we are concerned with the long time behavior of continuous time random walks on infinite graphs. The following three related problems are considered.
Huang, Xueping
core
Some Applications of the Weighted Combinatorial Laplacian [PDF]
The weighted combinatorial Laplacian of a graph is a symmetric matrix which is the discrete analogue of the Laplacian operator. In this thesis, we will study a new application of this matrix to matching theory yielding a new characterization of factor ...
Szegedy, Christian
core +1 more source
On the bounds for the largest Laplacian eigenvalues of weighted graphs [PDF]
We consider weighted graphs, such as graphs where the edge weights are positive definite matrices. The Laplacian eigenvalues of a graph are the eigenvalues of the Laplacian matrix of a graph G.
Büyükköse, Şerife, Sorgun, Sezer
core +3 more sources
Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs [PDF]
We consider weighted graphs, where the edge weights are positive definite matrices. In this paper, we obtain two upper bounds on the spectral radius of the Laplacian matrix of weighted graphs and characterize graphs for which the bounds are attained ...
Das, Kinkar Ch.
core +1 more source
On structural controllability in complex networks with periodic switching topologies
Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source
Existence of positive weak solution for a weighted system of autocatalytic reaction steady state type [PDF]
We establish the existence results of positive weak solution for the weighted $p$-Laplacian autocatalytic reaction problem $-\Delta_{P,p}u=\lambda m(x)[\nu a(x)u^{\alpha }-\upsilon u^{\beta }]$ in $\Omega,$ $u=0$ on $\partial \Omega$, where $\Delta _{P,p}
Salah A. Khafagy, Z. Sadeghi
doaj +1 more source

