Comparative analysis of machine and deep learning models for soil properties prediction from hyperspectral visual band
- Authors: Datta, Dristi , Paul, Manoranjan , Murshed, Manzur , Teng, Shyh Wei , Schmidtke, Leigh
- Date: 2023
- Type: Text , Journal article
- Relation: Environments Vol. 10, no. 5 (2023), p. 77
- Full Text:
- Reviewed:
- Description: Estimating various properties of soil, including moisture, carbon, and nitrogen, is crucial for studying their correlation with plant health and food production. However, conventional methods such as oven-drying and chemical analysis are laborious, expensive, and only feasible for a limited land area. With the advent of remote sensing technologies like multi/hyperspectral imaging, it is now possible to predict soil properties non-invasive and cost-effectively for a large expanse of bare land. Recent research shows the possibility of predicting those soil contents from a wide range of hyperspectral data using good prediction algorithms. However, these kinds of hyperspectral sensors are expensive and not widely available. Therefore, this paper investigates different machine and deep learning techniques to predict soil nutrient properties using only the red (R), green (G), and blue (B) bands data to propose a suitable machine/deep learning model that can be used as a rapid soil test. Another objective of this research is to observe and compare the prediction accuracy in three cases i. hyperspectral band ii. full spectrum of the visual band, and iii. three-channel of RGB band and provide a guideline to the user on which spectrum information they should use to predict those soil properties. The outcome of this research helps to develop a mobile application that is easy to use for a quick soil test. This research also explores learning-based algorithms with significant feature combinations and their performance comparisons in predicting soil properties from visual band data. For this, we also explore the impact of dimensional reduction (i.e., principal component analysis) and transformations (i.e., empirical mode decomposition) of features. The results show that the proposed model can comparably predict the soil contents from the three-channel RGB data.
Soil moisture, organic carbon, and nitrogen content prediction with hyperspectral data using regression models
- Authors: Datta, Dristi , Paul, Manoranjan , Murshed, Manzur , Teng, Shyh Wei , Schmidtke, Leigh
- Date: 2022
- Type: Text , Journal article
- Relation: Sensors (Basel, Switzerland) Vol. 22, no. 20 (2022), p.
- Full Text:
- Reviewed:
- Description: Soil moisture, soil organic carbon, and nitrogen content prediction are considered significant fields of study as they are directly related to plant health and food production. Direct estimation of these soil properties with traditional methods, for example, the oven-drying technique and chemical analysis, is a time and resource-consuming approach and can predict only smaller areas. With the significant development of remote sensing and hyperspectral (HS) imaging technologies, soil moisture, carbon, and nitrogen can be estimated over vast areas. This paper presents a generalized approach to predicting three different essential soil contents using a comprehensive study of various machine learning (ML) models by considering the dimensional reduction in feature spaces. In this study, we have used three popular benchmark HS datasets captured in Germany and Sweden. The efficacy of different ML algorithms is evaluated to predict soil content, and significant improvement is obtained when a specific range of bands is selected. The performance of ML models is further improved by applying principal component analysis (PCA), a dimensional reduction method that works with an unsupervised learning method. The effect of soil temperature on soil moisture prediction is evaluated in this study, and the results show that when the soil temperature is considered with the HS band, the soil moisture prediction accuracy does not improve. However, the combined effect of band selection and feature transformation using PCA significantly enhances the prediction accuracy for soil moisture, carbon, and nitrogen content. This study represents a comprehensive analysis of a wide range of established ML regression models using data preprocessing, effective band selection, and data dimension reduction and attempt to understand which feature combinations provide the best accuracy. The outcomes of several ML models are verified with validation techniques and the best- and worst-case scenarios in terms of soil content are noted. The proposed approach outperforms existing estimation techniques.
Web of students : class-level friendship network discovery from educational big data
- Authors: Guo, Teng , Tang, Tang , Zhang, Dongyu , Li, Jianxin , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 22nd International Conference on Web Information Systems Engineering, WISE 2021 p. 497-511
- Full Text: false
- Reviewed:
- Description: Classmate friendships are a major aspect of university social experience. Taking classes together is one of the main ways for students to build friendships. Consequently, class-level friendship networks have attracted tremendous attention from researchers. They are also very useful in student support and early intervention. However, these networks are normally invisible for educators. Discovering such an important web of students effectively is a pressing problem. Against this background, we propose a data-driven framework called CANDY which automatically discovers the class-level friendship networks based on educational big data. We first represent features through representation learning methods. Secondly, the data is augmented with the randomly shuffling method. Thirdly, a conditional generative adversarial network model is used to mine the class-level friendship networks. A deep adversarial optimization strategy is proposed here for problems caused by network sparsity. To evaluate the performance of the proposed approach, we build a real-world dataset that contains rich student information. Extensive experiments have been conducted and the results demonstrate the effectiveness of our framework. © 2021, Springer Nature Switzerland AG.
Bidirectional mapping coupled GAN for generalized zero-shot learning
- Authors: Shermin, Tasfia , Teng, Shyh , Sohel, Ferdous , Murshed, Manzur , Lu, Guojun
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Image Processing Vol. 31, no. (2022), p. 721-733
- Full Text:
- Reviewed:
- Description: Bidirectional mapping-based generalized zero-shot learning (GZSL) methods rely on the quality of synthesized features to recognize seen and unseen data. Therefore, learning a joint distribution of seen-unseen classes and preserving the distinction between seen-unseen classes is crucial for GZSL methods. However, existing methods only learn the underlying distribution of seen data, although unseen class semantics are available in the GZSL problem setting. Most methods neglect retaining seen-unseen classes distinction and use the learned distribution to recognize seen and unseen data. Consequently, they do not perform well. In this work, we utilize the available unseen class semantics alongside seen class semantics and learn joint distribution through a strong visual-semantic coupling. We propose a bidirectional mapping coupled generative adversarial network (BMCoGAN) by extending the concept of the coupled generative adversarial network into a bidirectional mapping model. We further integrate a Wasserstein generative adversarial optimization to supervise the joint distribution learning. We design a loss optimization for retaining distinctive information of seen-unseen classes in the synthesized features and reducing bias towards seen classes, which pushes synthesized seen features towards real seen features and pulls synthesized unseen features away from real seen features. We evaluate BMCoGAN on benchmark datasets and demonstrate its superior performance against contemporary methods. © 1992-2012 IEEE.
Rectified softmax loss with all-sided cost sensitivity for age estimation
- Authors: Li, Daxiang , Ma, Xuan , Ren, Yaqiong , Teng, Shyh-Wei
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 32551-32563
- Full Text:
- Reviewed:
- Description: In Convolutional Neural Network (ConvNet) based age estimation algorithms, softmax loss is usually chosen as the loss function directly, and the problems of Cost Sensitivity (CS), such as class imbalance and misclassification cost difference between different classes, are not considered. Focus on these problems, this paper constructs a rectified softmax loss function with all-sided CS, and proposes a novel cost-sensitive ConvNet based age estimation algorithm. Firstly, a loss function is established for each age category to solve the imbalance of the number of training samples. Then, a cost matrix is defined to reflect the cost difference caused by misclassification between different classes, thus constructing a new cost-sensitive error function. Finally, the above methods are merged to construct a rectified softmax loss function for ConvNet model, and a corresponding Back Propagation (BP) training scheme is designed to enable ConvNet network to learn robust face representation for age estimation during the training phase. Simultaneously, the rectified softmax loss is theoretically proved that it satisfies the general conditions of the loss function used for classification. The effectiveness of the proposed method is verified by experiments on face image datasets of different races. © 2013 IEEE.
Efficient data gathering in 3D linear underwater wireless sensor networks using sink mobility
- Authors: Akbar, Mariam , Javaid, Nadeem , Khan, Ayesha , Imran, Muhammad , Shoaib, Muhammad , Vasilakos, Athanasios
- Date: 2016
- Type: Text , Journal article
- Relation: Sensors (Switzerland) Vol. 16, no. 3 (2016), p.
- Full Text:
- Reviewed:
- Description: Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. © 2016 by the authors; licensee MDPI, Basel, Switzerland.
Ode to form
- Authors: Mestrom, Sanne
- Date: 2012
- Type: Text , Visual art work
- Full Text:
Conical averagedness and convergence analysis of fixed point algorithms
- Authors: Bartz, Sedi , Dao, Minh , Phan, Hung
- Date: 2022
- Type: Text , Journal article
- Relation: Journal of Global Optimization Vol. 82, no. 2 (2022), p. 351-373
- Full Text:
- Reviewed:
- Description: We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged operators are systematically investigated, in particular, the stability under relaxations, convex combinations and compositions. We derive conical averagedness properties of resolvents of generalized monotone operators. These properties are then utilized in order to analyze the convergence of the proximal point algorithm, the forward–backward algorithm, and the adaptive Douglas–Rachford algorithm. Our study unifies, improves and casts new light on recent studies of these topics. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Distortion robust image classification using deep convolutional neural network with discrete cosine transform
- Authors: Hossain, Md Tahmid , Teng, Shyh Wei , Zhang, Dengsheng , Lim, Suryani , Lu, Guojun
- Date: 2019
- Type: Text , Conference proceedings
- Relation: 2019 IEEE International Conference on Image Processing (ICIP);Taipei, Taiwan; 22-25 Sept, 2019 p. 659-663
- Full Text: false
- Reviewed:
- Description: Convolutional Neural Networks are highly effective for image classification. However, it is still vulnerable to image distortion. Even a small amount of noise or blur can severely hamper the performance of these CNNs. Most work in the literature strives to mitigate this problem simply by fine-tuning a pre-trained CNN on mutually exclusive or a union set of distorted training data. This iterative fine-tuning process with all known types of distortion is exhaustive and the network struggles to handle unseen distortions. In this work, we propose distortion robust DCT-Net, a Discrete Cosine Transform based module integrated into a deep network which is built on top of VGG16 [1]. Unlike other works in the literature, DCT-Net is "blind" to the distortion type and level in an image both during training and testing. The DCT-Net is trained only once and applied in a more generic situation without further retraining. We also extend the idea of dropout and present a training adaptive version of the same. We evaluate our proposed DCT-Net on a number of benchmark datasets. Our experimental results show that once trained, DCT-Net not only generalizes well to a variety of unseen distortions but also outperforms other comparable networks in the literature.
Lost at starting line : predicting maladaptation of university freshmen based on educational big data
- Authors: Guo, Teng , Bai, Xiaomei , Zhen, Shihao , Abid, Shagufta , Xia, Feng
- Date: 2023
- Type: Text , Journal article
- Relation: Journal of the Association for Information Science and Technology Vol. 74, no. 1 (2023), p. 17-32
- Full Text:
- Reviewed:
- Description: The transition from secondary education to higher education could be challenging for most freshmen. For students who fail to adjust to university life smoothly, their status may worsen if the university cannot offer timely and proper guidance. Helping students adapt to university life is a long-term goal for any academic institution. Therefore, understanding the nature of the maladaptation phenomenon and the early prediction of “at-risk” students are crucial tasks that urgently need to be tackled effectively. This article aims to analyze the relevant factors that affect the maladaptation phenomenon and predict this phenomenon in advance. We develop a prediction framework (MAladaptive STudEnt pRediction, MASTER) for the early prediction of students with maladaptation. First, our framework uses the SMOTE (Synthetic Minority Oversampling Technique) algorithm to solve the data label imbalance issue. Moreover, a novel ensemble algorithm, priority forest, is proposed for outputting ranks instead of binary results, which enables us to perform proactive interventions in a prioritized manner where limited education resources are available. Experimental results on real-world education datasets demonstrate that the MASTER framework outperforms other state-of-art methods. © 2022 The Authors. Journal of the Association for Information Science and Technology published by Wiley Periodicals LLC on behalf of Association for Information Science and Technology.
DEFINE: friendship detection based on node enhancement
- Authors: Pan, Hanxiao , Guo, Teng , Bedru, Hayat , Qing, Qing , Zhang, Dongyu , Xia, Feng
- Date: 2020
- Type: Text , Conference paper
- Relation: 31st Australasian Database Conference, ADC 2019 Vol. 12008 LNCS, p. 81-92
- Full Text:
- Reviewed:
- Description: Network representation learning (NRL) is a matter of importance to a variety of tasks such as link prediction. Learning low-dimensional vector representations for node enhancement based on nodes attributes and network structures can improve link prediction performance. Node attributes are important factors in forming networks, like psychological factors and appearance features affecting friendship networks. However, little to no work has detected friendship using the NRL technique, which combines students’ psychological features and perceived traits based on facial appearance. In this paper, we propose a framework named DEFINE (No enhancement based r e dship D tection) to detect students’ friend relationships, which combines with students’ psychological factors and facial perception information. To detect friend relationships accurately, DEFINE uses the NRL technique, which considers network structure and the additional attributes information for nodes. DEFINE transforms them into low-dimensional vector spaces while preserving the inherent properties of the friendship network. Experimental results on real-world friendship network datasets illustrate that DEFINE outperforms other state-of-art methods. © 2020, Springer Nature Switzerland AG.
- Description: E1
Multimodal educational data fusion for students' mental health detection
- Authors: Guo, Teng , Zhao, Wenhong , Alrashoud, Mubarak , Tolba, Amr , Firmin, Sally , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Access Vol. 10, no. (2022), p. 70370-70382
- Full Text:
- Reviewed:
- Description: Mental health issues can lead to serious consequences like depression, self-mutilation, and worse, especially for university students who are not physically and mentally mature. Not all students with poor mental health are aware of their situation and actively seek help. Proactive detection of mental problems is a critical step in addressing this issue. However, accurate detections are hard to achieve due to the inherent complexity and heterogeneity of unstructured multi-modal data generated by campus life. Against this background, we propose a detection framework for detecting students' mental health, named CASTLE (educational data fusion for mental health detection). Three parts are involved in this framework. First, we utilize representation learning to fuse data on social life, academic performance, and physical appearance. An algorithm, named MOON (multi-view social network embedding), is proposed to represent students' social life in a comprehensive way by fusing students' heterogeneous social relations effectively. Second, a synthetic minority oversampling technique algorithm (SMOTE) is applied to the label imbalance issue. Finally, a DNN (deep neural network) model is utilized for the final detection. The extensive results demonstrate the promising performance of the proposed methods in comparison to an extensive range of state-of-the-art baselines. © 2013 IEEE.
Risk assessment of SARS-CoV-2 in Antarctic wildlife
- Authors: Barbosa, Andres , Varsani, Arvind , Morandini, Virginia , Grimaldi, Wray , Vanstreels, Ralph , Diaz, Julia , Boulinier, Thierry , Dewar, Meagan , González-Acuña, Daniel , Gray, Rachael , McMahon, Clive , Miller, Gary , Power, Michelle , Gamble, Amandine , Wille, Michelle
- Date: 2021
- Type: Text , Journal article
- Relation: Science of the Total Environment Vol. 755, no. 2 (2021), p. 1-8
- Full Text:
- Reviewed:
- Description: The coronavirus disease 2019 (COVID-19) pandemic is caused by the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). This pathogen has spread rapidly across the world, causing high numbers of deaths and significant social and economic impacts. SARS-CoV-2 is a novel coronavirus with a suggested zoonotic origin with the potential for cross-species transmission among animals. Antarctica can be considered the only continent free of SARS-CoV-2. Therefore, concerns have been expressed regarding the potential human introduction of this virus to the continent through the activities of research or tourism to minimise the effects on human health, and the potential for virus transmission to Antarctic wildlife. We assess the reverse-zoonotic transmission risk to Antarctic wildlife by considering the available information on host susceptibility, dynamics of the infection in humans, and contact interactions between humans and Antarctic wildlife. The environmental conditions in Antarctica seem to be favourable for the virus stability. Indoor spaces such as those at research stations, research vessels or tourist cruise ships could allow for more transmission among humans and depending on their movements between different locations the virus could be spread across the continent. Among Antarctic wildlife previous in silico analyses suggested that cetaceans are at greater risk of infection whereas seals and birds appear to be at a low infection risk. However, caution needed until further research is carried out and consequently, the precautionary principle should be applied. Field researchers handling animals are identified as the human group posing the highest risk of transmission to animals while tourists and other personnel pose a significant risk only when in close proximity (< 5 m) to Antarctic fauna. We highlight measures to reduce the risk as well as identify of knowledge gaps related to this issue. © 2020 The Authors
On the regularity of weak solutions of the boussinesq equations in besov spaces
- Authors: Barbagallo, Annamaria , Gala, Sadek , Ragusa, Maria , Théra, Michel
- Date: 2021
- Type: Text , Journal article
- Relation: Vietnam Journal of Mathematics Vol. 49, no. 3 (2021), p. 637-649
- Relation: http://purl.org/au-research/grants/arc/DP160100854
- Full Text:
- Reviewed:
- Description: The main issue addressed in this paper concerns an extension of a result by Z. Zhang who proved, in the context of the homogeneous Besov space Ḃ
Assessing nitrate contamination risks in groundwater : a machine learning approach
- Authors: Awais, Muhammad , Aslam, Bilal , Maqsoom, Ahsen , Khalil, Umer , Imran, Muhammad
- Date: 2021
- Type: Text , Journal article
- Relation: Applied Sciences (Switzerland) Vol. 11, no. 21 (2021), p.
- Full Text:
- Reviewed:
- Description: Groundwater is one of the primary sources for the daily water requirements of the masses, but it is subjected to contamination due to the pollutants, such as nitrate, percolating through the soil with water. Especially in built-up areas, groundwater vulnerability and contamination are of major concern, and require appropriate consideration. The present study develops a novel framework for assessing groundwater nitrate contamination risk for the area along the Karakoram Highway, which is a part of the China Pakistan Economic Corridor (CPEC) route in northern Pakistan. A groundwater vulnerability map was prepared using the DRASTIC model. The nitrate concentration data from a previous study were used to formulate the nitrate contamination map. Three machine learning (ML) models, i.e., Support Vector Machine (SVM), Multivariate Discriminant Analysis (MDA), and Boosted Regression Trees (BRT), were used to analyze the probability of groundwater contamination incidence. Furthermore, groundwater contamination probability maps were obtained utilizing the ensemble modeling approach. The models were calibrated and validated through calibration trials, using the area under the receiver operating characteristic curve method (AUC), where a minimum AUC threshold value of 80% was achieved. Results indicated the accuracy of the models to be in the range of 0.82–0.87. The final groundwater contamination risk map highlights that 34% of the area is moderately vulnerable to groundwater contamination, and 13% of the area is exposed to high groundwater contamination risk. The findings of this study can facilitate decision-making regarding the location of future built-up areas properly in order to mitigate the nitrate contamination that can further reduce the associated health risks. © 2021 by the authors. Licensee MDPI, Basel, Switzerland. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Muhammad Imran” is provided in this record**
ANSWER : generating information dissemination network on campus
- Authors: Qing, Qing , Guo, Teng , Zhang, Dongyu , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 32nd Australasian Database Conference, ADC 2021 Vol. 12610 LNCS, p. 74-86
- Full Text:
- Reviewed:
- Description: Information dissemination matters, both on an individual and group level. For college students who are physically and mentally immature, they are more sensitive and susceptible to unnormal information like rumors. However, current researches focus on large-scale online message sharing networks like Facebook and Twitter, rather than profile the information dissemination on campus, which fail to provide any references for daily campus management. Against this background, we propose a framework to generate the information dissemination network on campus, named ANSWER (cAmpus iNformation diSsemination netWork gEneRation), based on multimodal data including behavior data, appearance data, and psychological data. The construction of the ANSWER is listed as four steps. First, we use a convolutional autoencoder to extract the students’ facial features. Second, we process the behavior data to construct a friendship network. Third, heterogeneous information is embedded in the low-dimensional vector space by using network representation learning to obtain embedding vectors. Fourth, we use the deep learning model to predict. The experiment results show that ANSWER outperforms other methods in multiple feature fusion and prediction of information dissemination relationship performance. © 2021, Springer Nature Switzerland AG.
A new regularity criterion of weak solutions to the 3D micropolar fluid flows in terms of the pressure
- Authors: Gala, Sadek , Ragusa, Maria , Théra, Michel
- Date: 2021
- Type: Text , Journal article
- Relation: Bolletino dell Unione Matematica Italiana Vol. 14, no. 2 (2021), p. 331-337
- Relation: http://purl.org/au-research/grants/arc/DP160100854
- Full Text:
- Reviewed:
- Description: In this study, we establish a new regularity criterion of weak solutions to the three-dimensional micropolar fluid flows by imposing a critical growth condition on the pressure field. © 2020, Unione Matematica Italiana.
In your face : sentiment analysis of metaphor with facial expressive features
- Authors: Zhang, Dongyu , Zhang, Minghao , Guo, Teng , Peng, Ciyuan , Saikrishna, Vidya , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 International Joint Conference on Neural Networks, IJCNN 2021 Vol. 2021-July
- Full Text:
- Reviewed:
- Description: Metaphor plays an important role in human communication, which often conveys and evokes sentiments. Numerous approaches to sentiment analysis of metaphors have thus gained attention in natural language processing (NLP). The primary focus of these approaches is on linguistic features and text rather than other modal information and data. However, visual features such as facial expressions also play an important role in expressing sentiments. In this paper, we present a novel neural network approach to sentiment analysis of metaphorical expressions that combines both linguistic and visual features and refer to it as the multimodal model approach. For this, we create a Chinese dataset, containing textual data from metaphorical sentences along with visual data on synchronized facial images. The experimental results indicate that our multimodal model outperforms several other linguistic and visual models, and also outperforms the state-of-the-art methods. The contribution is realized in terms of novelty of the approach and creation of a new, sizeable, and scarce dataset with linguistic and synchronized facial expressive image data. The dataset is particularly useful in languages other than English and the approach addresses one of the most challenging NLP issue: sentiment analysis in metaphor. © 2021 IEEE.
Hierarchical colour image segmentation by leveraging RGB channels independently
- Authors: Tania, Sheikh , Murshed, Manzur , Teng, Shyh , Karmakar, Gour
- Date: 2019
- Type: Text , Conference paper
- Relation: 9th Pacific-Rim Symposium on Image and Video Technology, PSIVT 2019 Vol. 11854 LNCS, p. 197-210
- Full Text:
- Reviewed:
- Description: In this paper, we introduce a hierarchical colour image segmentation based on cuboid partitioning using simple statistical features of the pixel intensities in the RGB channels. Estimating the difference between any two colours is a challenging task. As most of the colour models are not perceptually uniform, investigation of an alternative strategy is highly demanding. To address this issue, for our proposed technique, we present a new concept for colour distance measure based on the inconsistency of pixel intensities of an image which is more compliant to human perception. Constructing a reliable set of superpixels from an image is fundamental for further merging. As cuboid partitioning is a superior candidate to produce superpixels, we use the agglomerative merging to yield the final segmentation results exploiting the outcome of our proposed cuboid partitioning. The proposed cuboid segmentation based algorithm significantly outperforms not only the quadtree-based segmentation but also existing state-of-the-art segmentation algorithms in terms of quality of segmentation for the benchmark datasets used in image segmentation. © 2019, Springer Nature Switzerland AG.
GraphLearning’22: 1st International Workshop on Graph Learning
- Authors: Xia, Feng , Lambiotte, Renaud , Aggarwal, Charu
- Date: 2022
- Type: Text , Conference proceedings
- Relation: WWW '22: Companion Proceedings of the Web Conference 2022, Virtual Event, Lyon France April 25 - 29, 2022 p. 1004-1005
- Full Text:
- Reviewed:
- Description: The First Workshop on Graph Learning aims to bring together researchers and practitioners from academia and industry to discuss recent advances and core challenges of graph learning. This workshop will be established as a platform for multiple disciplines such as computer science, applied mathematics, physics, social sciences, data science, complex networks, and systems engineering. Core challenges in regard to theory, methodology, and applications of graph learning will be the main center of discussions at the workshop.