A Data Mining Framework for Social Graph Generation and Analysis

Author(s):  
Danish Kumar ◽  
Md. Imran Hossain Showrov
Author(s):  
Bapuji Rao ◽  
Sasmita Mishra ◽  
Saroja Nanda Mishra

The retrieval of sub-graph from a large graph in structured data mining is one of the fundamental tasks for analyze. Visualization and analyze large community graph are challenging day by day. Since a large community graph is very difficult to visualize, so compression is essential. To study a large community graph, compression technique may be used for compression of community graph. There should not be any loss of information or knowledge while compressing the community graph. Similarly to extract desired knowledge of a particular sub-graph from a large community graph, then the large community graph needs to be partitioned into smaller sub-community graphs. The partition aims at the edges among the community members of dissimilar communities in a community graph. Sometimes it is essential to compare two community graphs for similarity which makes easier for mining the reliable knowledge from a large community graph. Once the similarity is done then the necessary mining of knowledge can be extracted from only one community graph rather than from both which leads saving of time.


Author(s):  
Carl Yang ◽  
Haonan Wang ◽  
Ke Zhang ◽  
Liang Chen ◽  
Lichao Sun

Many data mining and analytical tasks rely on the abstraction of networks (graphs) to summarize relational structures among individuals (nodes). Since relational data are often sensitive, we aim to seek effective approaches to generate utility-preserved yet privacy-protected structured data. In this paper, we leverage the differential privacy (DP) framework to formulate and enforce rigorous privacy constraints on deep graph generation models, with a focus on edge-DP to guarantee individual link privacy. In particular, we enforce edge-DP by injecting designated noise to the gradients of a link reconstruction based graph generation model, while ensuring data utility by improving structure learning with structure-oriented graph discrimination. Extensive experiments on two real-world network datasets show that our proposed DPGGAN model is able to generate graphs with effectively preserved global structure and rigorously protected individual link privacy.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 33013-33022
Author(s):  
Lucija Petricioli ◽  
Luka Humski ◽  
Mihaela Vranic ◽  
Damir Pintar

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 6622-6636 ◽  
Author(s):  
Luka Humski ◽  
Damir Pintar ◽  
Mihaela Vranic

2020 ◽  
Author(s):  
Mohammed J. Zaki ◽  
Wagner Meira, Jr
Keyword(s):  

2010 ◽  
Vol 24 (2) ◽  
pp. 112-119 ◽  
Author(s):  
F. Riganello ◽  
A. Candelieri ◽  
M. Quintieri ◽  
G. Dolce

The purpose of the study was to identify significant changes in heart rate variability (an emerging descriptor of emotional conditions; HRV) concomitant to complex auditory stimuli with emotional value (music). In healthy controls, traumatic brain injured (TBI) patients, and subjects in the vegetative state (VS) the heart beat was continuously recorded while the subjects were passively listening to each of four music samples of different authorship. The heart rate (parametric and nonparametric) frequency spectra were computed and the spectra descriptors were processed by data-mining procedures. Data-mining sorted the nu_lf (normalized parameter unit of the spectrum low frequency range) as the significant descriptor by which the healthy controls, TBI patients, and VS subjects’ HRV responses to music could be clustered in classes matching those defined by the controls and TBI patients’ subjective reports. These findings promote the potential for HRV to reflect complex emotional stimuli and suggest that residual emotional reactions continue to occur in VS. HRV descriptors and data-mining appear applicable in brain function research in the absence of consciousness.


Sign in / Sign up

Export Citation Format

Share Document