Uploaded byDataminingTools Inc
Data Mining: Graph mining and social network analysis
Graph mining analyzes structured data like social networks and the web through graph search algorithms. It aims to find frequent subgraphs using Apriori-based or pattern growth approaches. Social networks exhibit characteristics like densification and heavy-tailed degree distributions. Link mining analyzes heterogeneous, multi-relational social network data through tasks like link prediction and group detection, facing challenges of logical vs statistical dependencies and collective classification. Multi-relational data mining searches for patterns across multiple database tables, including multi-relational clustering that utilizes information across relations.
In this document
Powered by AI
Overview of graph mining, social network analysis, and multi-relational data mining.
Importance of graph mining in modeling complex structures like social networks and algorithms.
Apriori-based methods for mining frequent subgraphs include AGM, FSG, and path-join approach.
Pattern growth graph approach and gSpan algorithm for frequent substructure mining discussed.
Key characteristics of social networks include densification power law and heavy-tailed distributions.
Emergence of link mining due to heterogeneous, multi-relational data in social networks.
Tasks in link mining include classification, link prediction, and metadata mining.
Challenges in link mining include feature construction, classification, and community mining.
Definition of multi-relational data mining (MRDM) and its focus on multiple tables in databases.
Process of multi-relational clustering and its application in partitioning data objects.
Invitation to visit the website for free self-help tutorials in data mining.
More Related Content
Similar to Data Mining: Graph mining and social network analysis
More from DataminingTools Inc
Data Mining: Graph mining and social network analysis
- 1. Graph Mining, SocialNetwork Analysis, and Multi relational Data Mining
- 2. Why and Whatis Graph Mining?Graphs become increasingly important in modeling complicated structures, such as circuits, images, biological networks, social networks, the Web, and XML documents. Many graph search algorithms have been developed in chemical informatics, computer vision, video indexing, and text retrieval. With the increasing demand on the analysis of large amounts of structured data, graph mining has become an active and important theme in data mining.
- 3. Methods for MiningFrequent Sub graphsApriori-based ApproachApriori-based algorithms for frequent substructure mining include AGM, FSG, and a path-join method. AGM shares similar characteristics with Apriori-based item-set mining. FSG and the path-join method explore edges and connections in an Apriori-based fashion.
- 4. Other Approach forMining Frequent Sub graphs Pattern Growth Graph Approach : Simplistic pattern growth-based frequent substructure mining.gSpan: A pattern-growth algorithm for frequent substructure mining. (for detailed algorithm refer wiki)
- 5. Characteristics of SocialNetworksDensification power lawShrinking diameterHeavy-tailed out-degree and in-degree distributions
- 6. Link MiningTraditional methodsof machine learning and data mining, taking, as input, a random sample of homogenous objects from a single relation, may not be appropriate in social networks. The data comprising social networks tend to be heterogeneous, multi relational, and semi-structured. As a result, a new field of research has emerged called link mining.
- 7. Tasks involved inlink mining Link-based object classification.Object type prediction.Link type prediction.Predicting link existenceLink cardinality estimation.Object reconciliation.Group detectionSub graph detectionMetadata mining
- 8. Challenges faced byLink MiningLogical versus statistical dependenciesFeature constructionInstances versus classes.Collective classification and collective consolidation.Effective use of labeled and unlabeled dataLink predictionClosed versus open world assumptionCommunity mining from multi relational networks.
- 9. What is Multirelational Data Mining?Multi relational data mining (MRDM) methods search for patterns that involve multiple tables (relations) from a relational database
- 10. Multi relational Clusteringwith User GuidanceMulti relational clustering is the process of partitioning data objects into a set of clusters based on their similarity, utilizing information in multiple relations.
- 11. Visit more selfhelp tutorialsPick a tutorial of your choice and browse through it at your own pace.The tutorials section is free, self-guiding and will not involve any additional support.Visit us at www.dataminingtools.net