The k-core of a graph is the largest induced subgraph with minimum degree k. The k-core decomposition is to find the core number of each vertex in a graph, which is the largest value of k that the vertex belongs to a k-core. k-core decomposition has applications in many areas including network analysis, computational biology and graph visualization. The primary reason for it being widely used is the availability of an O(n + m) algorithm. The algorithm was proposed by Batagelj and Zaversnik and is considered the state-of-the-art algorithm for k-core decomposition. However, the algorithm is not suitable for parallelization and to the best of our knowledge there is no algorithm proposed for k-core decomposition on multicore processors. Also, the algorithm has not been experimentally analyzed for large graphs. Since the working set size of the algorithm is large, and the access pattern is highly random, it can be inefficient for large graphs. In this paper, we present an experimental analysis of the algorithm of Batagelj and Zaversnik and propose a new algorithm, ParK, that significantly reduces the working set size and minimizes the random accesses. We provide an experimental analysis of the algorithm using graphs with up to 65 million vertices and 1.8 billion edges. We compare the ParK algorithm with state-of-the-art algorithm and show that it is up to 6 times faster. We also provide a parallel methodology and show that the algorithm is amenable to parallelization on multicore architectures. We ran our experiments on a 4 socket Nehalem-EX processor which has 8 cores per socket and show that the algorithm scales up to 21 times using 32 cores.

ParK: An efficient algorithm for k-core decomposition on multicore processors

k-core decomposition is a social network analytic that can be applied to centrality analysis, visualization, and community detection. There is a simple and well-known linear time sequential algorithm to perform k-core decomposition, and for this reason, k-core decomposition is widely used as a network analytic. In this work, we present a new shared-memory parallel algorithm called PKC for k-core decomposition on multicore platforms. This approach improves on the state-of-the-art implementations for k-core decomposition algorithms by reducing synchronization overhead and creating a smaller graph to process high-degree vertices. We show that PKC consistently outperforms implementations of other methods on a 32-core multicore server and on a collection of large sparse graphs. We achieve a 2.81× speedup (geometric mean of speedups for 17 large graphs) over our implementation of the ParK k-core decomposition algorithm.

Parallel k-Core Decomposition on Multicore Platforms

This paper details the results of a face verification competition [2] held in conjunction with the Second International Conference on Biometric Authentication. The contest was held on the publically available XM2VTS database [4] according to a defined protocol [15]. The aim of the competition was to assess the advances made in face recognition since 2003 and to measure the sensitivity of the tested algorithms to severe changes in illumination conditions. In total, more than 10 algorithms submitted by three groups were compared 1 . The results show that the relative performance of some algorithms is dependent on training conditions (data, protocol) as well as environmental changes.

Performance characterisation of face recognition algorithms and their sensitivity to severe illumination changes

This paper details the results of a face verification competition [2] held in conjunction with the Second International Conference on Biometric Authentication. The contest was held on the publically available XM2VTS database [4] according to a defined protocol [15]. The aim of the competition was to assess the advances made in face recognition since 2003 and to measure the sensitivity of the tested algorithms to severe changes in illumination conditions. In total, more than 10 algorithms submitted by three groups were compared. The results show that the relative performance of some algorithms is dependent on training conditions (data, protocol) as well as environmental changes.

/pdf/performance-characterisation-of-face-recognition-algorithms-4q7z9nyxpi.pdf

The $k$ -core, a kind of structure of graphs, is a maximal connected subgraph with the minimum degree greater than or equal to $k$ , and has been used in many fields. The maximum $k$ such that a $k$ -core contains $u$ is the $K$ value of $u$ . Especially, for an edge-weighted graph, the degree of a vertex is the sum of weights of all its incident edges. The core decomposition problem on static graphs and the core maintenance problem on dynamic graphs have been studied in unweighted graphs. We improve the core decomposition algorithm to suit edge-weighted graphs, but it costs too much to update $K$ values of all vertices after the change of large graphs by using it directly. Then we find a small subgraph $H$ which contains all vertices whose $K$ values will change after the change of graphs. By operating on $H$ , the cost will be greatly reduced. Next, we design core maintenance algorithms for edge-weighted graphs in both insertion and deletion cases, which is the major work in this paper. In those core maintenance algorithms, a hierarchical process is added, which help us determine the new $K$ values of vertices in $H$ from the small ones to high. Finally, we conduct extensive experiments on real-world graphs to show the effectiveness and the efficiency that our algorithms have. The results show that our algorithms have the best performance.

Incremental Algorithms of the Core Maintenance Problem on Edge-Weighted Graphs

The Fisherface method is a most representative method of the linear discrimination analysis (LDA) technique. However, there persist in the Fisherface method at least two areas of weakness. The first weakness is that it cannot make the achieved discrimination vectors completely satisfy the statistical uncorrelation while costing a minimum of computing time. The second weakness is that not all the discrimination vectors are useful in pattern classification. In this paper, we propose an uncorrelated Fisherface approach (UFA) to improve the Fisherface method in these two areas. Experimental results on different image databases demonstrate that UFA outperforms the Fisherface method and the uncorrelated optimal discrimination vectors (UODV) method.

/pdf/an-uncorrelated-fisherface-approach-for-face-and-palmprint-nafo409b0y.pdf

An uncorrelated fisherface approach for face and palmprint recognition

The k-core of a graph is the maximal subgraph with minimum vertex degree k. When the core with the largest k is found, it can be removed and the next core can be found. In each of these cores (or shells), connected components have been enumerated in an existing graph clustering method. Here we propose a method to find graph clusters that are not just k-cores but also made of r-cliques. Just like the existing k-core clustering approach, our approach is also based on vertex and edge removals that can be made completely using local information (within the neighborhood). Our local and recursive algorithms are based on new graph theoretical insights that relate concepts including neighborhood, clique percolation, and k-core. We demonstrate our method with a gene network from PubMed data and compare our results with that from the existing k-core approach and use MeSH and TF-IDF ranking to show the differences in subject enrichment our approach can make.

Local k-core clustering for gene networks

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Chen Lu

Author Tools

Chat about Author

Papers

An uncorrelated fisherface approach for face and palmprint recognition

Local k-core clustering for gene networks