Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

We present an efficient parallel algorithm and its implementation for computing the diagonal of $H^-1$ where $H$ is a 2D Kohn-Sham Hamiltonian discretized on a rectangular domain using a standard second order finite difference scheme. This type of calculation can be used to obtain an accurate approximation to the diagonal of a Fermi-Dirac function of $H$ through a recently developed pole-expansion technique \cite{LinLuYingE2009}. The diagonal elements are needed in electronic structure calculations for quantum mechanical systems \citeHohenbergKohn1964, KohnSham 1965,DreizlerGross1990. We show how elimination tree is used to organize the parallel computation and how synchronization overhead is reduced by passing data level by level along this tree using the technique of local buffers and relative indices. We analyze the performance of our implementation by examining its load balance and communication overhead. We show that our implementation exhibits an excellent weak scaling on a large-scale high performance distributed parallel machine. When compared with standard approach for evaluating the diagonal a Fermi-Dirac function of a Kohn-Sham Hamiltonian associated a 2D electron quantum dot, the new pole-expansion technique that uses our algorithm to compute the diagonal of $(H-z_i I)^-1$ for a small number of poles $z_i$ is much faster, especially when the quantum dot contains many electrons.

74 ATOMIC AND MOLECULAR PHYSICS↗

DA WHITE DWARFS OBSERVED IN THE LAMOST PILOT SURVEY

A total of {approx}640, 000 objects from the LAMOST pilot survey have been publicly released. In this work, we present a catalog of DA white dwarfs (DAWDs) from the entire pilot survey. We outline a new algorithm for the selection of white dwarfs (WDs) by fitting Sersic profiles to the Balmer H{beta}, H{gamma}, and H{delta} lines of the spectra, and calculating the equivalent width of the Ca II K line. Two thousand nine hundred sixty-four candidates are selected by constraining the fitting parameters and the equivalent width of the Ca II K line. All the spectra of candidates are visually inspected. We identify 230 DAWDs (59 of which are already included in the Villanova and SDSS WD catalogs), 20 of which are DAWDs with non-degenerate companions. In addition, 128 candidates are classified as DAWDs/subdwarfs, which means the classifications are ambiguous. The result is consistent with the expected DAWD number estimated based on the LEGUE target selection algorithm.

79 ASTRONOMY AND ASTROPHYSICS↗

{beta} PICTORIS AND AB DORADUS MOVING GROUPS: LIKELY NEW LOW-MASS MEMBERS

We present results from our continuing program to identify new, low-mass, members of the nearby young moving groups (NYMGs) using a proper motion selection algorithm and various observational techniques. We have three goals: (1) to provide high priority targets for exoplanet searches by direct imaging, (2) to complete the census of the membership in the NYMGs down to {approx}0.1 M{sub sun}, and thus (3) provide a well-characterized sample of nearby (median distances at least twice as close as the Taurus and Ophiuchus star-forming regions), young (8-50 Myr) stars for detailed study of their physical properties and multiplicity. Our program proceeds as follows: we apply the selection algorithm to a proper motion catalog where initial selection cuts of candidate members are based on the mean motion of known NYMG members and the proper motions and photometric distances of the candidates. NYMG membership is investigated further using possible signs of youth, including H{alpha} emission and X-ray flux, and then verified through radial velocity measurements. We identify TYC 1766-1431-1 (M3), TYC 1208-468-1 and 2 (K3), TYC 7558-655-1 (K5), and PM I04439+3723W and E (M3) as likely members of the {beta} Pictoris moving group (BPMG) and TYC 1741-2117-1N and S (K7), TYC 1752-63-1 (K7), TYC 523-573-1 (K7), and TYC 4943-192-1 (M0) as likely members of the AB Doradus moving group (ABDMG). We also rule out the membership of several BPMG and ABDMG candidates. To date our program has identified 16 new NYMG members of spectral type K3 or later.

79 ASTRONOMY AND ASTROPHYSICS↗

A Diagnoser Algorithm for Anomaly Detection in DEDS under Partial Unreliable Observations: Characterization and Inclusion in Sensor Configuration Optimizaton

Complex engineering systems have to be carefully monitored to meet demanding performance requirements, including detecting anomalies in their operations. There are two major monitoring challenges for these systems. The first challenge is that information collected from the monitored system is often partial and/or unreliable, in the sense that some occurred events may not be reported and/or may be reported incorrectly (e.g., reported as another event). The second is that anomalies often consist of sequences of event patterns separated in space and time. This paper introduces and analyzes a diagnoser algorithm that meets these challenges for detecting and counting occurrences of anomalies in engineering systems. The proposed diagnoser algorithm assumes that models are available for characterizing plant operations (via stochastic automata) and sensors (via probabilistic mappings) used for reporting partial and unreliable information. Methods for analyzing the effects of model uncertainties on the diagnoser performance are also discussed. In order to select configurations that reduce sensor costs, while satisfying diagnoser performance requirements, a sensor configuration selection algorithm developed in previous work is then extended for the proposed diagnoser algorithm. The proposed algorithms and methods are then applied to a multi-unit-operation system, which is derived from an actual facility application. Results show that the proposed diagnoser algorithm is able to detect and count occurrences of anomalies accurately and that its performance is robust to model uncertainties. Furthermore, the sensor configuration selection algorithm is able to suggest optimal sensor configurations with significantly reduced costs, while still yielding acceptable performance for counting the occurrences of anomalies.

97 MATHEMATICS AND COMPUTING↗

Performance Evaluation of District Energy Microgrids Planning Tool for Non-Technical Users

Community Microgrids are increasingly gaining popularity worldwide for their efficiency, cost-effectiveness, and local resilience improvement. Microgrid planning tools play a crucial role in their deployment. In the process, tentative designs of the microgrid are simulated, analyzed, and optimized. Due to the complexity of the problem, planning tools must carefully balance computational efficiency while seeking the most optimal solutions. This paper investigates the impact of algorithm selection on CPU and memory utilization of a Community Microgrid planning tool that is specifically designed for non-technical users. We compare two version of the code with two alternatives for Community Microgrid planning tools: a Greedy Algorithm, and a Linear Programming Approach. This comparison examines scenarios spanning from 2 to 50 buildings. Our findings revealed a significant difference in performance between the two algorithms, underscoring the critical role of algorithm selection in optimizing the efficiency of Community Microgrid Planning Tools.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Validation of the Scientific Program for the Dark Energy Spectroscopic Instrument

The Dark Energy Spectroscopic Instrument (DESI) was designed to conduct a survey covering 14,000 deg$^{2}$ over 5 yr to constrain the cosmic expansion history through precise measurements of baryon acoustic oscillations (BAO). The scientific program for DESI was evaluated during a 5 month survey validation (SV) campaign before beginning full operations. This program produced deep spectra of tens of thousands of objects from each of the stellar Milky Way Survey (MWS), Bright Galaxy Survey (BGS), luminous red galaxy (LRG), emission line galaxy (ELG), and quasar target classes. These SV spectra were used to optimize redshift distributions, characterize exposure times, determine calibration procedures, and assess observational overheads for the 5 yr program. In this paper, we present the final target selection algorithms, redshift distributions, and projected cosmology constraints resulting from those studies. We also present a One-Percent Survey conducted at the conclusion of SV covering 140 deg$^{2}$ using the final target selection algorithms with exposures of a depth typical of the main survey. The SV indicates that DESI will be able to complete the full 14,000 deg$^{2}$ program with spectroscopically confirmed targets from the MWS, BGS, LRG, ELG, and quasar programs with total sample sizes of 7.2, 13.8, 7.46, 15.7, and 2.87 million, respectively. These samples will allow exploration of the Milky Way halo, clustering on all scales, and BAO measurements with a statistical precision of 0.28% over the redshift interval z < 1.1, 0.39% over the redshift interval 1.1 < z < 1.9, and 0.46% over the redshift interval 1.9 < z < 3.5.

79 ASTRONOMY AND ASTROPHYSICS↗

A support vector machine (SVM) for predicting preferred treatment position in radiotherapy of patients with breast cancer

Purpose: NYU 05-181 protocol compared the CT simulation in both supine and prone positions for 400 patients with breast cancer (200 left-breast and 200 right-breast) to identify which setup is better at sparing heart and lung involvement in the treatment process. The results demonstrated that all right-breast patients benefited from the prone treatment position, while for left-breast patients, 85% were better treated prone and 15% were better treated supine. Using the clinical data collected from this protocol, the authors aimed at developing an automated tool capable of identifying which of the left-breast cancer patients are better treated supine without obtaining a second CT scan in the supine position. Methods: Prone CT scans from 198 of the 200 left-breast cancer patients enrolled in NYU 05-181 protocol were deidentified and exported to a dedicated research planning workstation. Three-dimensional geometric features of the organs at risk and tumor bed were extracted. A two-stage classifier was used to classify patients into the prone class or the supine class. In the first stage, the authors use simple thresholding to divide the patients into two groups based on their in-field heart volume. For patients with in-field heart volume {<=}0.1 cc, the prone position was chosen as the preferred treatment position. Patients with in-field heart volume >0.1 cc will be further classified in the second stage by a weighted support vector machine (SVM). The weight parameters of the SVM were adjusted to maximize the specificity [true-supine/(true-supine+false-prone)] at the cost of lowering but still maintaining reasonable sensitivity [true-prone/(true-prone+false-supine)]. The authors used K-fold cross validations to test the performance of the SVM classifier. A feature selection algorithm was also used to identify features that give the best classification performance. Results: After the first stage, 49 of the 198 left-breast cancer patients were found to have >0.1 cc of in-field heart volume. The three geometric features of heart orientation, distance between heart and tumor, and in-field lung were selected by the feature selection algorithm in the second stage of the two-stage classifier to give the best predefined weighted accuracy. The overall sensitivity and specificity of the proposed method were found to be 90.4% and 99.3%, respectively. Using two-stage classification, the authors reduced the proportion of prone-treated patients that need a second supine CT scan down to 16.3/170 or 9.6%, as compared to 21/170 or 12.4% when the authors use only the first stage (thresholding) for classification. Conclusions: The authors' study showed that a feature-based classifier is feasible for predicting the preferred treatment position, based on features extracted from prone CT scans. The two-stage classifier achieved very high specificity at an acceptable expense of sensitivity.

60 APPLIED LIFE SCIENCES↗

Data Selection Improvement For MicroBooNE

Data selection is an extremely important part of data analysis for any experiment. Finding a physics result is often the result of sifting through a massive amount of data, keeping data that we believe to be signal, and throwing out data we do not. This process is called data selection. Creating a selection algorithm is an intensive process that must balance keeping enough data to have statistics and maximizing the signal purity of that data. We also need to choose the right reconstruction method, a tool to take raw data from the detector and convert it into physics results. In this study, we used three different reconstruction tools, Pandora, WireCell, and LANTERN, for the MicroBooNE experiment in conjunction to improve the selection algorithm for analysis. For the case of this study, we look into the charged current N proton 0 pions (CCNp0$\pi$) interaction channel. This is the dominant channel for the Short Baseline Neutrino (SBN) program and is expected to be a large contributor to the Deep Underground Neutrino Experiment (DUNE). We first investigated each of the three tools to find out more about their strengths and weaknesses as reconstructions, and compared them to the truth information directly from the MicroBooNE simulation pipeline. We then put together a direct comparison of the three methods to find which method or combination of methods would return the best result for us. While the study is ongoing, we have learned a lot about data selection for the experiment and the differences between the reconstruction tools.

Dillon, Brayden [Fermilab]↗

Quasar classification using color and variability

We conduct a pilot investigation to determine the optimal combination of color and variability information to identify quasars in current and future multi-epoch optical surveys. We use a Bayesian quasar selection algorithm to identify 35,820 type 1 quasar candidates in a 239 deg{sup 2} field of the Sloan Digital Sky Survey (SDSS) Stripe 82, using a combination of optical photometry and variability. Color analysis is performed on 5-band single- and multi-epoch SDSS optical photometry to a depth of r∼22.4. From these data, variability parameters are calculated by fitting the structure function of each object in each band with a power-law model using 10 to >100 observations over timescales from ∼1 day to ∼8 years. Selection was based on a training sample of 13,221 spectroscopically confirmed type-1 quasars, largely from the SDSS. Using variability alone, colors alone, and combining variability and colors we achieve 91%, 93%, and 97% quasar completeness and 98%, 98%, and 97% efficiency, respectively, with particular improvement in the selection of quasars at 2.7<z<3.5 where quasars and stars have similar optical colors. The 22,867 quasar candidates that are not spectroscopically confirmed reach a depth of i∼22.0; 21,876 (95.7%) are dimmer than coadded i-band magnitude of 19.9, the cutoff for spectroscopic follow-up for SDSS on Stripe 82. Brighter than 19.9, we find 5.7% more quasar candidates without confirming spectra in sky regions otherwise considered complete. The resulting quasar sample has sufficient purity (and statistically correctable incompleteness) to produce a luminosity function comparable to those determined by spectroscopic investigations. We discuss improvements that can be made to the process in preparation for performing similar photometric selection and science on data from post-SDSS sky surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Operation of the ATLAS trigger system in Run 2

The ATLAS experiment at the Large Hadron Collider employs a two-level trigger system to record data at an average rate of 1 kHz from physics collisions, starting from an initial bunch crossing rate of 40 MHz. During the LHC Run 2 (2015–2018), the ATLAS trigger system operated successfully with excellent performance and flexibility by adapting to the various run conditions encountered and has been vital for the ATLAS Run-2 physics programme. For proton-proton running, approximately 1500 individual event selections were included in a trigger menu which specified the physics signatures and selection algorithms used for the data-taking, and the allocated event rate and bandwidth. The trigger menu must reflect the physics goals for a given data collection period, taking into account the instantaneous luminosity of the LHC and limitations from the ATLAS detector readout, online processing farm, and offline storage. This document discusses the operation of the ATLAS trigger system during the nominal proton-proton data collection in Run 2 with examples of special data-taking runs. Aspects of software validation, evolution of the trigger selection algorithms during Run 2, monitoring of the trigger system and data quality as well as trigger configuration are presented.

43 PARTICLE ACCELERATORS↗

Parametrization of textural patterns in {sup 123}I-ioflupane imaging for the automatic detection of Parkinsonism

Purpose: A novel approach to a computer aided diagnosis system for the Parkinson's disease is proposed. This tool is intended as a supporting tool for physicians, based on fully automated methods that lead to the classification of{sup 123}I-ioflupane SPECT images. Methods: {sup 123}I-ioflupane images from three different databases are used to train the system. The images are intensity and spatially normalized, then subimages are extracted and a 3D gray-level co-occurrence matrix is computed over these subimages, allowing the characterization of the texture using Haralick texture features. Finally, different discrimination estimation methods are used to select a feature vector that can be used to train and test the classifier. Results: Using the leave-one-out cross-validation technique over these three databases, the system achieves results up to a 97.4% of accuracy, and 99.1% of sensitivity, with positive likelihood ratios over 27. Conclusions: The system presents a robust feature extraction method that helps physicians in the diagnosis task by providing objective, operator-independent textural information about{sup 123}I-ioflupane images, commonly used in the diagnosis of the Parkinson's disease. Textural features computation has been optimized by using a subimage selection algorithm, and the discrimination estimation methods used here makes the system feature-independent, allowing us to extend it to other databases and diseases.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Prospect of Dimuon Analysis at the MINOS Near Detector

We present the prospect of dimuon analysis at the MINOS Near Detector. We report the selection of opposite sign charm induce dimuon events in the neutrino-nucleon deep inelastic scattering. Using a cut based optimized selection algorithm, we expect to select 1484 charm induce dimuon events in 7.0x10{sup 20} POT of projected data. We study the cross section ratio of charm induce dimuon to single muon charge-current events in energy range 4-80 GeV in simulated events and expect a 10% statistical uncertainty on the cross section ratio in projected data. We also report the study of like sign dimuon events and compare the data with Monte Carlo prediction.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Design and implementation of I/O performance prediction scheme on HPC systems through large-scale log analysis

Abstract Large-scale high performance computing (HPC) systems typically consist of many thousands of CPUs and storage units used by hundreds to thousands of users simultaneously. Applications from large numbers of users have diverse characteristics, such as varying computation, communication, memory, and I/O intensity. A good understanding of the performance characteristics of each user application is important for job scheduling and resource provisioning. Among these performance characteristics, I/O performance is becoming increasingly important as data sizes rapidly increase and large-scale applications, such as simulation and model training, are widely adopted. However, predicting I/O performance is difficult because I/O systems are shared among all users and involve many layers of software and hardware stack, including the application, network interconnect, operating system, file system, and storage devices. Furthermore, updates to these layers and changes in system management policy can significantly alter the I/O behavior of applications and the entire system. To improve the prediction of the I/O performance on HPC systems, we propose integrating information from several different system logs and developing a regression-based approach to predict the I/O performance. Our proposed scheme can dynamically select the most relevant features from the log entries using various feature selection algorithms and scoring functions, and can automatically select the regression algorithm with the best accuracy for the prediction task. The evaluation results show that our proposed scheme can predict the write performance with up to 90% prediction accuracy and the read performance with up to 99% prediction accuracy using the real logs from the Cori supercomputer system at NERSC.

97 MATHEMATICS AND COMPUTING↗

Deep Learning for Automated Identification of Eels in Sonar Data

Freshwater eels, such as the American eel (Anguilla rostrata) present numerous challenges related to safe downstream fish passage at hydroelectric facilities. One of those challenges is effective monitoring of their abundance, movements, and behavior to facilitate design and operation of eel protection and passage facilities. A previous EPRI study documented the ability of human analysts to reliably identify American eels in data obtained with a 1100/1800 kHz, multibeam sonar. This report describes a project to develop deep learning (a subset of artificial intelligence) tools to automate the time-consuming, subjective process of eel identification in multibeam sonar data. The project exploited new data collected in the laboratory and the existing data from the prior EPRI field study to develop and test deep learning and other data analytic tools, including wavelet filtering, differencing for static object removal, and convolutional neural network analysis. The analysis of the laboratory data demonstrated feasibility of the approach, revealed object characteristics observed with the sonar that distinguish eels from similarly sized and shaped acoustic targets, and provided additional data for algorithm selection and training. Deep learning algorithms trained and tested on the laboratory data alone achieved accuracy rates of greater than 98% when classifying acoustic images of eels and similar-sized neutrally buoyant sticks. The algorithm trained and tested on the pre-existing field data alone, and yielded classification accuracy of 9.3% false positives and 13.3% false negatives when distinguishing between eels and sticks/PVC pipes based on video clips (i.e., multiple, consecutive images). This performance is comparable to the classification accuracy achieved by human analysts in the prior study. The deep learning algorithm trained on a combination of video clips obtained in the laboratory and the field and tested on video clips from the field, was able to distinguish eels from sticks and PVC pipes (a river debris analog) of similar size with 100% accuracy. Outreach to the hardware, software, and end-user communities early in the project helped to identify needs and specify the application space. Outreach to those communities at the end of the project communicated project results and opportunities for further development. The project achieved proof of concept for automated identification of eel in multibeam sonar data. Future work should focus on acquisition of additional data for more robust algorithm training and testing; modification of the software tools to accommodate multiple acoustic targets in the acoustic field at a given time; identification of additional object classes; incorporation of motion in the object identification and classification algorithms; operationalizing the software tools, including integration with other existing sonar data analysis tools; and partnering with hardware and software providers for distribution of the software tools with their commercial products.

13 HYDRO ENERGY↗

Field Measurement and Analysis of Frequency and RoCoF for Low-Inertia Power Systems

The frequency measurement and rate of change of frequency (RoCoF) calculations are important for active power, frequency control, and frequency-related protection in power system operations. With the rapid decrease in inertia under modern power systems, however, multiple power variations introduced by variable renewable energy bring large RoCoF and introduce oscillations in frequency measurements. To shed light on this issue, this article proposes a frequency measurement and RoCoF analysis technology, as well as the sensitivity analysis for the real low-inertia power grid. First, a real-world event in an island power grid is analyzed as an example, and an event numerical model is estimated considering four uncertainties, including event RoCoF, oscillation magnitude, oscillation frequency, and underfrequency load-shedding threshold. Then, a sensitivity analysis is performed using the Sobol indices method and quasi-Monte Carlo simulations to identify the dominant uncertainties based on the event model. Here, the dominant uncertainties are compared to provide a guideline for the frequency estimation algorithm selection under different event cases. This algorithm is compared with an enhanced zero-crossing algorithm and gives a 3.41% better RoCoF error rate. Finally, an experiment is conducted using universal grid analyzers to validate the simulation results and the theoretical analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Crystallographic variant mapping using precession electron diffraction data

In this work, we developed three methods to map crystallographic variants of samples at the nanoscale by analyzing precession electron diffraction data using a high-temperature shape memory alloy and a VO2 thin film on sapphire as the model systems. The three methods are (I) a user-selecting-reference pattern approach, (II) an algorithm-selecting-reference-pattern approach, and (III) a k-means approach. In the first two approaches, Euclidean distance, Cosine, and Structural Similarity (SSIM) algorithms were assessed for the diffraction pattern similarity quantification. We demonstrated that the Euclidean distance and SSIM methods outperform the Cosine algorithm. We further revealed that the random noise in the diffraction data can dramatically affect similarity quantification. Denoising processes could improve the crystallographic mapping quality. With the three methods mentioned above, we were able to map the crystallographic variants in different materials systems, thus enabling fast variant number quantification and clear variant distribution visualization. The advantages and disadvantages of each approach are also discussed. We expect these methods to benefit researchers who work on martensitic materials, in which the variant information is critical to understand their properties and functionalities.

Crystallographic variant mapping↗

Foundations of Feature Selection and Classification for Non-Gaussian Distributed Targets

This report describes the author’s research toward creating algorithms for selecting useful statistical features in pattern/target classification problems in which the features are non-Gaussian distributed. In engineering practice, it is common to either (1) Not perform any feature selection procedure, or (2) Use a feature selection algorithm that assumes the features are Gaussian distributed. This process can be far from optimal if the data are actually non-Gaussian, as they frequently are in practice. This research has the goal of mitigating that problem by creating a useful algorithm that can be used in practice. The approach is to focus on the performance indices used in common feature selection algorithms, such as Branch and Bound algorithms and the Sequential Forward Selection Algorithm. Ordinarily, the performance index used to measure the class separation in feature space involves assuming the data are Gaussian and deriving tractable performance indices that use closed form equations that represent the probability density functions of the class data. The advantage of this approach is that it produces feature selection algorithms that have low computational complexity and do not require knowledge of the actual data densities. The disadvantage is that these algorithms may not perform reasonably when the data are non-Gaussian, as they commonly are in practice. This research examines the use of information-theoretic class separability measures that can deal with the non-Gaussian case. In particular, this work shows that the Hellinger Distance (a divergence measure), has very desirable mathematical properties and can be useful for feature selection. The work in this paper employs a multivariate kernel density estimator along with the Hellinger Distance and an optimal subset selection algorithm to do feature selection. This report (1) Defines the classification and feature selection problems, (2) Describes the continuous variable Hellinger distance in one dimension and discusses its mathematical properties in comparison with other distance measures, (3) Develops the discrete variable Hellinger distance expression for one and two dimensions, and shows that the discrete Hellinger distance for multiple dimensions is a straightforward extension, and (4) Presents experimental density estimation results using a new MATLAB implementation of a multivariate kernel density estimator. The draft of this report served as a starting point for Ensign Matthew Wilder’s MSEE thesis work at the Naval Postgraduate School (NPS) in 2010 and 2011. Ensign Wilder completed his thesis and graduated from NPS in June 2011 (M. J. Wilder, “Automatic Target Recognition: Statistical Feature Selection of Non-Gaussian Distributed Target Classes,” MSEE Thesis, Naval Postgraduate School, Thesis Advisor: Grace A. Clark, Second Reader: Monique P. Fargues, June 2011). In the thesis, Ensign Wilder created implementations of the Branch and Bound and Sequential Feature Selection algorithms, extended the multivariate kernel density estimator code, and evaluated the performance of Hellinger Distance-based feature selection algorithms using both simulated data and data from a real-world benchmark data set. The new algorithm was shown to be very effective for both Gaussian and non-Gaussian data sets. The advantages gained for non-Gaussian data come at the cost of increased computational complexity. Using a laptop computer for practical problems, we generally use initial feature vectors containing no more than about ten or twelve features. Proposed future research lies in creating faster kernel density estimator algorithms that would allow for the use of higher dimensional data.

42 ENGINEERING↗