Introduction of
- Towards Principled User-side Recommender Systems (CIKM 2022) https://arxiv.org/abs/2208.09864
- Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure (ICML 2023) https://arxiv.org/abs/2301.10956
- and their related technology.
Speakerdeck: https://speakerdeck.com/joisino/metric-recovery-from-unweighted-k-nn-graphs
Garbage Classification Using Deep Learning TechniquesIRJET Journal
The document discusses using deep learning techniques for garbage classification. It compares the performance of different models, including support vector machines with HOG features, simple convolutional neural networks (CNNs), CNNs with residual blocks, and a hybrid model combining CNN features with HOG features. The CNN models generally performed best, with the simple CNN achieving over 93% accuracy on test data. Residual blocks did not significantly improve performance over simple CNNs. Combining CNN and HOG features was also considered but did not clearly outperform CNNs alone. Overall, CNN models were shown to effectively classify garbage using these image datasets.
This case study examines the impact of sales, fixed assets, and interest paid on the profitability of a major logistics company, GATI Limited, using multiple linear regression analysis. The regression analysis found that profitability is significantly and positively impacted by increases in fixed assets, and significantly and negatively impacted by increases in interest paid. Sales volume has a positive but minimal impact on profitability. Seasonality was also found to impact profitability. Overall, infrastructure development programs are expected to strengthen growth for the logistics industry by reducing costs, though current economic conditions remain challenging due to global slowdown.
This document presents an implementation and visualization of Dijkstra's shortest path algorithm using Python turtle. It describes Dijkstra's algorithm, discusses applications like map applications, provides equations and pseudocode to explain the methodology. It also discusses advantages like linear complexity, and limitations like not handling negative edges. The paper concludes by presenting results of testing the implementation, and discussing potential future work like applying the GPS concept used here to other shortest path algorithms.
IRJET- Approximate Multiplier and 8 Bit Dadda Multiplier Implemented through ...IRJET Journal
This document discusses the design and implementation of approximate multipliers for image processing applications. It proposes two new 4x4 approximate adders to reduce hardware complexity in a Dadda multiplier architecture. An 8x8 unsigned Dadda tree multiplier is modeled to evaluate the impact of using the proposed adders, which reduce the partial products into fewer columns while maintaining accuracy. Experimental results show the proposed multipliers achieve lower power-delay product compared to other approximate designs for similar precision in applications like JPEG image compression.
ABSTRACT: In the field of computer science known as "machine learning," a computer makes predictions about
the tasks it will perform next by examining the data that has been given to it. The computer can access data via
interacting with the environment or by using digitalized training sets. In contrast to static programming
algorithms, which require explicit human guidance, machine learning algorithms may learn from data and
generate predictions on their own. Various supervised and unsupervised strategies, including rule-based
techniques, logic-based techniques, instance-based techniques, and stochastic techniques, have been presented in
order to solve problems. Our paper's main goal is to present a comprehensive comparison of various cutting-edge
supervised machine learning techniques.
IRJET- 3D Object Recognition of Car Image DetectionIRJET Journal
This document summarizes research on 3D object recognition of car images using depth data from a Kinect sensor. The researchers used point cloud analysis techniques including VFH, CRH descriptors and ICP algorithms to match objects in 3D space. The approach involved preprocessing the point cloud to isolate individual objects, extracting descriptors, matching objects to models in a database, and verifying matches. Preliminary results showed the approach could successfully recognize objects like soda cans but performance was best at distances under 1 meter from the sensor. The goal is to enable applications like gesture controls and height estimation using 3D object detection.
Computational steering Interactive Design-through-Analysis for Simulation Sci...SURFevents
The document discusses computational steering and interactive design-through-analysis. It provides a vision of a unified computational framework that allows for rapid prototyping and accurate analysis of engineering designs. This framework would combine physics-informed machine learning for initial design exploration with isogeometric analysis for detailed analysis and optimization. The document then demonstrates some of the key concepts behind isogeometric analysis, including its use of B-spline basis functions to represent geometry, solutions, and right-hand sides, as well as its formulation as an abstract linear system.
IRJET- Emotion and Gender Classification in Real-TimeIRJET Journal
This document proposes a convolutional neural network (CNN) model for real-time face detection, gender classification, and emotion recognition. Separate models are trained for each task and then combined into a single pipeline. The architecture is designed to have high performance even on low-end systems. Two CNN models are developed - the first removes fully connected layers and the second further reduces parameters using depthwise separable convolutions. The combined pipeline can process images in 0.15 milliseconds with over 80% fewer parameters than baseline models, achieving human-level accuracy for gender classification and emotion recognition.
Garbage Classification Using Deep Learning TechniquesIRJET Journal
The document discusses using deep learning techniques for garbage classification. It compares the performance of different models, including support vector machines with HOG features, simple convolutional neural networks (CNNs), CNNs with residual blocks, and a hybrid model combining CNN features with HOG features. The CNN models generally performed best, with the simple CNN achieving over 93% accuracy on test data. Residual blocks did not significantly improve performance over simple CNNs. Combining CNN and HOG features was also considered but did not clearly outperform CNNs alone. Overall, CNN models were shown to effectively classify garbage using these image datasets.
This case study examines the impact of sales, fixed assets, and interest paid on the profitability of a major logistics company, GATI Limited, using multiple linear regression analysis. The regression analysis found that profitability is significantly and positively impacted by increases in fixed assets, and significantly and negatively impacted by increases in interest paid. Sales volume has a positive but minimal impact on profitability. Seasonality was also found to impact profitability. Overall, infrastructure development programs are expected to strengthen growth for the logistics industry by reducing costs, though current economic conditions remain challenging due to global slowdown.
This document presents an implementation and visualization of Dijkstra's shortest path algorithm using Python turtle. It describes Dijkstra's algorithm, discusses applications like map applications, provides equations and pseudocode to explain the methodology. It also discusses advantages like linear complexity, and limitations like not handling negative edges. The paper concludes by presenting results of testing the implementation, and discussing potential future work like applying the GPS concept used here to other shortest path algorithms.
IRJET- Approximate Multiplier and 8 Bit Dadda Multiplier Implemented through ...IRJET Journal
This document discusses the design and implementation of approximate multipliers for image processing applications. It proposes two new 4x4 approximate adders to reduce hardware complexity in a Dadda multiplier architecture. An 8x8 unsigned Dadda tree multiplier is modeled to evaluate the impact of using the proposed adders, which reduce the partial products into fewer columns while maintaining accuracy. Experimental results show the proposed multipliers achieve lower power-delay product compared to other approximate designs for similar precision in applications like JPEG image compression.
ABSTRACT: In the field of computer science known as "machine learning," a computer makes predictions about
the tasks it will perform next by examining the data that has been given to it. The computer can access data via
interacting with the environment or by using digitalized training sets. In contrast to static programming
algorithms, which require explicit human guidance, machine learning algorithms may learn from data and
generate predictions on their own. Various supervised and unsupervised strategies, including rule-based
techniques, logic-based techniques, instance-based techniques, and stochastic techniques, have been presented in
order to solve problems. Our paper's main goal is to present a comprehensive comparison of various cutting-edge
supervised machine learning techniques.
IRJET- 3D Object Recognition of Car Image DetectionIRJET Journal
This document summarizes research on 3D object recognition of car images using depth data from a Kinect sensor. The researchers used point cloud analysis techniques including VFH, CRH descriptors and ICP algorithms to match objects in 3D space. The approach involved preprocessing the point cloud to isolate individual objects, extracting descriptors, matching objects to models in a database, and verifying matches. Preliminary results showed the approach could successfully recognize objects like soda cans but performance was best at distances under 1 meter from the sensor. The goal is to enable applications like gesture controls and height estimation using 3D object detection.
Computational steering Interactive Design-through-Analysis for Simulation Sci...SURFevents
The document discusses computational steering and interactive design-through-analysis. It provides a vision of a unified computational framework that allows for rapid prototyping and accurate analysis of engineering designs. This framework would combine physics-informed machine learning for initial design exploration with isogeometric analysis for detailed analysis and optimization. The document then demonstrates some of the key concepts behind isogeometric analysis, including its use of B-spline basis functions to represent geometry, solutions, and right-hand sides, as well as its formulation as an abstract linear system.
IRJET- Emotion and Gender Classification in Real-TimeIRJET Journal
This document proposes a convolutional neural network (CNN) model for real-time face detection, gender classification, and emotion recognition. Separate models are trained for each task and then combined into a single pipeline. The architecture is designed to have high performance even on low-end systems. Two CNN models are developed - the first removes fully connected layers and the second further reduces parameters using depthwise separable convolutions. The combined pipeline can process images in 0.15 milliseconds with over 80% fewer parameters than baseline models, achieving human-level accuracy for gender classification and emotion recognition.
Partial Object Detection in Inclined Weather ConditionsIRJET Journal
This document provides a comprehensive analysis of imbalance problems in object detection. It presents a taxonomy to classify different types of imbalances and discusses solutions proposed in literature. The analysis highlights significant gaps including existing imbalances that require further attention, as well as entirely new imbalances that have never been addressed before. A survey of imbalance problems caused by weather conditions and common object imbalances is conducted. Methods for addressing imbalances include data augmentation using GANs and balancing training based on class performance.
This document summarizes a research paper that proposes a dynamic approach to improving the k-means clustering algorithm. The proposed approach aims to address two weaknesses of the standard k-means algorithm: its requirement of prior knowledge of the number of clusters k, and its sensitivity to initialization. The approach determines initial cluster centroids by segmenting the data space and selecting high-frequency segments. It then uses the silhouette validity index to dynamically determine the optimal number of clusters k, rather than requiring the user to specify k. The approach is compared to the standard k-means algorithm and other modified approaches, and is shown to improve initial center selection and reduce computation time.
The document describes a design for a low power 32x32 multiplier that combines Booth and Vedic multiplication architectures. It partitions each 32-bit input into two 16-bit blocks, uses 16x16 Booth multipliers to generate partial products for each block, and employs 16x16 Vedic multipliers and carry select adders to add the partial products. This combined architecture achieves lower power and faster performance than individual Booth or Vedic multipliers. The design is implemented using Xilinx Vivado and evaluated for applications such as floating point multiplication.
Machine Learning, K-means Algorithm Implementation with RIRJET Journal
This document discusses the implementation of the K-means clustering algorithm using R programming. It begins with an introduction to machine learning and the different types of machine learning algorithms. It then focuses on the K-means algorithm, describing the steps of the algorithm and how it is used for cluster analysis in unsupervised learning. The document then demonstrates implementing K-means clustering in R by generating sample data, initializing random centroids, calculating distances between data points and centroids, assigning data points to clusters based on closest centroid, recalculating centroids, and plotting the results. It concludes that K-means clustering is useful for gaining insights into dataset structure and was successfully implemented in R.
IRJET- Generating 3D Models Using 3D Generative Adversarial NetworkIRJET Journal
This document discusses using a 3D generative adversarial network (GAN) to generate 3D models without needing 3D modeling software. A 3D GAN uses 3D convolutional layers in both the generator and discriminator networks. The generator maps random noise to a 3D voxel space, and the discriminator tries to determine if a 3D model is real or generated. The networks are trained adversarially, with the generator trying to fool the discriminator and the discriminator trying to accurately classify models. The goal is for the generator to learn the data distribution and output realistic 3D models without supervision by sampling latent vectors and passing them through the generator network.
IRJET- Identification of Scene Images using Convolutional Neural Networks - A...IRJET Journal
This document summarizes research on using convolutional neural networks (CNNs) for scene image identification. It first discusses traditional object detection methods and their limitations. CNNs are presented as an improved approach, with convolutional, pooling and fully connected layers to extract features and classify images. Several popular CNN-based object detection algorithms are then summarized, including R-CNN, Fast R-CNN, Faster R-CNN and YOLO. The document concludes that CNN methods provide more accurate object identification compared to traditional algorithms due to their ability to learn from large datasets.
IRJET - Handwritten Bangla Digit Recognition using Capsule NetworkIRJET Journal
This document presents a study on using Capsule Networks for recognizing handwritten Bangla digits. The researchers trained a Capsule Network model on the NumtaDB dataset, which contains over 85,000 images of handwritten Bengali digits. Through preprocessing, regularization, and training the Capsule Network, they achieved a recognition accuracy of 99.91% on the test set. Capsule Networks outperformed other models for this task and provided an effective and lightweight solution for recognizing handwritten Bangla digits. Future work will focus on expanding the approach to recognize compound digits, mathematical signs, and equations.
This document summarizes a project that uses convolutional neural networks (CNN) for image classification. The project uses a dataset of 25,000 images categorized into 6 groups. A CNN model is designed and trained on the dataset using TensorFlow and Keras libraries to accurately classify new images. Django is used to build a web interface to integrate the trained CNN model. The CNN model architecture includes convolutional layers, ReLU layers, pooling layers, and fully connected layers. TensorFlow is used for object detection and classification with Keras. The trained model can classify images into the correct category with high accuracy.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Design a 3D CAD Model of a Stealth Aircraft and Generate Mesh to Optimize Mes...IRJET Journal
This document describes the process of creating a 3D CAD model of a stealth aircraft, cleaning the geometry, and generating a mesh to optimize mesh quality. The authors created the CAD model, checked it for errors, and then generated both a structured and unstructured mesh. They analyzed mesh quality parameters like aspect ratio, Jacobian ratio, warpage angle, and interior angles using the pre-processing software SimLab and HyperWorks. The quality reports showed over 99.5% of elements passed the various checks, indicating an optimized mesh was generated. This high-quality mesh will provide accurate results for design analysis simulations.
Dance With AI – An interactive dance learning platformIRJET Journal
This document describes a dance learning platform called Dance With AI that uses pose estimation and video comparison techniques. It uses the BlazePose algorithm to detect key points in a user's pose in real-time video and then compares the user's pose to a reference pose from an instructional video using Dynamic Time Warping (DTW). The system provides feedback to the user on how similar their pose is to the instructor's pose. It is intended to help children learn dance moves at home during the COVID pandemic by making dance interactive and game-like. The document reviews relevant literature on pose estimation and comparison techniques and provides test results showing the system can accurately assess pose similarity across different speeds and levels of dances.
This document presents Jeevn-Net, a new neural network architecture for brain tumor segmentation and overall survival prediction. Jeevn-Net uses a cascaded U-Net structure with two U-Nets and applies auto-encoder regularization. It takes in MRI scans and outputs a segmented tumor image with extracted features. Random forest regression is then used to predict survival based on these features. The network achieves state-of-the-art performance for brain tumor segmentation and survival prediction.
Here are the key advantages and disadvantages of arrays:
Advantages of arrays:
- Increased directivity - Arrays allow signals to be reinforced in desired directions while cancelled in others, providing improved directivity over a single antenna.
- Increased gain - The increased directivity of an array leads to higher gain compared to a single antenna. This allows for longer communication ranges.
- Beam steering - By adjusting the phase or time delay of signals to each antenna, the main transmission direction of an array can be steered electronically without moving physical elements.
Disadvantages of arrays:
- Increased complexity - Arrays require additional hardware for power distribution to each antenna element, as well as phase/time delay control circuitry
IRJET- Advanced Control Strategies for Mold Level ProcessIRJET Journal
This document discusses advanced control strategies for mold level process in continuous casting of steel. It proposes using a fuzzy controller to help control mold level during abnormal conditions like nozzle clogging/unclogging, which can be difficult for a proportional-integral-derivative controller to handle alone. The fuzzy controller design is based on operator expertise. Image processing techniques are also used to monitor mold level in real-time, including image segmentation using fuzzy clustering and classification using support vector machines. Simulation and online implementation results indicate the effectiveness of these advanced control methods in maintaining stable mold level during transient disturbances in the continuous casting process.
Graph Community Detection Algorithm for Distributed Memory Parallel Computing...Alexander Pozdneev
Community detection is an important problem that spans many research areas, such as social networks, systems biology, power grid optimization. The fine-grained communication and irregular access pattern to memory and interconnect limit the overall scalability and performance of existing algorithms. This talk presents a highly scalable parallel algorithm for distributed memory systems. The method employs a novel implementation strategy to store and process dynamic graphs. The scalability analysis of the algorithm was performed using two massively parallel machines, Blue Gene/Q and Power7-IH, for graphs with up to hundreds of billions of edges. Leveraging the convergence properties of the algorithm and the efficient implementation, it is possible to analyze communities of large-scale graphs in just a few seconds. The talk is based on a paper accepted for publication in IPDPS-2015 conference proceedings that was kindly provided by Dr. Fabrizio Petrini (IBM Research).
DEEP LEARNING BASED BRAIN STROKE DETECTIONIRJET Journal
This document discusses using deep learning and convolutional neural networks to detect brain strokes in CT scan images. It proposes a CNN model with four layers - convolution, pooling, flatten, and fully connected layers - to classify brain CT images as normal or showing signs of stroke. The CNN model was trained on brain CT images and able to accurately diagnose hemorrhages in the brain and detect strokes. This early detection of strokes using deep learning could help reduce death rates by enabling faster treatment.
IRJET - Finger Vein Extraction and Authentication System for ATMIRJET Journal
This document summarizes a research paper on a finger vein extraction and authentication system for ATMs. The system uses repeated line tracking during feature extraction to improve the analysis of 256 pixels in finger vein images. During preprocessing, images undergo binarization, edge detection to isolate the finger region of interest, and enhancement. Features are then extracted using the repeated line tracking before classification with support vector machines. The system was tested on images from 30 subjects and achieved a peak signal to noise ratio of 78.1443 for identification, demonstrating its potential for biometric authentication applications like ATMs.
This document describes a project to create a web-based e-learning tool called the Pathfinding Visualizer to visualize shortest path algorithms like Dijkstra's algorithm. The tool allows users to select an algorithm, place nodes on a grid, and visualize each step of the algorithm to find the shortest path. This helps improve understanding of complex graph algorithms through interactive visualization. The tool is intended to make computer science education more effective by bridging the gap between theoretical algorithms and practical understanding.
ANALYSIS OF LUNG NODULE DETECTION AND STAGE CLASSIFICATION USING FASTER RCNN ...IRJET Journal
This document presents a method for detecting and classifying lung nodules using Faster R-CNN technique. It first segments the lung from CT images and extracts features using Dual-Tree Complex Wavelet Transform. A Back Propagation Neural Network is then used to classify patterns of interstitial lung diseases detected in the images. Fuzzy clustering is also proposed to segment abnormal regions of the lung. The method aims to help identify and diagnose common lung diseases like pleural effusion and interstitial lung disease in an automated manner from CT images.
Towards Principled User-side Recommender Systemsjoisino
Ryoma Sato proposes a method called Consul for building user-side recommender systems when the system provided by a service like Twitter is unsatisfactory. Consul allows users to build recommender systems using only the information available to them through web pages, without having access to the full database. It does this while maintaining consistency with the official system, ensuring diversity in recommendations based on sensitive attributes, and being locally efficient without downloading all pages. Experiments show Consul performs as well as existing methods but is much more efficient due to its localized traversal of the recommendation graph. A case study demonstrates a user successfully building a new recommender system for Twitter using Consul.
More Related Content
Similar to Metric Recovery from Unweighted k-NN Graphs
Partial Object Detection in Inclined Weather ConditionsIRJET Journal
This document provides a comprehensive analysis of imbalance problems in object detection. It presents a taxonomy to classify different types of imbalances and discusses solutions proposed in literature. The analysis highlights significant gaps including existing imbalances that require further attention, as well as entirely new imbalances that have never been addressed before. A survey of imbalance problems caused by weather conditions and common object imbalances is conducted. Methods for addressing imbalances include data augmentation using GANs and balancing training based on class performance.
This document summarizes a research paper that proposes a dynamic approach to improving the k-means clustering algorithm. The proposed approach aims to address two weaknesses of the standard k-means algorithm: its requirement of prior knowledge of the number of clusters k, and its sensitivity to initialization. The approach determines initial cluster centroids by segmenting the data space and selecting high-frequency segments. It then uses the silhouette validity index to dynamically determine the optimal number of clusters k, rather than requiring the user to specify k. The approach is compared to the standard k-means algorithm and other modified approaches, and is shown to improve initial center selection and reduce computation time.
The document describes a design for a low power 32x32 multiplier that combines Booth and Vedic multiplication architectures. It partitions each 32-bit input into two 16-bit blocks, uses 16x16 Booth multipliers to generate partial products for each block, and employs 16x16 Vedic multipliers and carry select adders to add the partial products. This combined architecture achieves lower power and faster performance than individual Booth or Vedic multipliers. The design is implemented using Xilinx Vivado and evaluated for applications such as floating point multiplication.
Machine Learning, K-means Algorithm Implementation with RIRJET Journal
This document discusses the implementation of the K-means clustering algorithm using R programming. It begins with an introduction to machine learning and the different types of machine learning algorithms. It then focuses on the K-means algorithm, describing the steps of the algorithm and how it is used for cluster analysis in unsupervised learning. The document then demonstrates implementing K-means clustering in R by generating sample data, initializing random centroids, calculating distances between data points and centroids, assigning data points to clusters based on closest centroid, recalculating centroids, and plotting the results. It concludes that K-means clustering is useful for gaining insights into dataset structure and was successfully implemented in R.
IRJET- Generating 3D Models Using 3D Generative Adversarial NetworkIRJET Journal
This document discusses using a 3D generative adversarial network (GAN) to generate 3D models without needing 3D modeling software. A 3D GAN uses 3D convolutional layers in both the generator and discriminator networks. The generator maps random noise to a 3D voxel space, and the discriminator tries to determine if a 3D model is real or generated. The networks are trained adversarially, with the generator trying to fool the discriminator and the discriminator trying to accurately classify models. The goal is for the generator to learn the data distribution and output realistic 3D models without supervision by sampling latent vectors and passing them through the generator network.
IRJET- Identification of Scene Images using Convolutional Neural Networks - A...IRJET Journal
This document summarizes research on using convolutional neural networks (CNNs) for scene image identification. It first discusses traditional object detection methods and their limitations. CNNs are presented as an improved approach, with convolutional, pooling and fully connected layers to extract features and classify images. Several popular CNN-based object detection algorithms are then summarized, including R-CNN, Fast R-CNN, Faster R-CNN and YOLO. The document concludes that CNN methods provide more accurate object identification compared to traditional algorithms due to their ability to learn from large datasets.
IRJET - Handwritten Bangla Digit Recognition using Capsule NetworkIRJET Journal
This document presents a study on using Capsule Networks for recognizing handwritten Bangla digits. The researchers trained a Capsule Network model on the NumtaDB dataset, which contains over 85,000 images of handwritten Bengali digits. Through preprocessing, regularization, and training the Capsule Network, they achieved a recognition accuracy of 99.91% on the test set. Capsule Networks outperformed other models for this task and provided an effective and lightweight solution for recognizing handwritten Bangla digits. Future work will focus on expanding the approach to recognize compound digits, mathematical signs, and equations.
This document summarizes a project that uses convolutional neural networks (CNN) for image classification. The project uses a dataset of 25,000 images categorized into 6 groups. A CNN model is designed and trained on the dataset using TensorFlow and Keras libraries to accurately classify new images. Django is used to build a web interface to integrate the trained CNN model. The CNN model architecture includes convolutional layers, ReLU layers, pooling layers, and fully connected layers. TensorFlow is used for object detection and classification with Keras. The trained model can classify images into the correct category with high accuracy.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Design a 3D CAD Model of a Stealth Aircraft and Generate Mesh to Optimize Mes...IRJET Journal
This document describes the process of creating a 3D CAD model of a stealth aircraft, cleaning the geometry, and generating a mesh to optimize mesh quality. The authors created the CAD model, checked it for errors, and then generated both a structured and unstructured mesh. They analyzed mesh quality parameters like aspect ratio, Jacobian ratio, warpage angle, and interior angles using the pre-processing software SimLab and HyperWorks. The quality reports showed over 99.5% of elements passed the various checks, indicating an optimized mesh was generated. This high-quality mesh will provide accurate results for design analysis simulations.
Dance With AI – An interactive dance learning platformIRJET Journal
This document describes a dance learning platform called Dance With AI that uses pose estimation and video comparison techniques. It uses the BlazePose algorithm to detect key points in a user's pose in real-time video and then compares the user's pose to a reference pose from an instructional video using Dynamic Time Warping (DTW). The system provides feedback to the user on how similar their pose is to the instructor's pose. It is intended to help children learn dance moves at home during the COVID pandemic by making dance interactive and game-like. The document reviews relevant literature on pose estimation and comparison techniques and provides test results showing the system can accurately assess pose similarity across different speeds and levels of dances.
This document presents Jeevn-Net, a new neural network architecture for brain tumor segmentation and overall survival prediction. Jeevn-Net uses a cascaded U-Net structure with two U-Nets and applies auto-encoder regularization. It takes in MRI scans and outputs a segmented tumor image with extracted features. Random forest regression is then used to predict survival based on these features. The network achieves state-of-the-art performance for brain tumor segmentation and survival prediction.
Here are the key advantages and disadvantages of arrays:
Advantages of arrays:
- Increased directivity - Arrays allow signals to be reinforced in desired directions while cancelled in others, providing improved directivity over a single antenna.
- Increased gain - The increased directivity of an array leads to higher gain compared to a single antenna. This allows for longer communication ranges.
- Beam steering - By adjusting the phase or time delay of signals to each antenna, the main transmission direction of an array can be steered electronically without moving physical elements.
Disadvantages of arrays:
- Increased complexity - Arrays require additional hardware for power distribution to each antenna element, as well as phase/time delay control circuitry
IRJET- Advanced Control Strategies for Mold Level ProcessIRJET Journal
This document discusses advanced control strategies for mold level process in continuous casting of steel. It proposes using a fuzzy controller to help control mold level during abnormal conditions like nozzle clogging/unclogging, which can be difficult for a proportional-integral-derivative controller to handle alone. The fuzzy controller design is based on operator expertise. Image processing techniques are also used to monitor mold level in real-time, including image segmentation using fuzzy clustering and classification using support vector machines. Simulation and online implementation results indicate the effectiveness of these advanced control methods in maintaining stable mold level during transient disturbances in the continuous casting process.
Graph Community Detection Algorithm for Distributed Memory Parallel Computing...Alexander Pozdneev
Community detection is an important problem that spans many research areas, such as social networks, systems biology, power grid optimization. The fine-grained communication and irregular access pattern to memory and interconnect limit the overall scalability and performance of existing algorithms. This talk presents a highly scalable parallel algorithm for distributed memory systems. The method employs a novel implementation strategy to store and process dynamic graphs. The scalability analysis of the algorithm was performed using two massively parallel machines, Blue Gene/Q and Power7-IH, for graphs with up to hundreds of billions of edges. Leveraging the convergence properties of the algorithm and the efficient implementation, it is possible to analyze communities of large-scale graphs in just a few seconds. The talk is based on a paper accepted for publication in IPDPS-2015 conference proceedings that was kindly provided by Dr. Fabrizio Petrini (IBM Research).
DEEP LEARNING BASED BRAIN STROKE DETECTIONIRJET Journal
This document discusses using deep learning and convolutional neural networks to detect brain strokes in CT scan images. It proposes a CNN model with four layers - convolution, pooling, flatten, and fully connected layers - to classify brain CT images as normal or showing signs of stroke. The CNN model was trained on brain CT images and able to accurately diagnose hemorrhages in the brain and detect strokes. This early detection of strokes using deep learning could help reduce death rates by enabling faster treatment.
IRJET - Finger Vein Extraction and Authentication System for ATMIRJET Journal
This document summarizes a research paper on a finger vein extraction and authentication system for ATMs. The system uses repeated line tracking during feature extraction to improve the analysis of 256 pixels in finger vein images. During preprocessing, images undergo binarization, edge detection to isolate the finger region of interest, and enhancement. Features are then extracted using the repeated line tracking before classification with support vector machines. The system was tested on images from 30 subjects and achieved a peak signal to noise ratio of 78.1443 for identification, demonstrating its potential for biometric authentication applications like ATMs.
This document describes a project to create a web-based e-learning tool called the Pathfinding Visualizer to visualize shortest path algorithms like Dijkstra's algorithm. The tool allows users to select an algorithm, place nodes on a grid, and visualize each step of the algorithm to find the shortest path. This helps improve understanding of complex graph algorithms through interactive visualization. The tool is intended to make computer science education more effective by bridging the gap between theoretical algorithms and practical understanding.
ANALYSIS OF LUNG NODULE DETECTION AND STAGE CLASSIFICATION USING FASTER RCNN ...IRJET Journal
This document presents a method for detecting and classifying lung nodules using Faster R-CNN technique. It first segments the lung from CT images and extracts features using Dual-Tree Complex Wavelet Transform. A Back Propagation Neural Network is then used to classify patterns of interstitial lung diseases detected in the images. Fuzzy clustering is also proposed to segment abnormal regions of the lung. The method aims to help identify and diagnose common lung diseases like pleural effusion and interstitial lung disease in an automated manner from CT images.
Similar to Metric Recovery from Unweighted k-NN Graphs (20)
Towards Principled User-side Recommender Systemsjoisino
Ryoma Sato proposes a method called Consul for building user-side recommender systems when the system provided by a service like Twitter is unsatisfactory. Consul allows users to build recommender systems using only the information available to them through web pages, without having access to the full database. It does this while maintaining consistency with the official system, ensuring diversity in recommendations based on sensitive attributes, and being locally efficient without downloading all pages. Experiments show Consul performs as well as existing methods but is much more efficient due to its localized traversal of the recommendation graph. A case study demonstrates a user successfully building a new recommender system for Twitter using Consul.
CLEAR: A Fully User-side Image Search Systemjoisino
This document describes CLEAR, a fully user-side image search system developed by Ryoma Sato at Kyoto University. CLEAR allows users to build and publish their own image search engines without backend servers by formulating image search as a multi-armed bandit problem and implementing the system using only JavaScript on the client-side. This overcomes limitations of traditional search engines which require extensive resources to operate. CLEAR demonstrates that ordinary users can now develop customized image search tools.
Private Recommender Systems: How Can Users Build Their Own Fair Recommender S...joisino
JSSST 2022 https://jssst2022.wordpress.com/ における発表スライドです。
論文
Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? (SDM 2022)
arXiv: https://arxiv.org/abs/2105.12353
This document provides an introduction to spectral graph theory. It discusses how spectral graph theory connects combinatorics and algebra through studying graphs using eigenvalues and eigenvectors of adjacency matrices. It covers applications of spectral graph theory such as spectral clustering, which uses eigenvectors of the graph Laplacian as features for clustering nodes, and graph convolutional networks, which apply graph filtering and node-wise transformations to classify nodes in a graph.
第6回 統計・機械学習若手シンポジウムの公演で使用したユーザーサイド情報検索システムについてのスライドです。
https://sites.google.com/view/statsmlsymposium21/
Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data? (SDM 2022) https://arxiv.org/abs/2105.12353
Retrieving Black-box Optimal Images from External Databases (WSDM 2022) https://arxiv.org/abs/2112.14921
Random Features Strengthen Graph Neural Networksjoisino
This document proposes using random features to strengthen graph neural networks (GNNs) for node classification tasks. It summarizes that GNNs cannot distinguish nodes with identical features and are not universal approximators. By adding random features to each node, GNNs can distinguish nodes and tree views, allowing them to detect graph structures like triangles. Experiments on synthetic and real-world graphs show random feature GNNs outperform standard GNNs and are a simple way to boost GNN expressiveness and performance.
When I was asked to give a companion lecture in support of ‘The Philosophy of Science’ (https://shorturl.at/4pUXz) I decided not to walk through the detail of the many methodologies in order of use. Instead, I chose to employ a long standing, and ongoing, scientific development as an exemplar. And so, I chose the ever evolving story of Thermodynamics as a scientific investigation at its best.
Conducted over a period of >200 years, Thermodynamics R&D, and application, benefitted from the highest levels of professionalism, collaboration, and technical thoroughness. New layers of application, methodology, and practice were made possible by the progressive advance of technology. In turn, this has seen measurement and modelling accuracy continually improved at a micro and macro level.
Perhaps most importantly, Thermodynamics rapidly became a primary tool in the advance of applied science/engineering/technology, spanning micro-tech, to aerospace and cosmology. I can think of no better a story to illustrate the breadth of scientific methodologies and applications at their best.
Current Ms word generated power point presentation covers major details about the micronuclei test. It's significance and assays to conduct it. It is used to detect the micronuclei formation inside the cells of nearly every multicellular organism. It's formation takes place during chromosomal sepration at metaphase.
Or: Beyond linear.
Abstract: Equivariant neural networks are neural networks that incorporate symmetries. The nonlinear activation functions in these networks result in interesting nonlinear equivariant maps between simple representations, and motivate the key player of this talk: piecewise linear representation theory.
Disclaimer: No one is perfect, so please mind that there might be mistakes and typos.
dtubbenhauer@gmail.com
Corrected slides: dtubbenhauer.com/talks.html
Travis Hills' Endeavors in Minnesota: Fostering Environmental and Economic Pr...Travis Hills MN
Travis Hills of Minnesota developed a method to convert waste into high-value dry fertilizer, significantly enriching soil quality. By providing farmers with a valuable resource derived from waste, Travis Hills helps enhance farm profitability while promoting environmental stewardship. Travis Hills' sustainable practices lead to cost savings and increased revenue for farmers by improving resource efficiency and reducing waste.
Immersive Learning That Works: Research Grounding and Paths ForwardLeonel Morgado
We will metaverse into the essence of immersive learning, into its three dimensions and conceptual models. This approach encompasses elements from teaching methodologies to social involvement, through organizational concerns and technologies. Challenging the perception of learning as knowledge transfer, we introduce a 'Uses, Practices & Strategies' model operationalized by the 'Immersive Learning Brain' and ‘Immersion Cube’ frameworks. This approach offers a comprehensive guide through the intricacies of immersive educational experiences and spotlighting research frontiers, along the immersion dimensions of system, narrative, and agency. Our discourse extends to stakeholders beyond the academic sphere, addressing the interests of technologists, instructional designers, and policymakers. We span various contexts, from formal education to organizational transformation to the new horizon of an AI-pervasive society. This keynote aims to unite the iLRN community in a collaborative journey towards a future where immersive learning research and practice coalesce, paving the way for innovative educational research and practice landscapes.
The ability to recreate computational results with minimal effort and actionable metrics provides a solid foundation for scientific research and software development. When people can replicate an analysis at the touch of a button using open-source software, open data, and methods to assess and compare proposals, it significantly eases verification of results, engagement with a diverse range of contributors, and progress. However, we have yet to fully achieve this; there are still many sociotechnical frictions.
Inspired by David Donoho's vision, this talk aims to revisit the three crucial pillars of frictionless reproducibility (data sharing, code sharing, and competitive challenges) with the perspective of deep software variability.
Our observation is that multiple layers — hardware, operating systems, third-party libraries, software versions, input data, compile-time options, and parameters — are subject to variability that exacerbates frictions but is also essential for achieving robust, generalizable results and fostering innovation. I will first review the literature, providing evidence of how the complex variability interactions across these layers affect qualitative and quantitative software properties, thereby complicating the reproduction and replication of scientific studies in various fields.
I will then present some software engineering and AI techniques that can support the strategic exploration of variability spaces. These include the use of abstractions and models (e.g., feature models), sampling strategies (e.g., uniform, random), cost-effective measurements (e.g., incremental build of software configurations), and dimensionality reduction methods (e.g., transfer learning, feature selection, software debloating).
I will finally argue that deep variability is both the problem and solution of frictionless reproducibility, calling the software science community to develop new methods and tools to manage variability and foster reproducibility in software systems.
Exposé invité Journées Nationales du GDR GPL 2024
Remote Sensing and Computational, Evolutionary, Supercomputing, and Intellige...University of Maribor
Slides from talk:
Aleš Zamuda: Remote Sensing and Computational, Evolutionary, Supercomputing, and Intelligent Systems.
11th International Conference on Electrical, Electronics and Computer Engineering (IcETRAN), Niš, 3-6 June 2024
Inter-Society Networking Panel GRSS/MTT-S/CIS Panel Session: Promoting Connection and Cooperation
https://www.etran.rs/2024/en/home-english/
2. 2 / 45 KYOTO UNIVERSITY
I introduce my favorite topic and its applications
Metric recovery from unweighted k-NN graphs is my
recent favorite technique.
I like this technique because
The scope of applications is broad, and
The results are simple but non-trivial.
I first introduce this problem.
I then introduce my recent projects that used this technique.
- Towards Principled User-side Recommender
Systems (CIKM 2022)
- Graph Neural Networks can Recover the Hidden
Features Solely from the Graph Structure (ICML 2023)
3. 3 / 45 KYOTO UNIVERSITY
Metric Recovery from Unweighted k-NN Graphs
Morteza Alamgir, Ulrike von Luxburg. Shortest path distance in random k-nearest neighbor graphs. ICML 2012.
Tatsunori Hashimoto, Yi Sun, Tommi Jaakkola. Metric recovery from directed unweighted graphs. AISTATS 2015.
4. 4 / 45 KYOTO UNIVERSITY
k-NN graph is generated from a point cloud
We generate a k-NN graph from a point cloud.
Then, we discard the coordinates of nodes.
generate
edges
discard
coordinates
nodes have coordinates
for visualization
but they are random
5. 5 / 45 KYOTO UNIVERSITY
Metric recovery asks to estimate the coodinates
The original coordinates are hidden now.
Metric recovery from unweighted k-NN graphs is a problem
of estimating the coordinates from the k-NN graph.
estimate
6. 6 / 45 KYOTO UNIVERSITY
Only the existences of edges are observable
Unweighted means the edge lengths are neither available.
This is equivalent to the setting where only the 01-adjacency
matrix of the k-NN graph is available.
estimate
7. 7 / 45 KYOTO UNIVERSITY
Given 01-adjacency, estimate the coordinates
Problem (Metric Recovery from Unweighted k-NN Graphs)
In: The 01-adjacency matrix of a k-NN graph
Out: The latent coordinates of the nodes
Very simple.
estimate
8. 8 / 45 KYOTO UNIVERSITY
Why Is This Problem Challenging?
9. 9 / 45 KYOTO UNIVERSITY
Standard node embedding methods fail
The type of this problem is node embedding.
I.e., In: graph, Out: node embeddings.
However, the following example tells standard embeddings
techniques fail.
10. 10 / 45 KYOTO UNIVERSITY
Distance is opposite in the graph and latent space
The shortest-path distance between nodes A and B is 21.
The shortest-path distance between nodes A and C is 18.
Standard node embedding methods would embed node C
closer to A than node B to A, which is not consistent with
the ground truth latent coordinates.
10-NN graph
The coordinates are
supposed to be hidden,
but I show them for
illustration.
11. 11 / 45 KYOTO UNIVERSITY
Critical assumption does not hold
Embedding nodes that are close in the input graph close
is the critical assumption in various embedding methods.
This assumption does NOT hold in our situation.
10-NN graph
The coordinates are
supposed to be hidden,
but I show them for
illustration.
13. 13 / 45 KYOTO UNIVERSITY
Edge lengths are important
Why the previous example fails?
If the edge lengths were took into consideration,
the shortest path distance would be a consistent estimator of
the latent distance.
Step 1: Estimate the latent edge lengths.
10-NN graph
The coordinates are
supposed to be hidden,
but I show them for
illustration.
14. 14 / 45 KYOTO UNIVERSITY
Densities are important
Observation: Edges are longer in sparse regions
and shorter in dense regions.
Step 2: Estimate the densities.
But how? We do not know the coordinates of the points...
10-NN graph
The coordinates are
supposed to be hidden,
but I show them for
illustration.
15. 15 / 45 KYOTO UNIVERSITY
Density can be estimated from PageRank
Solution: A PageRank-like estimator solves it.
The stationary distribution of random walks (plus a simple
transformation) is a consistent estimator of the density.
The higher the rank is, the denser there is.
This can be computed solely from the unweighted graph.
10-NN graph
Stationary distribution
of simple random walks
≈ PageRank
16. 16 / 45 KYOTO UNIVERSITY
Given 01-adjacency, estimate the coordinates
Problem definition (again)
In: The 01-adjacency matrix of a k-NN graph
Out: The latent coordinates of the nodes
Very simple.
estimate
17. 17 / 45 KYOTO UNIVERSITY
Procedure to estimate the coordinates
1. Compute the stationary distribution of random walks.
2. Estimate the density around each node.
3. Estimate the edge lengths using the estimated densities.
4. Compute the shortest path distances using the estimated
edge lengths and compute the distance matrix.
5. Estimate the coordinates from the distance matrix
by, e.g., multidimentional scaling.
This is a consistent estimator [Hashimoto+ AISTATS 2015].
Tatsunori Hashimoto, Yi Sun, Tommi Jaakkola. Metric recovery from directed unweighted graphs. AISTATS 2015.
(up to rigid transform)
18. 18 / 45 KYOTO UNIVERSITY
We can recover the coordinates consistently
The latent coordinates can be consistently estimated
solely from the unweighted k-NN graph.
Take Home Message
19. 19 / 45 KYOTO UNIVERSITY
Towards Principled User-side Recommender Systems (CIKM 2022)
Ryoma Sato. Towards Principled User-side Recommender Systems. CIKM 2022.
20. 20 / 45 KYOTO UNIVERSITY
Let’s consider item-to-item recommendations
We consider item-to-item recommendations.
Ex: “Products related to this item” panel in Amazon.com.
21. 21 / 45 KYOTO UNIVERSITY
User-side recsys realizes user’s desiderata
Problem: We are unsatisfactory with the official recommender
system.
It provides monotone recommendations.
We need serendipity.
It provides recommendations biased towards specific
companies or countries.
User-side recommender systems [Sato 2022] enable users
to build their own recommender systems that satisfy their
desiderata even when the official one does not support them.
Ryoma Sato. Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without
Log Data? SDM 2022.
22. 22 / 45 KYOTO UNIVERSITY
We need powerful and principled user-side Recsys
[Sato 2022]’s user-side recommender system is realized in an
ad-hoc manner, and the performance is not so high.
We need a way to build user-side recommender systems in a
systematic manner and a more powerful one.
Hopefully one that is as strong as the official one.
Ryoma Sato. Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without
Log Data? SDM 2022.
23. 23 / 45 KYOTO UNIVERSITY
Official (traditional) recommender systems
Recsys
Algorithm
log data
catalog
auxiliary data
Ingredients
Recsys model
sourece item
Step 1. training
Step 2. inference
recommendations
Official (traditional) recsys
24. 24 / 45 KYOTO UNIVERSITY
Users cannot see the data, algorithm, and model
Recsys
Algorithm
log data
catalog
auxiliary data
Ingredients
Recsys model
sourece item
recommendations
These parts are not
observable for users
(industrial secrets)
25. 25 / 45 KYOTO UNIVERSITY
How can we build our Recsys without them?
Recsys
Algorithm
log data
catalog
auxiliary data
Ingredients
Recsys model
sourece item
recommendations
But they are crucial
information to build
new Recsys...
26. 26 / 45 KYOTO UNIVERSITY
We assume the model is embedding-based
Recsys
Algorithm
log data
catalog
auxiliary data
Ingredients
Recsys model
sourece item
recommendations
(Slight) Assumption:
The model embeds items and
recommends near items.
This is a common strategy in Recsys.
We do not assume the way it embeds.
It can be matrix factorization,
neural networks, etc.
27. 27 / 45 KYOTO UNIVERSITY
We can observe k-NN graph of the embeddings
Recsys
Algorithm
log data
catalog
auxiliary data
Ingredients
Recsys model
sourece item
recommendations
Observation:
These outputs have sufficient information
to construct the unweighted k-NN graph.
I.e., users can build the k-NN graph by
accessing each item page, and observing
what the neighboring items are.
28. 28 / 45 KYOTO UNIVERSITY
We can estimate the embeddings!
Recsys
Algorithm
log data
catalog
auxiliary data
Ingredients
Recsys model
sourece item
recommendations
Solution:
Estimate the item embeddings of
the official Recsys.
They are considered to be secret,
but we can estimate them from
the weighted k-NN graph!
They contain much information!
29. 29 / 45 KYOTO UNIVERSITY
We realize our desiderata with the embeddings
We can do many things with the estimated embeddings.
We can compute recommendations by ourselves and
with our own postprocessings.
If you want more serendipity,
recommend 1st, 2nd, 4th, 8th, ... and 32nd nearest items
or add noise to the embeddings.
If you want to decrease the bias to specific companies,
add negative biases to the score of these items so as to
suppress these companies.
30. 30 / 45 KYOTO UNIVERSITY
Experiments validated the theory
In the experiments
I conducted simulations
and showed that the hidden
item embeddings can be
estimated accurately.
I built a fair Recsys for Twitter, which runs
in the real-world, on the user’s side.
Even though the official Recsys
is not fair w.r.t. gender, mine is, and
it is more efficient than the existing one.
31. 31 / 45 KYOTO UNIVERSITY
Users can recover the item embeddings
Users can “reverse engineer” the official item
embeddings solely from the observable information.
Take Home Message
32. 32 / 45 KYOTO UNIVERSITY
Graph Neural Networks can Recover the Hidden Features
Solely from the Graph Structure (ICML 2023)
Ryoma Sato. Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure. ICML 2023.
33. 33 / 45 KYOTO UNIVERSITY
We call for the theory for GNNs
Graph Neural Networks (GNNs) take a graph with node
features as input and output node embeddings.
GNNs is a popular choice in various graph-related tasks.
GNNs are so popular that understanding GNNs by theory is
an important topic in its own right.
e.g., What is the hypothesis space of GNNs?
(GNNs do not have a universal approximation power.)
Why GNNs work well in so many tasks?
34. 34 / 45 KYOTO UNIVERSITY
GNNs apply filters to node features
GNNs apply filters to the input node features and extract
useful features.
The input node features have long been considered
to be the key to success.
If the features have no useful signals, GNNs will not work.
35. 35 / 45 KYOTO UNIVERSITY
Good node features are not always available
However, informative node features are not always available.
E.g., social network user information may be hidden for
privacy reasons.
36. 36 / 45 KYOTO UNIVERSITY
Uninformative features degrade the performance
If we have no features at hand, we usually input
uninformative node features such as the degree features.
No matter how such features are filtered, only uninformative
embeddings are obtained.
“garbage in, garbage out.”
This is common sense.
37. 37 / 45 KYOTO UNIVERSITY
Can GNNs work with uninformative node features?
Research question I want to answer in this project:
Do GNNs really not work when the input node features
are uninformative?
In practice, GNNs sometimes work just with degree features.
The reason is a mystery, which I want to elucidate.
38. 38 / 45 KYOTO UNIVERSITY
We assume latent node features behind the graph
(Slight) Assumption:
The graph structure is formed by connecting nodes whose
latent node features z*
v
are close to each other.
The latent node features z*
v
are not an observable
e.g., "true user preference vector"
Latent features that contain users’
preferences, workplace, residence, etc.
Those who have similar
preferences and residence
have connections.
We can only observe the way they are
connected, not the coordinates.
39. 39 / 45 KYOTO UNIVERSITY
GNNs can recover the lantent feature
Main results:
GNNs can recover the latent node features z*
v
even when the
input node features are uninformative.
z*
v
contains the preferences of users, which is useful for tasks.
40. 40 / 45 KYOTO UNIVERSITY
GNNs create useful node features themselves
GNNs can create completely new and useful node
features by absorbing information from the graph structure,
even when the input node features are uninformative.
A new perspective that overturns the existing view of filtering
input node features.
41. 41 / 45 KYOTO UNIVERSITY
GNNs can recover the coordinates with some tricks
How to prove it?
→ Metric recovery from k-NN graphs as you may expect.
But be careful when you apply it.
What GNNs can do (the hypothesis space of GNNs) is limited.
The metric recovery algorithm is compatible with GNNs.
Stationary distribution → GNNs can do random walks.
Shortest path → GNNs can simulate Bellman-Ford.
MDS → This is a bit tricky part. We send the matrix to
some nodes and solve it locally.
GNNs can recover the metric with slight additional errors.
42. 42 / 45 KYOTO UNIVERSITY
Recovered features are empicirally useful
In the experiments,
We empirically confirmed
this phenomenon.
The recovered features are useful for various downstream tasks,
even when the input features xsyn
are uninformative.
43. 43 / 45 KYOTO UNIVERSITY
GNNs can create useful features by themselves
GNNs can create useful node features by absorbing
information from the underlying graph.
Take Home Message
45. 45 / 45 KYOTO UNIVERSITY
I introduced my favorite topic and its applications
Metric recovery from unweighted k-NN graphs is my
recent favorite technique.
I like this technique because
The scope of applications is broad, and
The results are simple but non-trivial.
The latent coordinates can be consistently estimated
solely from the unweighted k-NN graph.
Take Home Message