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 14 of 14 for “"Computer science -- Data processing"”.

  1. Dynamic graph neural network framework for real-time multi-modal data analysis and predictive modeling

    … prominent for analyzing complex, interconnected data across fields such as transportation, social networks, and cybersecurity. Despite their advancements, many existing GNN models struggle to capture the intricate interactions among temporal, spatial, and domain-specific knowledge, particularly …

    umkc Repository record for Dynamic graph neural network framework for real-time multi-modal data analysis and predictive modeling (opens in a new tab)

  2. Weisfeiler-Leman graph kernels for the out-of-distribution characterization of graph structured data

    … metrics to better characterize graph-structured data. It focuses on enhancing the analysis of graph-structured data and enhancing the explainability and power of Graph Neural Networks (GNNs) without introducing a new model architecture. Within existing GNN research, strong claims of …

    umkc Repository record for Weisfeiler-Leman graph kernels for the out-of-distribution characterization of graph structured data (opens in a new tab)

  3. Automated collection and handling of data

    … web scraping, which is the process of extracting data from websites using automated software programs. The project specifically focuses on scraping Excel files and uploading index data to a database, with the aim of providing financial analysts and fund managers at Kvika Asset Management with …

    reykjavik Repository record for Automated collection and handling of data (opens in a new tab)

  4. Highway tollgates traffic prediction using a stacked autoencoder neural network

    … but the results indicated that a bigger dataset could favor stacked autoencoder networks. Using the Taguchi method did help cut down on number of experiments to test, but choosing network settings based on the Taguchi test results did not yield lower error than what was found during the …

    chalmers Repository record for Highway tollgates traffic prediction using a stacked autoencoder neural network (opens in a new tab)

  5. Highway Tollgates Travel Time & Volume Predictions using Support Vector Regression with Scaling Methods

    … includes 1) an approach to handling the missing data; 2) selection of important features; 3) investigation of three scaling methods and discussion of their suitability. Experiments were done as part of the Knowledge Discovery and Data Mining (KDD) Cup 2017.

    chalmers Repository record for Highway Tollgates Travel Time & Volume Predictions using Support Vector Regression with Scaling Methods (opens in a new tab)

  6. Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing

    … search space, eCP reduces the number of data items scored by Blackthorn in each interaction round, leading to reduced time per interaction round, while maintaining the relevance of the items suggested. Experiments on the YFCC100M dataset, which consists of nearly 100 million images and …

    reykjavik Repository record for Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing (opens in a new tab)

  7. Design of heterogeneous coherence hierarchies using manager-client pairing

    … shift in focus toward multicore and manycore processing. While this is an exciting time for architects, with many new opportunities and design spaces to explore, this brings with it some new challenges. One area that is especially impacted is the memory subsystem. Specifically, the design, …

    gatech Repository record for Design of heterogeneous coherence hierarchies using manager-client pairing (opens in a new tab)

  8. NV-tree : a scalable disk-based high-dimensional index

    … within large collections of high-dimensional data points. The NV-tree is a very compact index, as only six bytes are kept in the index for each high-dimensional descriptor. It thus scales extremely well when indexing large collections of high-dimensional descriptors. The NV-tree efficiently …

    reykjavik Repository record for NV-tree : a scalable disk-based high-dimensional index (opens in a new tab)

  9. Data center resource management with temporal data center resource management with temporal dynamic workload

    The proliferation of Internet services drives the data center expansion in both size and the number. More importantly, the energy consumption (as part of total cost of ownership (TCO)) has become a social concern. When the workload demand is given, the data center operators desire minimizing their …

    umkc Repository record for Data center resource management with temporal data center resource management with temporal dynamic workload (opens in a new tab)