A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Empirical comparison of algorithms for network community detection
2010
Proceedings of the 19th international conference on World wide web - WWW '10
In this paper, we explore a range of network community detection methods in order to compare them and to understand their relative performance and the systematic biases in the clusters they identify. ...
Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have ...
In applications, it is important to note that heuristic approaches to and approximation algorithms for community detection often find clusters that are systematically "biased," in the sense that they return ...
doi:10.1145/1772690.1772755
dblp:conf/www/LeskovecLM10
fatcat:w4ery4mwpvacbhjscv73w727ry
Empirical Comparison of Algorithms for Network Community Detection
[article]
2010
arXiv
pre-print
In this paper, we explore a range of network community detection methods in order to compare them and to understand their relative performance and the systematic biases in the clusters they identify. ...
Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have ...
In applications, it is important to note that heuristic approaches to and approximation algorithms for community detection often find clusters that are systematically "biased," in the sense that they return ...
arXiv:1004.3539v1
fatcat:7mqfcpefcnhf5htvdfrgzbleom
Local Lanczos Spectral Approximation for Community Detection
[chapter]
2017
Lecture Notes in Computer Science
We propose a novel approach called the Local Lanczos Spectral Approximation (LLSA) for identifying all latent members of a local community from very few seed members. ...
To the best of our knowledge, this is the first work to adapt the Lanczos method for local community detection, which is natural and potentially effective. ...
In this paper, we propose a novel approach called the Local Lanczos Spectral Approximation (LLSA) for local community detection. ...
doi:10.1007/978-3-319-71249-9_39
fatcat:2t7q5uptfzb3zc3whhpvbjlcyi
Robust local community detection
2015
Proceedings of the VLDB Endowment
Given a large network, local community detection aims at finding the community that contains a set of query nodes and also maximizes (minimizes) a goodness metric. ...
However, most existing metrics tend to include irrelevant subgraphs in the detected local community. We refer to such irrelevant subgraphs as free riders. ...
We would like to thank anonymous reviewers for their valuable comments. ...
doi:10.14778/2752939.2752948
fatcat:pv5jgyyb4jgnnkcr6xl6l2hcde
Hyperspectral target detection using manifold learning and multiple target spectra
2015
2015 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)
The research presented here focuses on a graph theory and manifold learning approach to target detection, using an adaptive version of locally linear embedding that is biased to separate target pixels ...
approximate. ...
Section III presents our graph-based methodology for target detection with spectrally variable targets. ...
doi:10.1109/aipr.2015.7444547
dblp:conf/aipr/ZiemannTM15
fatcat:qopagpu6brhfhkokf6rovurrm4
Demonstration of Bias-Controlled Algorithmic Tuning of Quantum Dots in a Well (DWELL) MidIR Detectors
2009
IEEE Journal of Quantum Electronics
The spectral responses resulting from different biases exhibit spectral shifts, albeit with significant spectral overlap. ...
It is shown experimentally that it is possible to reconstruct the spectral content of a target electronically without using any dispersive optical elements for tuning, thereby demonstrating a DWELLbased ...
Nonetheless, SLS seems to be a promising technology for LWIR detection. ...
doi:10.1109/jqe.2009.2013150
fatcat:sib72hqbbbempb7xbye7l4fe7i
Midbandgap electro-optic detection of Bloch oscillations
2000
Physical Review B (Condensed Matter)
Bloch oscillations excited in a biased GaAs/Al x Ga 1Ϫx As superlattice are investigated in a time-resolved two-color electro-optic detection scheme. ...
RAPID COMMUNICATIONS R10 566 PRB 61 FÖ RST, SEGSCHNEIDER, DEKORSY, KURZ, AND KÖ HLER ...
Cho for stimulating suggestions and R. Martini for helpful discussions. This work was supported by the Volkswagen Stiftung. *Electronic address: foerst@iht-ii.rwth-aachen.de ...
doi:10.1103/physrevb.61.r10563
fatcat:k3ca5exyvzenpl5dmbvgwwwaue
Krylov Subspace Approximation for Local Community Detection in Large Networks
[article]
2019
arXiv
pre-print
To address such semi-supervised mining task, we systematically develop a local spectral subspace-based community detection method, called LOSP. ...
For increasingly common large network data sets, global community detection is prohibitively expensive, and attention has shifted to methods that mine local communities, i.e. identifying all latent members ...
Among these, the local spectral method is a newly proposed technique that exhibits high performance for the local community detection task. ...
arXiv:1712.04823v2
fatcat:thoyvfgvdvcmzemmoehipkgpcq
A Micro-Power EEG Acquisition SoC With Integrated Feature Extraction Processor for a Chronic Seizure Detection System
2010
IEEE Journal of Solid-State Circuits
Makinwa for extremely valuable discussions. ...
The digitized EEG recordings can be robustly transmitted (i.e., wireless EEG) for central processing. However, local processing is beneficial for minimizing communication cost. ...
Through this computation-versus-communication tradeoff, local processing reduces the total system power on the scalp by a factor of 14 for the radio considered. ...
doi:10.1109/jssc.2010.2042245
fatcat:5d7skkbsknby5fjevbk3gzi5z4
Learning to Detect Malicious Clients for Robust Federated Learning
[article]
2020
arXiv
pre-print
In this work, we propose a new framework for robust federated learning where the central server learns to detect and remove the malicious model updates using a powerful detection model, leading to targeted ...
Therefore, timely detecting these malicious model updates and the underlying attackers becomes critically important. ...
Spectral Anomaly Detection for Robust FL In this section, we present a novel spectral anomaly detection framework for robust FL. ...
arXiv:2002.00211v1
fatcat:iuv6ha4robdaln3iv6sgy2by4m
Think locally, act locally: Detection of small, medium-sized, and large communities in large networks
2015
Physical Review E
of global community-detection methods. ...
In this paper, we adopt a complementary perspective that "communities" are associated with bottlenecks of locally-biased dynamical processes that begin at seed sets of nodes, and we employ several different ...
One can use such an eigenvector for a locally biased version of traditional spectral graph partitioning. Following Ref. ...
doi:10.1103/physreve.91.012821
pmid:25679670
pmcid:PMC5125638
fatcat:vid5nqvwavgpvnpzpswjzecaf4
Detecting Overlapping Communities from Local Spectral Subspaces
[article]
2015
arXiv
pre-print
Based on the definition of local spectral subspace, we propose a novel approach called LOSP for local overlapping community detection. ...
Two candidate definitions of the local spectral subspace are analyzed, and different community scoring functions for determining the community boundary, including two new metrics, are thoroughly evaluated ...
query biased density to effectively reduce the free rider effect that tends to include irrelevant subgraphs in the detected local community. ...
arXiv:1509.08065v1
fatcat:d6jt6ovcarejhemz2cs2bpkxre
Core-biased random walks in complex networks
[article]
2017
arXiv
pre-print
When this global information is not available, it is possible to construct a biased random walk which approximates the MERW using only the degree of the nodes, a local property. ...
Here we show that it is also possible to construct a good approximation to a MERW by biasing the random walk via the properties of the network's core, which is a mesoscale property of the network. ...
A good approximation to the MERW using only local properties is the degree-biased random walk [5, 6] . ...
arXiv:1709.07715v1
fatcat:uzx75cyv65cgbihc2ir2vaeqpy
Hibernets
2010
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks - IPSN '10
Preprocessing of data before transmission is recommended for many sensor network applications to reduce communication and improve energy efficiency. ...
interesting events, and to 2) achieve low-power signal analysis using an analog spectral decomposition block, freeing up digital computation resources for higher-level analysis. ...
Singireddy for his help with the layout of the analog integrated circuit. ...
doi:10.1145/1791212.1791229
dblp:conf/ipsn/RumbergGK10
fatcat:v7mix6lfsvcd5aspz6ncnh4ajm
Hibernets
2010
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks - IPSN '10
Preprocessing of data before transmission is recommended for many sensor network applications to reduce communication and improve energy efficiency. ...
interesting events, and to 2) achieve low-power signal analysis using an analog spectral decomposition block, freeing up digital computation resources for higher-level analysis. ...
Singireddy for his help with the layout of the analog integrated circuit. ...
doi:10.1145/1791212.1791296
dblp:conf/ipsn/RumbergGK10a
fatcat:uy7o3e2a3fhe7f3i7z5xr6zure
« Previous
Showing results 1 — 15 out of 33,923 results