Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Old Dominion University (27)
- Southern Methodist University (7)
- California Polytechnic State University, San Luis Obispo (5)
- Claremont Colleges (4)
- New Jersey Institute of Technology (4)
-
- Virginia Commonwealth University (4)
- City University of New York (CUNY) (3)
- Clemson University (3)
- Dartmouth College (3)
- East Tennessee State University (3)
- LSU New Orleans (3)
- Montclair State University (3)
- Purdue University (3)
- San Jose State University (3)
- University of Louisville (3)
- University of Malaya (3)
- Brigham Young University (2)
- Chapman University (2)
- Dakota State University (2)
- Embry-Riddle Aeronautical University (2)
- Florida Institute of Technology (2)
- Georgia Southern University (2)
- Institute of Business Administration (2)
- Kennesaw State University (2)
- Murray State University (2)
- Rochester Institute of Technology (2)
- Singapore Management University (2)
- Tashkent State Technical University (2)
- The University of Southern Mississippi (2)
- University of Connecticut (2)
- Keyword
-
- Machine Learning (11)
- Machine learning (11)
- Algorithms (8)
- Deep learning (8)
- Classification (6)
-
- Artificial Intelligence (5)
- Big data (4)
- Data Science (4)
- Data analysis (4)
- Deep Learning (4)
- Neural networks (4)
- Sentiment analysis (4)
- Artificial intelligence (3)
- Clustering (3)
- Clustering algorithms (3)
- Computer Science (3)
- Feature selection (3)
- Information theory (3)
- Reinforcement learning (3)
- Unsupervised learning (3)
- Algorithmic Design (2)
- Big Data (2)
- Computer vision (2)
- Convolutional neural network (2)
- Cybersecurity (2)
- Data mining (2)
- Data quality (2)
- Data science (2)
- Decision making (2)
- Detection and tracking algorithms (2)
- Publication Year
- Publication
-
- Theses and Dissertations (7)
- Electronic Theses and Dissertations (6)
- Computer Science Faculty Publications (5)
- Dissertations (5)
- Electrical & Computer Engineering Faculty Publications (5)
-
- Information Technology & Decision Sciences Faculty Publications (4)
- Master's Theses (4)
- SMU Data Science Review (4)
- All Dissertations (3)
- Department of Computer Science Faculty Scholarship and Creative Works (3)
- Graduate Industrial Research Symposium (3)
- LSU New Orleans Theses and Dissertations (3)
- Publications and Research (3)
- Student Works (2020-2029) (3)
- Theses (3)
- Undergraduate Research Symposium (3)
- Articles (2)
- Chemical Technology, Control and Management (2)
- College of Graduate Studies: Theses & Dissertations (2)
- Computational and Data Sciences (PhD) Dissertations (2)
- Computer Science and Engineering Theses and Dissertations (2)
- Data Science Faculty Publications (2)
- Engineering Management & Systems Engineering Faculty Publications (2)
- Faculty Publications (2)
- Honors College Theses (2)
- International Conference on Information and Communication Technologies (2)
- Library Philosophy and Practice (e-journal) (2)
- Mathematics & Statistics Faculty Publications (2)
- McKelvey School of Engineering Graduate Student Theses & Dissertations (2)
- Research Collection School Of Computing and Information Systems (2)
- Publication Type
- File Type
Articles 91 - 120 of 149
Full-Text Articles in Theory and Algorithms
Application Of Probabilistic Ranking Systems On Women’S Junior Division Beach Volleyball, Cameron Stewart, Michael Mazel, Bivin Sadler
Application Of Probabilistic Ranking Systems On Women’S Junior Division Beach Volleyball, Cameron Stewart, Michael Mazel, Bivin Sadler
SMU Data Science Review
Women’s beach volleyball is one of the fastest growing collegiate sports today. The increase in popularity has come with an increase in valuable scholarship opportunities across the country. With thousands of athletes to sort through, college scouts depend on websites that aggregate tournament results and rank players nationally. This project partnered with the company Volleyball Life, who is the current market leader in the ranking space of junior beach volleyball players. Utilizing the tournament information provided by Volleyball Life, this study explored replacements to the current ranking systems, which are designed to aggregate player points from recent tournament placements. Three …
Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar
Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar
LSU New Orleans Theses and Dissertations
Parallel computing plays a crucial role in processing large-scale graph data. Complex network analysis is an exciting area of research for many applications in different scientific domains e.g., sociology, biology, online media, recommendation systems and many more. Graph mining is an area of interest with diverse problems from different domains of our daily life. Due to the advancement of data and computing technologies, graph data is growing at an enormous rate, for example, the number of links in social networks is growing every millisecond. Machine/Deep learning plays a significant role for technological accomplishments to work with big data in modern …
Unsupervised Contrastive Representation Learning For Knowledge Distillation And Clustering, Fei Ding
Unsupervised Contrastive Representation Learning For Knowledge Distillation And Clustering, Fei Ding
All Dissertations
Unsupervised contrastive learning has emerged as an important training strategy to learn representation by pulling positive samples closer and pushing negative samples apart in low-dimensional latent space. Usually, positive samples are the augmented versions of the same input and negative samples are from different inputs. Once the low-dimensional representations are learned, further analysis, such as clustering, and classification can be performed using the representations. Currently, there are two challenges in this framework. First, the empirical studies reveal that even though contrastive learning methods show great progress in representation learning on large model training, they do not work well for small …
Legislative Language For Success, Sanjana Gundala
Legislative Language For Success, Sanjana Gundala
Master's Theses
Legislative committee meetings are an integral part of the lawmaking process for local and state bills. The testimony presented during these meetings is a large factor in the outcome of the proposed bill. This research uses Natural Language Processing and Machine Learning techniques to analyze testimonies from California Legislative committee meetings from 2015-2016 in order to identify what aspects of a testimony makes it successful. A testimony is considered successful if the alignment of the testimony matches the bill outcome (alignment is "For" and the bill passes or alignment is "Against" and the bill fails). The process of finding what …
Data And Algorithmic Modeling Approaches To Count Data, Andraya Hack
Data And Algorithmic Modeling Approaches To Count Data, Andraya Hack
Honors College Theses
Various techniques are used to create predictions based on count data. This type of data takes the form of a non-negative integers such as the number of claims an insurance policy holder may make. These predictions can allow people to prepare for likely outcomes. Thus, it is important to know how accurate the predictions are. Traditional statistical approaches for predicting count data include Poisson regression as well as negative binomial regression. Both methods also have a zero-inflated version that can be used when the data has an overabundance of zeros. Another procedure is to use computer algorithms, also known as …
Assessing Photogrammetry Artificial Intelligence In Monumental Buildings’ Crack Digital Detection, Said Maroun, Mostafa Khalifa, Nabil Mohareb
Assessing Photogrammetry Artificial Intelligence In Monumental Buildings’ Crack Digital Detection, Said Maroun, Mostafa Khalifa, Nabil Mohareb
Architecture and Planning Journal (APJ)
Natural and human-made disasters have significant impacts on monumental buildings, threatening them from being deteriorated. If no rapid consolidations took into consideration traumatic accidents would endanger the existence of precious sites. In this context, Beirut's enormous 4th of August 2020 explosion damaged an estimated 640 historical monuments, many volunteers assess damages for more than a year to prevent the more crucial risk of demolitions. This research aims to assist the collaboration ability among photogrammetry science, Artificial Intelligence Model (AIM) and Architectural Coding to optimize the process for better coverage and scientific approach of data specific to the crack disorders to …
The Performance Optimization Of Asp Solving Based On Encoding Rewriting And Encoding Selection, Liu Liu
The Performance Optimization Of Asp Solving Based On Encoding Rewriting And Encoding Selection, Liu Liu
Theses and Dissertations--Computer Science
Answer set programming (ASP) has long been used for modeling and solving hard search problems. These problems are modeled in ASP as encodings, a collection of rules that declaratively describe the logic of the problem without explicitly listing how to solve it. It is common that the same problem has several different but equivalent encodings in ASP. Experience shows that the performance of these ASP encodings may vary greatly from instance to instance when processed by current state-of-the-art ASP grounder/solver systems. In particular, it is rarely the case that one encoding outperforms all others. Moreover, running an ASP system on …
Local Feature Selection For Multiple Instance Learning With Applications., Aliasghar Shahrjooihaghighi
Local Feature Selection For Multiple Instance Learning With Applications., Aliasghar Shahrjooihaghighi
Electronic Theses and Dissertations
Feature selection is a data processing approach that has been successfully and effectively used in developing machine learning algorithms for various applications. It has been proven to effectively reduce the dimensionality of the data and increase the accuracy and interpretability of machine learning algorithms. Conventional feature selection algorithms assume that there is an optimal global subset of features for the whole sample space. Thus, only one global subset of relevant features is learned. An alternative approach is based on the concept of Local Feature Selection (LFS), where each training sample can have its own subset of relevant features. Multiple Instance …
Analytical Models For Traffic Congestion And Accident Analysis, Hongrui Liu, Rahul Ramachandra Shetty
Analytical Models For Traffic Congestion And Accident Analysis, Hongrui Liu, Rahul Ramachandra Shetty
Mineta Transportation Institute
In the US, over 38,000 people die in road crashes each year, and 2.35 million are injured or disabled, according to the statistics report from the Association for Safe International Road Travel (ASIRT) in 2020. In addition, traffic congestion keeping Americans stuck on the road wastes millions of hours and billions of dollars each year. Using statistical techniques and machine learning algorithms, this research developed accurate predictive models for traffic congestion and road accidents to increase understanding of the complex causes of these challenging issues. The research used US Accidents data consisting of 49 variables describing 4.2 million accident records …
Transfer-Learned Pruned Deep Convolutional Neural Networks For Efficient Plant Classification In Resource-Constrained Environments, Martinson Ofori
Transfer-Learned Pruned Deep Convolutional Neural Networks For Efficient Plant Classification In Resource-Constrained Environments, Martinson Ofori
Masters Theses & Doctoral Dissertations
Traditional means of on-farm weed control mostly rely on manual labor. This process is time-consuming, costly, and contributes to major yield losses. Further, the conventional application of chemical weed control can be economically and environmentally inefficient. Site-specific weed management (SSWM) counteracts this by reducing the amount of chemical application with localized spraying of weed species. To solve this using computer vision, precision agriculture researchers have used remote sensing weed maps, but this has been largely ineffective for early season weed control due to problems such as solar reflectance and cloud cover in satellite imagery. With the current advances in artificial …
Teaching Machine Learning For The Physical Sciences: A Summary Of Lessons Learned And Challenges, Viviana Acquaviva
Teaching Machine Learning For The Physical Sciences: A Summary Of Lessons Learned And Challenges, Viviana Acquaviva
Publications and Research
This paper summarizes some challenges encountered and best practices established in several years of teaching Machine Learning for the Physical Sciences at the undergraduate and graduate level. I discuss motivations for teaching ML to physicists, desirable properties of pedagogical materials, such as accessibility, relevance, and likeness to real-world research problems, and give examples of components of teaching units.
Ensemble Data Fitting For Bathymetric Models Informed By Nominal Data, Samantha Zambo
Ensemble Data Fitting For Bathymetric Models Informed By Nominal Data, Samantha Zambo
Dissertations
Due to the difficulty and expense of collecting bathymetric data, modeling is the primary tool to produce detailed maps of the ocean floor. Current modeling practices typically utilize only one interpolator; the industry standard is splines-in-tension.
In this dissertation we introduce a new nominal-informed ensemble interpolator designed to improve modeling accuracy in regions of sparse data. The method is guided by a priori domain knowledge provided by artificially intelligent classifiers. We recast such geomorphological classifications, such as ‘seamount’ or ‘ridge’, as nominal data which we utilize as foundational shapes in an expanded ordinary least squares regression-based algorithm. To our knowledge …
Multilateration Index., Chip Lynch
Multilateration Index., Chip Lynch
Electronic Theses and Dissertations
We present an alternative method for pre-processing and storing point data, particularly for Geospatial points, by storing multilateration distances to fixed points rather than coordinates such as Latitude and Longitude. We explore the use of this data to improve query performance for some distance related queries such as nearest neighbor and query-within-radius (i.e. “find all points in a set P within distance d of query point q”). Further, we discuss the problem of “Network Adequacy” common to medical and communications businesses, to analyze questions such as “are at least 90% of patients living within 50 miles of a covered emergency …
On The Use Of Minimum Penalties In Statistical Learning, Ben Sherwood, Bradley S. Price
On The Use Of Minimum Penalties In Statistical Learning, Ben Sherwood, Bradley S. Price
Faculty & Staff Scholarship
Modern multivariate machine learning and statistical methodologies estimate parameters of interest while leveraging prior knowledge of the association between outcome variables. The methods that do allow for estimation of relationships do so typically through an error covariance matrix in multivariate regression which does not scale to other types of models. In this article we proposed the MinPEN framework to simultaneously estimate regression coefficients associated with the multivariate regression model and the relationships between outcome variables using mild assumptions. The MinPen framework utilizes a novel penalty based on the minimum function to exploit detected relationships between responses. An iterative algorithm that …
Electricity Market Operations With Massive Renewable Integration: New Designs, Shengfei Yin
Electricity Market Operations With Massive Renewable Integration: New Designs, Shengfei Yin
Electrical Engineering Theses and Dissertations
Electricity market has been transitioning from a conventional and deterministic operation to a stochastic operation under the increasing penetration of renewable energy. Industry-level solutions toward the future electricity market operation ask for both accuracy and efficiency while maintaining model interpretability. Hence, reliable stochastic optimization techniques come to the first place for such a complex and dynamic problem.
This work starts at proposing a solution strategy for the uncertainty-based power system planning problem, which acts as a preliminary and instructs the electricity market operation. Considering 100% renewable penetration in the future, it analyzes the cost-effectiveness of renewable energy from a long-term …
Counting And Sampling Small Structures In Graph And Hypergraph Data Streams, Themistoklis Haris
Counting And Sampling Small Structures In Graph And Hypergraph Data Streams, Themistoklis Haris
Dartmouth College Undergraduate Theses
In this thesis, we explore the problem of approximating the number of elementary substructures called simplices in large k-uniform hypergraphs. The hypergraphs are assumed to be too large to be stored in memory, so we adopt a data stream model, where the hypergraph is defined by a sequence of hyperedges.
First we propose an algorithm that (ε, δ)-estimates the number of simplices using O(m1+1/k / T) bits of space. In addition, we prove that no constant-pass streaming algorithm can (ε, δ)- approximate the number of simplices using less than O( m 1+1/k / T ) bits of space. Thus …
Improving Additional Adversarial Robustness For Classification, Michael Guo
Improving Additional Adversarial Robustness For Classification, Michael Guo
McKelvey School of Engineering Graduate Student Theses & Dissertations
Although neural networks have achieved remarkable success on classification, adversarial robustness is still a significant concern. There are now a series of approaches for designing adversarial examples and methods to defending against them. This paper consists of two projects. In our first work, we propose an approach by leveraging cognitive salience to enhance additional robustness on top of these methods. Specifically, for image classification, we split an image into the foreground (salient region) and background (the rest) and allow significantly larger adversarial perturbations in the background to produce stronger attacks. Furthermore, we show that adversarial training with dual-perturbation attacks yield …
Improving Bayesian Graph Convolutional Networks Using Markov Chain Monte Carlo Graph Sampling, Aneesh Komanduri
Improving Bayesian Graph Convolutional Networks Using Markov Chain Monte Carlo Graph Sampling, Aneesh Komanduri
Computer Science and Computer Engineering Undergraduate Honors Theses
In the modern age of social media and networks, graph representations of real-world phenomena have become incredibly crucial. Often, we are interested in understanding how entities in a graph are interconnected. Graph Neural Networks (GNNs) have proven to be a very useful tool in a variety of graph learning tasks including node classification, link prediction, and edge classification. However, in most of these tasks, the graph data we are working with may be noisy and may contain spurious edges. That is, there is a lot of uncertainty associated with the underlying graph structure. Recent approaches to modeling uncertainty have been …
Machine Learning Approaches To Dribble Hand-Off Action Classification With Sportvu Nba Player Coordinate Data, Dembe Stephanos
Machine Learning Approaches To Dribble Hand-Off Action Classification With Sportvu Nba Player Coordinate Data, Dembe Stephanos
Electronic Theses and Dissertations
Recently, strategies of National Basketball Association teams have evolved with the skillsets of players and the emergence of advanced analytics. One of the most effective actions in dynamic offensive strategies in basketball is the dribble hand-off (DHO). This thesis proposes an architecture for a classification pipeline for detecting DHOs in an accurate and automated manner. This pipeline consists of a combination of player tracking data and event labels, a rule set to identify candidate actions, manually reviewing game recordings to label the candidates, and embedding player trajectories into hexbin cell paths before passing the completed training set to the classification …
Network-Based Analysis Of Early Pandemic Mitigation Strategies: Solutions, And Future Directions, Pegah Hozhabrierdi, Raymond Zhu, Maduakolam Onyewu, Sucheta Soundarajan
Network-Based Analysis Of Early Pandemic Mitigation Strategies: Solutions, And Future Directions, Pegah Hozhabrierdi, Raymond Zhu, Maduakolam Onyewu, Sucheta Soundarajan
Northeast Journal of Complex Systems (NEJCS)
Despite the large amount of literature on mitigation strategies for pandemic spread, in practice, we are still limited by naive strategies, such as lockdowns, that are not effective in controlling the spread of the disease in long term. One major reason behind adopting basic strategies in real-world settings is that, in the early stages of a pandemic, we lack knowledge of the behavior of a disease, and so cannot tailor a more sophisticated response. In this study, we design different mitigation strategies for early stages of a pandemic and perform a comprehensive analysis among them. We then propose a novel …
Unsupervised Data Mining Technique For Clustering Library In Indonesia, Robbi Rahim, Joseph Teguh Santoso, Sri Jumini, Gita Widi Bhawika, Daniel Susilo, Danny Wibowo
Unsupervised Data Mining Technique For Clustering Library In Indonesia, Robbi Rahim, Joseph Teguh Santoso, Sri Jumini, Gita Widi Bhawika, Daniel Susilo, Danny Wibowo
Library Philosophy and Practice (e-journal)
Organizing school libraries not only keeps library materials, but helps students and teachers in completing tasks in the teaching process so that national development goals are in order to improve community welfare by producing quality and competitive human resources. The purpose of this study is to analyze the Unsupervised Learning technique in conducting cluster mapping of the number of libraries at education levels in Indonesia. The data source was obtained from the Ministry of Education and Culture which was processed by the Central Statistics Agency (abbreviated as BPS) with url: bps.go.id/. The data consisted of 34 records where the attribute …
K-Nearest Neighbors Density-Based Clustering, Avory C. Bryant
K-Nearest Neighbors Density-Based Clustering, Avory C. Bryant
Theses and Dissertations
Traditional density-based clustering approaches rely on a distance-based parameter to define data connectivity and density. However, an appropriate value of this parameter can be difficult to determine as it is highly dependent on the underlying distribution of the data. In particular, distribution parameters affect the scale of inter-group distances (e.g., variance); this dependence leads to a well-known inability to simultaneously detect clusters at varying levels of density. In this work, connectivity and density are defined according to the rank-order induced by the distance metric (i.e., invariant to the expected scale of the distances). Connectivity by k-nearest neighbors and density by …
Explainable Feature- And Decision-Level Fusion, Siva Krishna Kakula
Explainable Feature- And Decision-Level Fusion, Siva Krishna Kakula
Dissertations, Master's Theses and Master's Reports
Information fusion is the process of aggregating knowledge from multiple data sources to produce more consistent, accurate, and useful information than any one individual source can provide. In general, there are three primary sources of data/information: humans, algorithms, and sensors. Typically, objective data---e.g., measurements---arise from sensors. Using these data sources, applications such as computer vision and remote sensing have long been applying fusion at different "levels" (signal, feature, decision, etc.). Furthermore, the daily advancement in engineering technologies like smart cars, which operate in complex and dynamic environments using multiple sensors, are raising both the demand for and complexity of fusion. …
A Hybrid Gene Selection Strategy Based On Fisher And Ant Colony Optimization Algorithm For Breast Cancer Classification, Mohammed Hamim, Ismail El Moudden, Mohan D. Pant, Hicham Moutachaouik, Mustapha Hain
A Hybrid Gene Selection Strategy Based On Fisher And Ant Colony Optimization Algorithm For Breast Cancer Classification, Mohammed Hamim, Ismail El Moudden, Mohan D. Pant, Hicham Moutachaouik, Mustapha Hain
EVMS School of Health Professions Faculty Publications
Breast cancer poses the greatest threat to human life and especially to women's life. Despite the progress made in data mining technology in recent years, the ability to predict and diagnose such fatal diseases based on gene expression data still reveals a limited prediction performance, which may not be surprising since most of the genes in expression data are believed to be irrelevant or redundant. The dimensionality reduction process may be considered as a crucial step to analyze gene expression data, as it can reduce the high dimensionality of the breast cancer datasets, which may result into a better prediction …
Learning From Multi-Class Imbalanced Big Data With Apache Spark, William C. Sleeman Iv
Learning From Multi-Class Imbalanced Big Data With Apache Spark, William C. Sleeman Iv
Theses and Dissertations
With data becoming a new form of currency, its analysis has become a top priority in both academia and industry, furthering advancements in high-performance computing and machine learning. However, these large, real-world datasets come with additional complications such as noise and class overlap. Problems are magnified when with multi-class data is presented, especially since many of the popular algorithms were originally designed for binary data. Another challenge arises when the number of examples are not evenly distributed across all classes in a dataset. This often causes classifiers to favor the majority class over the minority classes, leading to undesirable results …
Analysis Of Github Pull Requests, Canon Ellis
Analysis Of Github Pull Requests, Canon Ellis
Computer Science and Engineering Theses and Dissertations
The popularity of the software repository site GitHub has created a rise in the Pull Based Development Models' use. An essential portion of pull-based development is the creation of Pull Requests. Pull Requests often have to be reviewed by an individual to be approved and accepted into the Master branch of a software repository. The reviewing process can often be time-consuming and introduce a relatively high level of lost development time. This paper examines thousands of pull requests to understand the most valuable metadata of pull requests. We then introduce metrics in comparing the metadata of pull requests to understand …
Espade: An Efficient And Semantically Secure Shortest Path Discovery For Outsourced Location-Based Services, Bharath K. Samanthula, Divyadharshini Karthikeyan, Boxiang Dong, K. Anitha Kumari
Espade: An Efficient And Semantically Secure Shortest Path Discovery For Outsourced Location-Based Services, Bharath K. Samanthula, Divyadharshini Karthikeyan, Boxiang Dong, K. Anitha Kumari
Department of Computer Science Faculty Scholarship and Creative Works
With the rapid growth of smart devices and technological advancements in tracking geospatial data, the demand for Location-Based Services (LBS) is facing a constant rise in several domains, including military, healthcare and transportation. It is a natural step to migrate LBS to a cloud environment to achieve on-demand scalability and increased resiliency. Nonetheless, outsourcing sensitive location data to a third-party cloud provider raises a host of privacy concerns as the data owners have reduced visibility and control over the outsourced data. In this paper, we consider outsourced LBS where users want to retrieve map directions without disclosing their location information. …
An Effective Method For Attribute Subset Selection, Considering The Resource In Pattern Recognition, Bakhtiyorjon Bakirovich Akbaraliev
An Effective Method For Attribute Subset Selection, Considering The Resource In Pattern Recognition, Bakhtiyorjon Bakirovich Akbaraliev
Chemical Technology, Control and Management
An analytical method for determining informative sets of features (INP) is developed, taking into account the resource for criteria based on the use of a measure of dispersion of classified objects. The areas of existence of the solution are defined. The statements and properties for the Fischer-type information criterion are proved, using which the proposed analytical method for determining the INP guarantees optimal results in the sense of maximizing the selected functional. The appropriateness of choosing this type of informative criterion is justified. A method for transforming attributes is proposed. The universality of the method in relation to the type …
Efficient Vehicle Routing Optimization For Autistic Users, Mohammed Shabalah Abdulrahman Hasan
Efficient Vehicle Routing Optimization For Autistic Users, Mohammed Shabalah Abdulrahman Hasan
Student Works (2020-2029)
In recent years, daily life without a vehicle would be impossible. As an inevitable result, the number of vehicles on the road increases day by day in various large cities around the world. The increased number of vehicles is a big concern because it causes a lot of traffic congestions, especially during peak hours. Besides, there has been a rapid rise of on-demand Ride-Hailing Services (RHSs), such as Grab, Uber, EzCab, and MyCar, etc. This allows passengers with smartphones to place trip requests and assign them to drivers according to requester’s location and drivers' availability. In consequence, efficient routing algorithms …
Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church
Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church
Research Collection School Of Computing and Information Systems
Spatial optimization represents a set of powerful spatial analysis techniques that can be used to identify optimal solution(s) and even generate a large number of competitive alternatives. The formulation of such problems involves maximizing or minimizing one or more objectives while satisfying a number of constraints. Solution techniques range from exact models solved with such approaches as linear programming and integer programming, or heuristic algorithms, i.e. Tabu Search, Simulated Annealing, and Genetic Algorithms. Spatial optimization techniques have been utilized in numerous planning applications, such as location-allocation modeling/site selection, land use planning, school districting, regionalization, routing, and urban design. These methods …