3,285 research outputs found
Kernel Truncated Regression Representation for Robust Subspace Clustering
Subspace clustering aims to group data points into multiple clusters of which
each corresponds to one subspace. Most existing subspace clustering approaches
assume that input data lie on linear subspaces. In practice, however, this
assumption usually does not hold. To achieve nonlinear subspace clustering, we
propose a novel method, called kernel truncated regression representation. Our
method consists of the following four steps: 1) projecting the input data into
a hidden space, where each data point can be linearly represented by other data
points; 2) calculating the linear representation coefficients of the data
representations in the hidden space; 3) truncating the trivial coefficients to
achieve robustness and block-diagonality; and 4) executing the graph cutting
operation on the coefficient matrix by solving a graph Laplacian problem. Our
method has the advantages of a closed-form solution and the capacity of
clustering data points that lie on nonlinear subspaces. The first advantage
makes our method efficient in handling large-scale datasets, and the second one
enables the proposed method to conquer the nonlinear subspace clustering
challenge. Extensive experiments on six benchmarks demonstrate the
effectiveness and the efficiency of the proposed method in comparison with
current state-of-the-art approaches.Comment: 14 page
Cheating-Resilient Incentive Scheme for Mobile Crowdsensing Systems
Mobile Crowdsensing is a promising paradigm for ubiquitous sensing, which
explores the tremendous data collected by mobile smart devices with prominent
spatial-temporal coverage. As a fundamental property of Mobile Crowdsensing
Systems, temporally recruited mobile users can provide agile, fine-grained, and
economical sensing labors, however their self-interest cannot guarantee the
quality of the sensing data, even when there is a fair return. Therefore, a
mechanism is required for the system server to recruit well-behaving users for
credible sensing, and to stimulate and reward more contributive users based on
sensing truth discovery to further increase credible reporting. In this paper,
we develop a novel Cheating-Resilient Incentive (CRI) scheme for Mobile
Crowdsensing Systems, which achieves credibility-driven user recruitment and
payback maximization for honest users with quality data. Via theoretical
analysis, we demonstrate the correctness of our design. The performance of our
scheme is evaluated based on extensive realworld trace-driven simulations. Our
evaluation results show that our scheme is proven to be effective in terms of
both guaranteeing sensing accuracy and resisting potential cheating behaviors,
as demonstrated in practical scenarios, as well as those that are intentionally
harsher
LMSFC: A Novel Multidimensional Index based on Learned Monotonic Space Filling Curves
The recently proposed learned indexes have attracted much attention as they
can adapt to the actual data and query distributions to attain better search
efficiency. Based on this technique, several existing works build up indexes
for multi-dimensional data and achieve improved query performance. A common
paradigm of these works is to (i) map multi-dimensional data points to a
one-dimensional space using a fixed space-filling curve (SFC) or its variant
and (ii) then apply the learned indexing techniques. We notice that the first
step typically uses a fixed SFC method, such as row-major order and z-order. It
definitely limits the potential of learned multi-dimensional indexes to adapt
variable data distributions via different query workloads. In this paper, we
propose a novel idea of learning a space-filling curve that is carefully
designed and actively optimized for efficient query processing. We also
identify innovative offline and online optimization opportunities common to
SFC-based learned indexes and offer optimal and/or heuristic solutions.
Experimental results demonstrate that our proposed method, LMSFC, outperforms
state-of-the-art non-learned or learned methods across three commonly used
real-world datasets and diverse experimental settings.Comment: Extended Version. Accepted by VLDB 202
Possible singlet and triplet superconductivity on honeycomb lattice
We study the possible superconducting pairing symmetry mediated by spin and
charge fluctuations on the honeycomb lattice using the extended Hubbard model
and the random-phase-approximation method. From to doping levels,
a spin-singlet -wave is shown to be the leading
superconducting pairing symmetry when only the on-site Coulomb interaction
is considered, with the gap function being a mixture of the nearest-neighbor
and next-nearest-neighbor pairings. When the offset of the energy level between
the two sublattices exceeds a critical value, the most favorable pairing is a
spin-triplet -wave which is mainly composed of the next-nearest-neighbor
pairing. We show that the next-nearest-neighbor Coulomb interaction is also
in favor of the spin-triplet -wave pairing.Comment: 6 pages, 4 figure
- …