Themes in data mining, big data, and crime analytics
- Authors: Oatley,Giles
- Date: 2022
- Type: Text , Journal article , Review
- Relation: Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery Vol. 12, no. 2 (2022), p.
- Full Text:
- Reviewed:
- Description: This article examines the impact of new AI-related technologies in data mining and big data on important research questions in crime analytics. Because the field is so broad, the review focuses on a selection of the most important topics. Challenges for information management, and in turn law and society, include: AI-powered predictive policing; big data for legal and adversarial decisions; bias using big data and analytics in profiling and predicting criminality; forecasting crime risk and crime rates; and, regulating AI systems. This article is categorized under: Algorithmic Development > Spatial and Temporal Data Mining Fundamental Concepts of Data and Knowledge > Big Data Mining Technologies > Artificial Intelligence Application Areas > Data Mining Software Tools. © 2021 Wiley Periodicals LLC.
Characterisation and comparative analysis of thematic video portals
- Authors: Adib, Saif , Mahanti, Aniket , Naha, Ranesh
- Date: 2021
- Type: Text , Journal article
- Relation: Technology in society Vol. 67, no. (2021), p. 101690
- Full Text: false
- Reviewed:
- Description: This paper provides a comprehensive measurement study on three video streaming websites with social media features - ‘TED Talks’, ‘xHamster’ and ‘XVideos’. We have analysed 2685 TED videos from 2006 to 2018 to characterise the service. For xHamster and XVideos, active measurements were used to collect unique metadata on almost 3405 and 6721 channels from 2012 to 2019 respectively, which were then analysed. Through these characterisations we gained insight into the main players of the websites – viewers, uploaders and website owners. Our analysis involved the studying of video streaming characteristics such as views, number of uploads, ratings, tags etc. By this we aim to give an overview of the services' current state and compare them with other traditional video streaming services. Our results showed some similar trends to be observed in all three websites such as TED videos and adult channels getting a high number of views despite low injection rate, maintaining a power-law behaviour due to front page recommendations and ratings being underutilised as a feature.Other observations include adult streaming services having a higher number of subscribers per channel. The characterisation results obtained are of value to network operators, content providers, and protocol designers. These results can also be used by content providers to measure what type of content is being watched on their websites. Our study provides a glimpse at how video streaming services function today and the trends they seem to follow. •Measurements and detailed characterisation study based on TED Talks, xHamster, and XVideos.•Comprehensive understanding of the online video streaming domain.•Insights on video streaming services and how they utilise their online social network of users.
Data-driven classifier for extreme outage prediction based on bayes decision theory
- Authors: Mohammadian, Mostafa , Aminifar, Farrokh , Amjady, Nima , Shahidehpour, Mohammad
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE transactions on power systems Vol. 36, no. 6 (2021), p. 4906-4914
- Full Text: false
- Reviewed:
- Description: The growing concern over catastrophic weather events, mostly as a direct result of climate changes, has underscored the need for expanding traditional power system contingency analyses to handle the associated risks of extreme power outages. To enable power system operators to make timely decisions when facing extreme events, we explore in this paper the viability of a classifier which uses the machine learning approach based on the Bayes decision theory as a means of predicting power system component outages. However, owing to an excessively imbalanced and largely sparse power component outage datasets, the corresponding classifier learning is a challenging problem in the data mining community. In the proposed approach, we apply a resampling method to overcome the class imbalance problem. The proposed classifier provides an effective framework that not only minimizes outage prediction errors for power system components, but also considers the cost of each preventive action according to its implication in extreme events. The outcome of the proposed model can be used for introducing operation-oriented preventive measures that allow the rescheduling of generation resources for maximizing the power system resilience. The performance of the proposed classifier is examined through numerical simulations by utilizing the confusion matrix.
A Survey on Behavioral Pattern Mining from Sensor Data in Internet of Things
- Authors: Rashid, Md Mamunur , Kamruzzaman, Joarder , Hassan, Mohammad , Shahriar Shafin, Sakib , Bhuiyan, Md Zakirul
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 33318-33341
- Full Text:
- Reviewed:
- Description: The deployment of large-scale wireless sensor networks (WSNs) for the Internet of Things (IoT) applications is increasing day-by-day, especially with the emergence of smart city services. The sensor data streams generated from these applications are largely dynamic, heterogeneous, and often geographically distributed over large areas. For high-value use in business, industry and services, these data streams must be mined to extract insightful knowledge, such as about monitoring (e.g., discovering certain behaviors over a deployed area) or network diagnostics (e.g., predicting faulty sensor nodes). However, due to the inherent constraints of sensor networks and application requirements, traditional data mining techniques cannot be directly used to mine IoT data streams efficiently and accurately in real-time. In the last decade, a number of works have been reported in the literature proposing behavioral pattern mining algorithms for sensor networks. This paper presents the technical challenges that need to be considered for mining sensor data. It then provides a thorough review of the mining techniques proposed in the recent literature to mine behavioral patterns from sensor data in IoT, and their characteristics and differences are highlighted and compared. We also propose a behavioral pattern mining framework for IoT and discuss possible future research directions in this area. © 2013 IEEE.
Big data analytics for manufacturing internet of things: opportunities, challenges and enabling technologies
- Authors: Dai, Hong-Ning , Wang, Hao , Xu, Guangquan , Wan, Jiafu , Imran, Muhammad
- Date: 2020
- Type: Text , Journal article
- Relation: Enterprise Information Systems Vol. 14, no. 9-10 (2020), p. 1279-1303
- Full Text: false
- Reviewed:
- Description: Data analytics in massive manufacturing data can extract huge business values while can also result in research challenges due to the heterogeneous data types, enormous volume and real-time velocity of manufacturing data. This paper provides an overview on big data analytics in manufacturing Internet of Things (MIoT). This paper first starts with a discussion on necessities and challenges of big data analytics in manufacturing data of MIoT. Then, the enabling technologies of big data analytics of manufacturing data are surveyed and discussed. Moreover, this paper also outlines the future directions in this promising area. © 2019 Informa UK Limited, trading as Taylor & Francis Group.
Clusterwise support vector linear regression
- Authors: Joki, Kaisa , Bagirov, Adil , Karmitsa, Napsu , Mäkelä, Marko , Taheri, Sona
- Date: 2020
- Type: Text , Journal article
- Relation: European Journal of Operational Research Vol. 287, no. 1 (2020), p. 19-35
- Full Text:
- Reviewed:
- Description: In clusterwise linear regression (CLR), the aim is to simultaneously partition data into a given number of clusters and to find regression coefficients for each cluster. In this paper, we propose a novel approach to model and solve the CLR problem. The main idea is to utilize the support vector machine (SVM) approach to model the CLR problem by using the SVM for regression to approximate each cluster. This new formulation of the CLR problem is represented as an unconstrained nonsmooth optimization problem, where we minimize a difference of two convex (DC) functions. To solve this problem, a method based on the combination of the incremental algorithm and the double bundle method for DC optimization is designed. Numerical experiments are performed to validate the reliability of the new formulation for CLR and the efficiency of the proposed method. The results show that the SVM approach is suitable for solving CLR problems, especially, when there are outliers in data. © 2020 Elsevier B.V.
- Description: Funding details: Academy of Finland, 289500, 294002, 319274 Funding details: Turun Yliopisto Funding details: Australian Research Council, ARC, (Project no. DP190100580 ).
Hybrid intrusion detection system based on the stacking ensemble of C5 decision tree classifier and one class support vector machine
- Authors: Khraisat, Ansam , Gondal, Iqbal , Vamplew, Peter , Kamruzzaman, Joarder , Alazab, Ammar
- Date: 2020
- Type: Text , Journal article
- Relation: Electronics (Switzerland) Vol. 9, no. 1 (2020), p.
- Full Text:
- Reviewed:
- Description: Cyberttacks are becoming increasingly sophisticated, necessitating the efficient intrusion detection mechanisms to monitor computer resources and generate reports on anomalous or suspicious activities. Many Intrusion Detection Systems (IDSs) use a single classifier for identifying intrusions. Single classifier IDSs are unable to achieve high accuracy and low false alarm rates due to polymorphic, metamorphic, and zero-day behaviors of malware. In this paper, a Hybrid IDS (HIDS) is proposed by combining the C5 decision tree classifier and One Class Support Vector Machine (OC-SVM). HIDS combines the strengths of SIDS) and Anomaly-based Intrusion Detection System (AIDS). The SIDS was developed based on the C5.0 Decision tree classifier and AIDS was developed based on the one-class Support Vector Machine (SVM). This framework aims to identify both the well-known intrusions and zero-day attacks with high detection accuracy and low false-alarm rates. The proposed HIDS is evaluated using the benchmark datasets, namely, Network Security Laboratory-Knowledge Discovery in Databases (NSL-KDD) and Australian Defence Force Academy (ADFA) datasets. Studies show that the performance of HIDS is enhanced, compared to SIDS and AIDS in terms of detection rate and low false-alarm rates. © 2020 by the authors. Licensee MDPI, Basel, Switzerland.
Machine learning-based modelling for museum visitations prediction
- Authors: Yap, Norman , Gong, Mingwei , Naha, Ranesh , Mahanti, Aniket
- Date: 2020
- Type: Text , Conference proceedings
- Relation: 2020 International Symposium on Networks, Computers and Communications (ISNCC); Montreal, Canada; 20-22nd October, 2020, p.1-7
- Full Text: false
- Reviewed:
- Description: Cultural venues like museums increasingly seek to harness the value of data analytics to make data driven decisions related to exhibitions duration, marketing campaigns, resource planning, and revenue optimization. One key priority is the need to understand the influencing factors behind visitor attendance. Using data collected from a large museum, we investigated whether the weather has a significant impact on visitor attendance or that other factors are more important. We applied the Cross Industry Standard Process for Data Mining (CRISP-DM) methodology to perform the research, developed and built four different types of regression models using R and its machine learning packages to model visitor attendance. The models were trained and evaluated. Predictions of visitor attendance were then generated from each of the four models and forecast accuracy was measured. The extreme gradient boost model was the best model with the highest average forecast accuracy of 93% and lowest forecast variability when benchmarked against the actual visitor attendance from the test data set. The weather was not considered to be as significant in predicting visitor trends and numbers to the museum compared to factors like time of the day, day of the week and school holidays. However, it was still measured to have a slight impact as excluding weather variables resulted in a model with a poorer fit. Weather can potentially have a more marked impact on cultural attractions in more extreme weather environments and outdoor venues.
Performance analysis of different types of machine learning classifiers for non-technical loss detection
- Authors: Ghori, Khawaja , Abbasi, Rabeeh , Awais, Muhammad , Imran, Muhammad , Ullah, Ata , Szathmary, Laszlo
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 16033-16048
- Full Text:
- Reviewed:
- Description: With the ever-growing demand of electric power, it is quite challenging to detect and prevent Non-Technical Loss (NTL) in power industries. NTL is committed by meter bypassing, hooking from the main lines, reversing and tampering the meters. Manual on-site checking and reporting of NTL remains an unattractive strategy due to the required manpower and associated cost. The use of machine learning classifiers has been an attractive option for NTL detection. It enhances data-oriented analysis and high hit ratio along with less cost and manpower requirements. However, there is still a need to explore the results across multiple types of classifiers on a real-world dataset. This paper considers a real dataset from a power supply company in Pakistan to identify NTL. We have evaluated 15 existing machine learning classifiers across 9 types which also include the recently developed CatBoost, LGBoost and XGBoost classifiers. Our work is validated using extensive simulations. Results elucidate that ensemble methods and Artificial Neural Network (ANN) outperform the other types of classifiers for NTL detection in our real dataset. Moreover, we have also derived a procedure to identify the top-14 features out of a total of 71 features, which are contributing 77% in predicting NTL. We conclude that including more features beyond this threshold does not improve performance and thus limiting to the selected feature set reduces the computation time required by the classifiers. Last but not least, the paper also analyzes the results of the classifiers with respect to their types, which has opened a new area of research in NTL detection. © 2013 IEEE.
Piracy on the internet: Publisher-side analysis on file hosting services
- Authors: Chan, Marcus , Gong, Mingwei , Naha, Ranesh , Mahanti, Aniket
- Date: 2020
- Type: Text , Conference proceedings
- Relation: 2020 International Symposium on Networks, Computers and Communications (ISNCC); Montreal, QC, Canada; 20-22 October 2020 p. 1-7
- Full Text: false
- Reviewed:
- Description: In the file sharing ecosystem, One-Click File Hosting Services (FHS) such as Rapidgator and Uploaded, the previously Rapidshare and Megaupload, provide a platform for users to share copyrighted content. We present a publisher-side analysis of FHS file sharing dynamics through data collected from active measurement by crawling Warez-BB. The website is essentially a forum where publishers can share links to content they have uploaded on file hosting services. Consumers can use the website to gain access to content shared on the website, often free of charge. We primarily analyse various characteristics of file sharing with respect to view count as the evaluation metric.
Categorical features transformation with compact one-hot encoder for fraud detection in distributed environment
- Authors: Ul Haq, Ikram , Gondal, Iqbal , Vamplew, Peter , Brown, Simon
- Date: 2019
- Type: Text , Conference proceedings , Conference paper
- Relation: 2019 16th Australasian Conference on Data Mining, AusDM 2018; Bathurst, NSW; 28 November 2018 through 30 November 2018 Vol. 996, p. 69-80
- Full Text: false
- Reviewed:
- Description: Fraud detection for online banking is an important research area, but one of the challenges is the heterogeneous nature of transactions data i.e. a combination of numeric as well as mixed attributes. Usually, numeric format data gives better performance for classification, regression and clustering algorithms. However, many machine learning problems have categorical, or nominal features, rather than numeric features only. In addition, some machine learning platforms such as Apache Spark accept numeric data only. One-hot Encoding (OHE) is a widely used approach for transforming categorical features to numerical features in traditional data mining tasks. The one-hot approach has some challenges as well: the sparseness of the transformed data and that the distinct values of an attribute are not always known in advance. Other than the model accuracy, compactness of machine learning models is equally important due to growing memory and storage needs. This paper presents an innovative technique to transform categorical features to numeric features by compacting sparse data even if all the distinct values are not known. The transformed data can be used for the development of fraud detection systems. The accuracy of the results has been validated on synthetic and real bank fraud data and a publicly available anomaly detection (KDD-99) dataset on a multi-node data cluster. © Springer Nature Singapore Pte Ltd. 2019.
Discovering regularities from traditional chinese medicine prescriptions via bipartite embedding model
- Authors: Ruan, Chunyang , Ma, Jiangang , Wang, Ye , Zhang, Yanchun , Yang, Yun
- Date: 2019
- Type: Text , Conference proceedings
- Relation: International Joint Conferences on Artificial Intelligence (IJCAI-49); Macao, China; 10th-16th August 2019; published in Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) p. 3346-3352
- Full Text: false
- Reviewed:
- Description: Regularities analysis for prescriptions is a significant task for traditional Chinese medicine (TCM), both in inheritance of clinical experience and in improvement of clinical quality. Recently, many methods have been proposed for regularities discovery, but this task is challenging due to the quantity, sparsity and free-style of prescriptions. In this paper, we address the specific problem of regularities discovery and propose a graph embedding based framework for regularities discovery for massive prescriptions. We model this task as a relation prediction in which the correlation of two herbs or of herb and symptom are incorporated to characterize the different relationships. Specifically, we first establish a heterogeneous network with herbs and symptoms as its nodes. We develop a bipartite embedding model termed HS2Vec to detect regularities, which explores multiple relations of herbherb, and herb-symptom based on the heterogeneous network. Experiments on four real-world datasets demonstrate that the proposed framework is very effective for regularities discovery.
Sliding window-based regularly frequent patterns mining over sensor data streams
- Authors: Rashid, Md Mamunur , Kamruzzaman, Joarder , Wasimi, Saleh
- Date: 2019
- Type: Text , Conference paper
- Relation: 2019 IEEE Asia-Pacific Conference on Computer Science and Data Engineering, CSDE 2019, Melbourne, 9 December 2019 through 11 December 2019
- Full Text: false
- Reviewed:
- Description: WSNs generate a large amount of data in the form of data stream; and mining these streams with well used support metric-based sensor association rule mechanism can result in extracting interesting knowledge. Support metric-based sensor association use occurrence frequency of pattern as criteria, but the occurrence frequency of a pattern may not be an appropriate criterion for finding significant patterns. However, temporal regularity in occurrence behavior can be considered as another important measure for assessing the importance of patterns in WSNs. A frequent pattern that occurs after regular intervals in WSNs called as regularly frequent sensor patterns. Even though mining regularly frequent sensor patterns from sensor data stream is extremely required in real-time applications, no such algorithm has been proposed yet. Therefore, in this paper we propose a novel tree structure, called regular frequent sensor pattern stream tree (RFSPS-tree) and a new technique, called regularly frequent sensor pattern mining of data stream (RFSPMS), using sliding window-based regularly frequent sensor pattern mining for WSNs. By capturing the useful knowledge of the data stream into an RFSPS-tree, our RFSPMS algorithm can mine associated sensor patterns in the current window with frequent pattern (FP)-growth like pattern-growth method. Extensive experimental analyses show that our technique is very efficient in discovering regularly frequent sensor patterns over sensor data stream. © 2019 IEEE.
Accurate and efficient clustering algorithms for very large data sets
- Authors: Quddus, Syed
- Date: 2017
- Type: Text , Thesis , PhD
- Full Text:
- Description: The ability to mine and extract useful information from large data sets is a common concern for organizations. Data over the internet is rapidly increasing and the importance of development of new approaches to collect, store and mine large amounts of data is significantly increasing. Clustering is one of the main tasks in data mining. Many clustering algorithms have been proposed but there are still clustering problems that have not been addressed in depth especially the clustering problems in large data sets. Clustering in large data sets is important in many applications and such applications include network intrusion detection systems, fraud detection in banking systems, air traffic control, web logs, sensor networks, social networks and bioinformatics. Data sets in these applications contain from hundreds of thousands to hundreds of millions of data points and they may contain hundreds or thousands of attributes. Recent developments in computer hardware allows to store in random access memory and repeatedly read data sets with hundreds of thousands and even millions of data points. This makes possible the use of existing clustering algorithms in such data sets. However, these algorithms require a prohibitively large CPU time and fail to produce an accurate solution. Therefore, it is important to develop clustering algorithms which are accurate and can provide real time clustering in such data sets. This is especially important in a big data era. The aim of this PhD study is to develop accurate and real time algorithms for clustering in very large data sets containing hundreds of thousands and millions of data points. Such algorithms are developed based on the combination of heuristic algorithms with the incremental approach. These algorithms also involve a special procedure to identify dense areas in a data set and compute a subset most informative representative data points in order to decrease the size of a data set. It is the aim of this PhD study to develop the center-based clustering algorithms. The success of these algorithms strongly depends on the choice of starting cluster centers. Different procedures are proposed to generate such centers. Special procedures are designed to identify the most promising starting cluster centers and to restrict their number. New clustering algorithms are evaluated using large data sets available in public domains. Their results will be compared with those obtained using several existing center-based clustering algorithms.
- Description: Doctor of Philosophy
Dependable large scale behavioral patterns mining from sensor data using Hadoop platform
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2017
- Type: Text , Journal article
- Relation: Information Sciences Vol. 379, no. (2017), p. 128-145
- Full Text: false
- Reviewed:
- Description: Wireless sensor networks (WSNs) will be an integral part of the future Internet of Things (loT) environment and generate large volumes of data. However, these data would only be of benefit if useful knowledge can be mined from them. A data mining framework for WSNs includes data extraction, storage and mining techniques, and must be efficient and dependable. In this paper, we propose a new type of behavioral pattern mining technique from sensor data called regularly frequent sensor patterns (RFSPs). RFSPs can identify a set of temporally correlated sensors which can reveal significant knowledge from the monitored data. A distributed data extraction model to prepare the data required for mining RFSPs is proposed, as the distributed scheme ensures higher availability through greater redundancy. The tree structure for RFSP is compact requires less memory and can be constructed using only a single scan through the dataset, and the mining technique is efficient with low runtime. Current mining techniques in the literature on sensor data employ a single memory-based sequential approach and hence are not efficient. Moreover, usage of the. MapReduce model for the distributed solution has not been explored extensively. Since MapReduce is becoming the de facto model for computation on large data, we also propose a parallel implementation of the RFSP mining algorithm, called RFSP on Hadoop (RFSP-H), which uses a MapReduce-based framework to gain further efficiency. Experiments conducted to evaluate the compactness and performance of the data extraction model, RFSP-tree and RFSP-H mining show improved results. (C) 2016 Elsevier Inc. All rights reserved.
New diagonal bundle method for clustering problems in large data sets
- Authors: Karmitsa, Napsu , Bagirov, Adil , Taheri, Sona
- Date: 2017
- Type: Text , Journal article
- Relation: European Journal of Operational Research Vol. 263, no. 2 (2017), p. 367-379
- Relation: http://purl.org/au-research/grants/arc/DP140103213
- Full Text: false
- Reviewed:
- Description: Clustering is one of the most important tasks in data mining. Recent developments in computer hardware allow us to store in random access memory (RAM) and repeatedly read data sets with hundreds of thousands and even millions of data points. This makes it possible to use conventional clustering algorithms in such data sets. However, these algorithms may need prohibitively large computational time and fail to produce accurate solutions. Therefore, it is important to develop clustering algorithms which are accurate and can provide real time clustering in large data sets. This paper introduces one of them. Using nonsmooth optimization formulation of the clustering problem the objective function is represented as a difference of two convex (DC) functions. Then a new diagonal bundle algorithm that explicitly uses this structure is designed and combined with an incremental approach to solve this problem. The method is evaluated using real world data sets with both large number of attributes and large number of data points. The proposed method is compared with two other clustering algorithms using numerical results. © 2017 Elsevier B.V.
Periodic associated sensor patterns mining from wireless sensor networks
- Authors: Rashid, Mamunur , Kamruzzaman, Joarder , Gondal, Iqbal , Hassan, Rafiul
- Date: 2017
- Type: Text , Conference proceedings
- Relation: Proceedings of the 24th International Conference on Neural Information Processing (ICONIP 2017); Guangzhou, China; 14/11/2017-18/11/2017 p. 247-255
- Full Text: false
- Reviewed:
- Description: Mining interesting knowledge from the massive amount of data gathered in wireless sensor networks is a challenging task. Works reported in literature all-confidence measure based associated sensor patterns can captures association-like co-occurrences and the strong temporal correlations implied by such co-occurrences in the sensor data. However, when the user given all-confidence threshold is low, a huge amount of patterns are generated and mining these patterns may not be space and time efficient. Temporal periodicity of pattern appearance can be regarded as an important criterion for measuring the interestingness of associated patterns in WSNs. Associated sensor patterns that occur after regular intervals is called periodic associated sensor patterns. Even though mining periodic associated sensor patterns from sensor data stream is extremely important in many real-time applications, no such algorithm has been proposed yet. In this paper, we propose a compact tree structure called Periodic Associated Sensor Pattern-tree (PASP-tree) and an efficient mining approach for finding periodic associated sensor patterns (PASPs) from WSNs. Extensive performance analyses show that our technique is time and memory efficient in finding periodic associated sensor patterns.
An efficient data extraction framework for mining wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2016
- Type: Text , Conference paper
- Relation: 23rd International Conference, ICONIP 2016; Kyoto, Japan; 16th-21st October 2016; published in Neural Information Processing, Part III (Lecture Notes in Computer Science series) Vol. 9949, p. 491-498
- Full Text:
- Reviewed:
- Description: Behavioral patterns for sensors have received a great deal of attention recently due to their usefulness in capturing the temporal relations between sensors in wireless sensor networks. To discover these patterns, we need to collect the behavioral data that represents the sensor's activities over time from the sensor database that attached with a well-equipped central node called sink for further analysis. However, given the limited resources of sensor nodes, an effective data collection method is required for collecting the behavioral data efficiently. In this paper, we introduce a new framework for behavioral patterns called associated-correlated sensor patterns and also propose a MapReduce based new paradigm for extract data from the wireless sensor network by distributed away. Extensive performance study shows that the proposed method is capable to reduce the data size almost 50% compared to the centralized model.
Economic resilience of regions under crises : A study of the Australian economy
- Authors: Courvisanos, Jerry , Jain, Ameeta , Mardaneh, Karim
- Date: 2016
- Type: Text , Journal article
- Relation: Regional Studies Vol. 50, no. 4 (2016), p. 629-643
- Full Text:
- Reviewed:
- Description: Economic resilience of regions under crises: a study of the Australian economy, Regional Studies. Identifying patterns of economic resilience in regions by industry categories is the focus of this paper. Patterns emerge from adaptive capacity in four distinct functional groups of local government regions in Australia, in respect of their resilience from shocks on specific industries. A model of regional adaptive cycles around four sequential phases - reorganization, exploitation, conservation and release - is adopted as the framework for recognizing such patterns. A data-mining method utilizes a k-means algorithm to evaluate the impact of two major shocks - a 13-year drought and the Global Financial Crisis - on four functional groups of regions, using census data from 2001, 2006 and 2011. © 2015 Regional Studies Association.
A complete list of kernels used in support vector machines
- Authors: Zhang, Jiapu
- Date: 2015
- Type: Text , Journal article
- Relation: Biochemistry & Pharmacology Vol. 4, no. 5 (2015), p. 1-2
- Full Text:
- Reviewed:
- Description: In bioinformatics or chemoinformatics, we always need data mining of support vector machines (SVMs) for its large databases. Kernels play an important role in SVMs. Thus it is very necessary to list all the kernels of SVMs that we currently use.