Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 27 for “"Network Mining"”.

  1. Heterogeneous Network Mining and Analysis

    … and information propagation. Heterogeneous networks model di erent types of objects and relationships among them. Compared to homogeneous networks, heterogeneous networks can fuse information from multiple data sources and social platforms. Therefore, it is natural to model complex objects …

    auckland-ms Repository record for Heterogeneous Network Mining and Analysis (opens in a new tab)

  2. Collective Multi-relational Network Mining

    … increasingly interconnected, and the study of networks and graphs are becoming more important than ever. Domains such as biological and pharmaceutical networks, online social networks, the World Wide Web, recommender systems, and scholarly networks are just a few examples that include explicit …

    maryland Repository record for Collective Multi-relational Network Mining (opens in a new tab)

  3. Exploiting multiple data sources for network mining

    … data sources to enhance the performance of network mining algorithms for community detection, node classification and link prediction tasks."--Abstract.

    msu Repository record for Exploiting multiple data sources for network mining (opens in a new tab)

  4. Criminal Network Mining and Analysis for Forensic Investigations

    Criminal network analysis tools are widely used by law enforcement, mainly in cases of organized crime. The data required for a majority of these tools are police records and databases. In many cases, forensically collected data contains valuable information about the suspect’s social network. This …

    concordia Download PDF for Criminal Network Mining and Analysis for Forensic Investigations (opens in a new tab)

  5. Evolving Network Representation Learning Based on Random Walks

    Large-scale network mining and analysis is key to revealing the underlying dynamics of networks, not easily observable before. Lately, there is a fast-growing interest in learning low-dimensional continuous representations of networks that can be utilized to perform highly accurate and scalable …

    york Repository record for Evolving Network Representation Learning Based on Random Walks (opens in a new tab)

  6. IDENTIFYING AND EXPLOITING SYNTHETIC LETHALITY FOR CANCER THERAPEUTICS

    … SL pairs and to utilize SL pairs in biological network mining and clinical decision support. Two new methods are designed to identify potential SL pairs using multiple genomic data sources, based on statistical hypothesis testing and collective matrix factorization. A new algorithm to mine and …

    nus Repository record for IDENTIFYING AND EXPLOITING SYNTHETIC LETHALITY FOR CANCER THERAPEUTICS (opens in a new tab) Download file for IDENTIFYING AND EXPLOITING SYNTHETIC LETHALITY FOR CANCER THERAPEUTICS (opens in a new tab)

  7. Probabilistic interpretation of path-based relevance in heterogeneous information networks

    As a powerful representation paradigm for networked and multi-typed data, the heterogeneous information network (HIN) is ubiquitous. Meanwhile, defining proper relevance measures has always been a fundamental problem and of great pragmatic importance for network mining tasks. Inspired by the …

    uiuc Repository record for Probabilistic interpretation of path-based relevance in heterogeneous information networks (opens in a new tab)

  8. Pattern extraction and clustering for high-dimensional discrete data

    … factorizations with interesting problems in data mining and machine learning. We propose a framework for solving several low-rank matrix factorization problems, including binary matrix factorization, constrained binary matrix factorization, weighted constrained binary matrix factorization, densest …

    uiuc Repository record for Pattern extraction and clustering for high-dimensional discrete data (opens in a new tab)

  9. Efficient frequent pattern mining from big data and its applications

    Frequent pattern mining is an important research areas in data mining. Since its introduction, it has drawn attention of many researchers. Consequently, many algorithms have been proposed. Popular algorithms include level-wise Apriori based algorithms, tree based algorithms, and hyperlinked array …

    manitoba Repository record for Efficient frequent pattern mining from big data and its applications (opens in a new tab)

  10. Harnessing heterogeneous association in real-world networks

    Real-world networks often contain heterogeneity due to the heterogeneous nature of the world. A few examples of such networks include multi-view social networks, heterogeneous bibliographic networks, biomedical networks, etc. Ostensibly the heterogeneity of real-world network appears as the typed …

    uiuc Repository record for Harnessing heterogeneous association in real-world networks (opens in a new tab)

  11. Dense subgraph discovery: novel algorithms and applications

    … between nodes. For example, edges in transaction networks are associated with weights representing the transaction amounts, and social networks have users with attributes encoded as feature vectors. These complex graph data and the emergence of new use cases create challenges in DSD, necessitating …

    bu Repository record for Dense subgraph discovery: novel algorithms and applications (opens in a new tab)

  12. Sequence queries on temporal graphs

    … can be used to describe and represent real-world networks, including transportation networks, social networks, and communication networks, with higher fidelity and accuracy. However, research is still limited on how to manage large scale temporal graphs and execute queries over these graphs …

    bu Repository record for Sequence queries on temporal graphs (opens in a new tab)

  13. GRAPH BASED MINING ON WEIGHTED DIRECTED GRAPHS FOR SUBNETWORKS AND PATH DISCOVERY

    Subnetwork or path mining is an emerging data mining problem in many areas including scientific and commercial applications. Graph modeling is one of the effective ways in representing real world networks. Many natural and man-made systems are structured in the form of networks. Traditional machine …

    iupui Repository record for GRAPH BASED MINING ON WEIGHTED DIRECTED GRAPHS FOR SUBNETWORKS AND PATH DISCOVERY (opens in a new tab)

  14. Entity recommendation and search in heterogeneous information networks

    … development of social media and information network-based web services, data mining studies on network analysis have gained increasing attention in recent years. Many early studies focus on homogeneous network mining, with the assumption that the network nodes and links are of the same type …

    uiuc Repository record for Entity recommendation and search in heterogeneous information networks (opens in a new tab)

  15. Parallel Mining and Analysis of Triangles and Communities in Big Networks

    A network (graph) is a powerful abstraction for interactions among entities in a system. Examples include various social, biological, collaboration, citation, and co-purchase networks. Real-world networks are often characterized by an abundance of triangles and the existence of well-structured …

    vt Repository record for Parallel Mining and Analysis of Triangles and Communities in Big Networks (opens in a new tab)

  16. HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems

    … biological, social, and various infrastructure networks, which have, in turn, contributed to the rise of massive networks. During the past decade, analyzing and mining of these networks has become an emerging research area with many real-world applications. The most relevant problems in this …

    vt Repository record for HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems (opens in a new tab)

  17. Network analysis with negative links

    … to harness the natural structure of data through network analysis. Traditionally, network analysis has focused on networks having only positive links, or unsigned networks. However, in many real-world systems, relations between nodes in a graph can be both positive and negative, or signed …

    msu Repository record for Network analysis with negative links (opens in a new tab)

  18. Explore the Node Representation Learning on Heterogeneous Information Networks

    … have applied NRL to heterogeneous information networks (HIN), most of them only focus on the quality of the node embedding itself or some basic downstream tasks, such as node classification and link prediction. In this thesis, we study the following three problems to explore the power of graph …

    unsw Repository record for Explore the Node Representation Learning on Heterogeneous Information Networks (opens in a new tab)

  19. Social analytics for health integration, intelligence, and monitoring

    Nowadays, patient-generated social health data are abundant and Healthcare is changing from the authoritative provider-centric model to collaborative and patient-oriented care. The aim of this dissertation is to provide a Social Health Analytics framework to utilize social data to solve the …

    njit Repository record for Social analytics for health integration, intelligence, and monitoring (opens in a new tab)

Page 1 of 2