FAQ

Degree-preserving randomization

Known as: Degree Preserving Randomization 
Degree Preserving Randomization is a technique used in Network Science that aims to assess whether or not variations observed in a given graph could… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2017
051019752017

Related topics

Related topics

4 relations
Erdős–Rényi modelExponential random graph modelsNetwork controllability

Broader (1)

Network theory

Related mentions per year

Related mentions per year

1942-2018
19401960198020002020
Degree-preserving randomization
Erdős–Rényi model
Network theory
Exponential random graph models
Network controllability

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Sparsity preserving score for feature selection
Compared with supervised feature selection, selecting features in unsupervised learning scenarios is a much harder problem due to… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?
2014
2014
Spatio-temporal Address Mutation for Proactive Cyber Agility against Sophisticated Attackers
The static one-to-one binding of hosts to IP addresses allows adversaries to conduct thorough reconnaissance in order to discover… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 6
  • figure 4
Is this relevant?
2009
2009
SIFT features for face recognition
Scale Invariant Feature Transform (SIFT) has shown to be very powerful for general object detection/recognition. And recently, it… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 6
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Orthogonal Neighborhood Preserving Projections: A Projection-Based Dimensionality Reduction Technique
This paper considers the problem of dimensionality reduction by orthogonal projection techniques. The main feature of the… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
Orthogonal Neighborhood Preserving Embedding for Face Recognition
In this paper, we propose a new algorithm called Orthogonal Neighborhood Preserving Embedding (ONPE) for face recognition. ONPE… (More)
  • figure 2
  • figure 1
  • table 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
Tensor Embedding Methods
Over the past few years, some embedding methods have been proposed for feature extraction and dimensionality reduction in various… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Deriving Private Information from Randomized Data
Randomization has emerged as a useful technique for data disguising in privacy-preserving data mining. Its privacy properties… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Inapproximability Results for Guarding Polygons and Terrains
Past research on art gallery problems has concentrated almost exclusively on bounds on the numbers of guards needed in the worst… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Proximity-preserving labeling schemes
 
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures
We present an algorithm that uses decision procedures to generate finite-state abstractions of possibly infinite-state systems… (More)
Is this relevant?