Log in

Relevant bibliographies by topics / Split algorithm

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Split algorithm'

Author: Grafiati

Published: 15 February 2025

Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Split algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Split algorithm"

1

Liang, Liang. "A Fusion Multiobjective Empire Split Algorithm." Journal of Control Science and Engineering 2020 (December 14, 2020): 1–14. http://dx.doi.org/10.1155/2020/8882086.

Full text

Abstract:

In the last two decades, swarm intelligence optimization algorithms have been widely studied and applied to multiobjective optimization problems. In multiobjective optimization, reproduction operations and the balance of convergence and diversity are two crucial issues. Imperialist competitive algorithm (ICA) and sine cosine algorithm (SCA) are two potential algorithms for handling single-objective optimization problems, but the research of them in multiobjective optimization is scarce. In this paper, a fusion multiobjective empire split algorithm (FMOESA) is proposed. First, an initialization

APA, Harvard, Vancouver, ISO, and other styles

2

Ortiz Díaz, Agustín Alejandro, Isvani Inocencio Frías Blanco, Laura María Palomino Mariño, and Fabiano Baldo. "An Online Tree-Based Approach for Mining Non-Stationary High-Speed Data Streams." Revista de Informática Teórica e Aplicada 27, no. 1 (2020): 36–47. http://dx.doi.org/10.22456/2175-2745.90822.

Full text

Abstract:

This paper presents a new learning algorithm for inducing decision trees from data streams. In these domains, large amounts of data are constantly arriving over time, possibly at high speed. The proposed algorithm uses a top-down induction method for building trees, splitting leaf nodes recursively, until none of them can be expanded. The new algorithm combines two split methods in the tree induction. The first method is able to guarantee, with statistical significance, that each split chosen would be the same as that chosen using infinite examples. By doing so, it aims at ensuring that the tr

APA, Harvard, Vancouver, ISO, and other styles

3

Pinker, Rachel T., Donglian Sun, Meng-Pai Hung, Chuan Li, and Jeffrey B. Basara. "Evaluation of Satellite Estimates of Land Surface Temperature from GOES over the United States." Journal of Applied Meteorology and Climatology 48, no. 1 (2009): 167–80. http://dx.doi.org/10.1175/2008jamc1781.1.

Full text

Abstract:

Abstract A comprehensive evaluation of split-window and triple-window algorithms to estimate land surface temperature (LST) from Geostationary Operational Environmental Satellites (GOES) that were previously described by Sun and Pinker is presented. The evaluation of the split-window algorithm is done against ground observations and against independently developed algorithms. The triple-window algorithm is evaluated only for nighttime against ground observations and against the Sun and Pinker split-window (SP-SW) algorithm. The ground observations used are from the Atmospheric Radiation Measur

APA, Harvard, Vancouver, ISO, and other styles

4

Delsarte, P., and Y. Genin. "The split Levinson algorithm." IEEE Transactions on Acoustics, Speech, and Signal Processing 34, no. 3 (1986): 470–78. http://dx.doi.org/10.1109/tassp.1986.1164830.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hidayat, Trifenaus Prabu, and Andre Sugioko. "Performance Analyzes of Bee Colony Split-Plot Algorithm." International Journal of Information and Education Technology 5, no. 7 (2015): 549–52. http://dx.doi.org/10.7763/ijiet.2015.v5.566.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Jambunathan, Suriya Prakash. "A Machine Learning-Based Approach for Antenna Design Using Class_Reg Algorithm Optimized Using Genetic Algorithm." International Journal for Research in Applied Science and Engineering Technology 9, no. 11 (2021): 1682–86. http://dx.doi.org/10.22214/ijraset.2021.39097.

Full text

Abstract:

Abstract: Microstrip patch antennas are predominantly in use in mobile communication and healthcare. Their performances are even improved, using Split-Ring Resonator cells. But finding the ideal dimensions of the microstrip patch antenna and calculating the correct number and size of the split ring resonator cells consume a lot of time when we use Electromagnetic Simulation software to design first and then simulate. Using the pre-calculated results of certain sets of microstrip patch antennas with split ring resonators, a machine learning model can be trained and hence be used to predict the

APA, Harvard, Vancouver, ISO, and other styles

7

Huang, Zheng, Yanting Zhang, Lin Wang, Jingyu Xu, and Yunlong Zheng. "Research on multi-objective parameter optimization of split flow dual flash thermodynamic cycle." Journal of Physics: Conference Series 2728, no. 1 (2024): 012008. http://dx.doi.org/10.1088/1742-6596/2728/1/012008.

Full text

Abstract:

Abstract In addition to considering the intermediate pressure variables, the split flow double flash thermodynamic cycle also needs to consider the operating conditions and split flow coefficient of the cycle. Traditional algorithms require too much computation and have a longer response time. Faced with sudden operating conditions or changes in production conditions, it is difficult to quickly re-optimize the intermediate parameters of the split flow double flash thermal cycle and carry out corresponding system control. This article uses intelligent optimization algorithms instead of global s

APA, Harvard, Vancouver, ISO, and other styles

8

Cui, Ying Hua, Yu Ping Zhao, Hui Yang Wang, and Jin He Zhou. "Pre-Split Anti-Collision Binary Tree Algorithm." Applied Mechanics and Materials 220-223 (November 2012): 2403–6. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.2403.

Full text

Abstract:

In RFID system, reducing the frequency of collisions is very important for fast tag identification. In this paper, we proposed a pre-split anti-collision algorithm based on binary tree algorithm. The proposed scheme pre-splits the tags into different groups before the reader detects the first tag. Simulation results indicate that the modified algorithm can achieve much better performance than the conventional one.

APA, Harvard, Vancouver, ISO, and other styles

9

YAO, YONGHONG, NASEER SHAHZAD, MIHAI POSTOLACHE, and JEN-CHIH YAO. "Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems." Carpathian Journal of Mathematics 40, no. 3 (2024): 753–68. http://dx.doi.org/10.37193/cjm.2024.03.14.

Full text

Abstract:

In this paper, we survey iterative algorithms for solving split variational inequalities and fixed point problems in Hilbert spaces. The investigated split problem is involved in two pseudomonotone operators and two pseudocontractive operators. We propose a self-adaptive Tseng-type algorithm for finding a solution of the split problem. Strong convergence of the suggested algorithm is shown under weaker conditions than sequential weak-to-weak continuity imposed on two pseudomonotone operators.

APA, Harvard, Vancouver, ISO, and other styles

10

Jin, C., L. J. Lu, and J. N. Min. "A two-stage construction heuristic approach for vehicle routing problem with split deliveries and pickups: Case studies and performance comparison." Advances in Production Engineering & Management 17, no. 1 (2022): 121–33. http://dx.doi.org/10.14743/apem2022.1.425.

Full text

Abstract:

The vehicle routing problem with split deliveries and pickups is a hot research topic in recent years, where a customer can be served multiple times with split deliveries and pickups. The objective is to minimize the travel distance, use the fewest number of vehicles and increase the load rate, which will further reduce the carbon emissions that damage the environment. In this paper, we use a two-stage construction heuristic approach to solve this problem. First, partitioning algorithms based on the multi-restart-iterative sweep algorithm are adopted to partition the customer domain into sub-d

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Split algorithm"

1

Liu, Rongrong. "A Novel Attack Method Against Split Manufactured Circuits." University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1573812230926837.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Shi, Haijian. "Best-first Decision Tree Learning." The University of Waikato, 2007. http://hdl.handle.net/10289/2317.

Full text

Abstract:

In best-first top-down induction of decision trees, the best split is added in each step (e.g. the split that maximally reduces the Gini index). This is in contrast to the standard depth-first traversal of a tree. The resulting tree will be the same, just how it is built is different. The objective of this project is to investigate whether it is possible to determine an appropriate tree size on practical datasets by combining best-first decision tree growth with cross-validation-based selection of the number of expansions that are performed. Pre-pruning, post-pruning, CART-pruning can be perfo

APA, Harvard, Vancouver, ISO, and other styles

3

Lian, Tea Sormbroen. "Computing Almost Split Sequences : An algorithm for computing almost split sequences of finitely generated modules over a finite dimensional algebra." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-19355.

Full text

Abstract:

An artin algebra $l$ over a commutative, local, artinian ring $R$ was fixed, and with this foundation some topics from representation theory were discussed. A series of functors of module categories were defined, and almost split sequences were introduced with some basic results. An isomorphism $omega_{delta,X} : D delta^* rightarrow delta_*(DTr(X))$ of $Gamma$-modules for an artin $R$-algebra $Gamma$ was constructed. The isomorphism $omega_{delta,X}$ was applied to a special case, yielding a deterministic algorithm for computing almost split sequences in the case that $R$ is a field.

APA, Harvard, Vancouver, ISO, and other styles

4

Lakshman, Prabhashankar. "Parallel implementation of the split and merge algorithm on the hypercube machine." Ohio : Ohio University, 1989. http://www.ohiolink.edu/etd/view.cgi?ohiou1182440993.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Brochier, Felipe Osmar Berwanger. "Otimização de um condicionador de ar do tipo split com vazão variável de refrigerante." Universidade do Vale do Rio dos Sinos, 2014. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4619.

Full text

Abstract:

Submitted by Fabricia Fialho Reginato (fabriciar) on 2015-07-23T01:11:46Z No. of bitstreams: 1 FelipeBrochier.pdf: 2248315 bytes, checksum: 51a12fbb2e530bf08f1847557932b381 (MD5)<br>Made available in DSpace on 2015-07-23T01:11:46Z (GMT). No. of bitstreams: 1 FelipeBrochier.pdf: 2248315 bytes, checksum: 51a12fbb2e530bf08f1847557932b381 (MD5) Previous issue date: 2014-02<br>Nenhuma<br>Este trabalho tem como objetivo otimizar o custo operacional dependente dos parâmetros de vazão de ar do condensador, número de aletas e de circuitos do condensador, frequência do compressor e parâmetros do dispo

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Shuting. "Angular effects of surface brightness temperature observed from Sentinel-3A/SLSTR data." Electronic Thesis or Diss., Strasbourg, 2024. http://www.theses.fr/2024STRAD055.

Full text

Abstract:

Ce travail de thèse utilise les données TIR de SLSTR comme source principale pour extraire la température de brillance de la surface (SBT) en appliquant l’algorithme split-window, afin d’analyser l’effet angulaire sur la SBT. En se basant sur une base de données de simulation, une méthode d’extraction de la SBT a été développée et appliquée aux observations à double angle de SLSTR. L’étude a ensuite examiné l’amplitude et les caractéristiques des différences de SBT entre les vues nadir et obliques, en tenant compte de facteurs tels que l’occupation du sol /la couverture terrestre, la saison, l

APA, Harvard, Vancouver, ISO, and other styles

7

Shwayder, Kobey. "The best binary split algorithm a deterministic method for dividing vowel inventories into contrastive distinctive features /." Waltham, Mass. : Brandeis University, 2009. http://dcoll.brandeis.edu/handle/10192/23254.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chen, Yuan. "A Fast, Passive and Accurate Model Generation Algorithm for RLCG Transmission Lines with Skin Effects." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1116250638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Rao, Michaël. "Décompositions de graphes et algorithmes efficaces." Metz, 2006. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/2006/Rao.Michael.SMZ0607.pdf.

Full text

Abstract:

Ce mémoire traite de la décomposition modulaire ainsi que différentes de ses généralisations. Dans un premier temps, on explique comment se servir de décompositions pour résoudre efficacement certains problèmes sur les graphes. En particulier, en utilisant la décomposition modulaire, on obtient des algorithmes linéaires pour les problèmes " ensemble stable ", " clique ", " nombre chromatique " et " partition en cliques " sur les graphes sans P_5 et gem induit. On étudie également comment la décomposition en coupes peut servir pour calculer le nombre chromatique, et on exhibe une nouvelle class

APA, Harvard, Vancouver, ISO, and other styles

10

Frigo, Nadia. "Composite likelihood inference in state space models." Doctoral thesis, Università degli studi di Padova, 2010. http://hdl.handle.net/11577/3426576.

Full text

Abstract:

In general state space models, where the computational effort required in the evaluation of the full likelihood function is infeasible, we analyze the problem of static parameter estimation based on composite likelihood functions, in particular pairwise and split data likelihood functions. We discuss consistency and efficiency properties of these estimators (related to the characteristics of the model) and the bias in stationary models where the invariant distribution is unknown. We focus on numerical methods to compute estimates of the parameter describing a general state space model. We de

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Split algorithm"

1

Institute for Computer Applications in Science and Engineering. and United States. National Aeronautics and Space Administration., eds. Parallel directionally split solver based on reformulation of pipelined Thomas algorithm. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Anderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

1952-, Thomas James L., Whitfield David L, and United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., eds. Three-dimensional multigrid algorithms for the flux-split Euler equations. National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Anderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Anderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. Langley Research Center, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

United States. National Aeronautics and Space Administration., ed. Implicit multigrid algorithms for the three-dimensional flux split Euler equations. National Aeronautics and Space Administration, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

B, Grossman, and United States. National Aeronautics and Space Administration., eds. Calculation of hypersonic shock structure using flux-splut algorithms. Interdiciplinmary Center for Applied Mathematics, Virginia Polytechnic Institute and State University, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

United States. National Aeronautics and Space Administration. and Mississippi State University. Dept. of Aerophysics and Aerospace Engineering., eds. Adaptive grid embedding for the two-dimensional flux-split Euler equations. Mississippi State University, Dept. of Aerospace Engineering, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Implicit multigrid algorithms for the three-dimensional flux split Euler equations. National Aeronautics and Space Administration, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Das, Vinu V., and Passent M. El-Kafrawy. Signal Processing and Information Technology: Second International Joint Conference, SPIT 2012, Dubai, UAE, September 20-21, 2012, Revised Selected Papers. Springer, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Split algorithm"

1

Ounali, Chedi, Fahmi Ben Rejab, and Kaouther Nouira Ferchichi. "Incremental Algorithm Based on Split Technique." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16660-1_55.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ghosh, Esha, Sudeshna Kolay, Mrinal Kumar, et al. "Faster Parameterized Algorithms for Deletion to Split Graphs." In Algorithm Theory – SWAT 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31155-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Manikandan, V., and S. Monikandan. "Algorithm for Reconstruction Number of Split Graphs." In Lecture Notes in Networks and Systems. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-2066-8_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Lijing, Xuanhui He, and Yulan Ren. "Research on the Improved Algorithm of Node Split." In Advances in Intelligent and Soft Computing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25349-2_134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Setzer, Simon. "Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02256-2_39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Qian, Hao. "Implementing Split Iterative Algorithm in Rehabilitation Movement Control Management." In Lecture Notes on Data Engineering and Communications Technologies. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-0211-7_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ochelska-Mierzejewska, Joanna. "Ant Colony Optimization Algorithm for Split Delivery Vehicle Routing Problem." In Advanced Information Networking and Applications. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44041-1_67.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chau, Kwok-wing. "A Split-Step PSO Algorithm in Predicting Construction Litigation Outcome." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-36668-3_163.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Odashima, Shigeyuki, Miwa Ueki, and Naoyuki Sawasaki. "A Split-Merge DP-means Algorithm to Avoid Local Minima." In Machine Learning and Knowledge Discovery in Databases. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46227-1_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Drescher, Matthew, Samuel Fiorini, and Tony Huynh. "A Simple $$(2+\epsilon )$$-Approximation Algorithm for Split Vertex Deletion." In Trends in Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83823-2_48.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Split algorithm"

1

Maurice, Nathan, Julien Sopena, and Lionel Lacassagne. "A New Efficient Split & Merge Algorithm for Embedded Systems." In 2024 IEEE International Conference on Image Processing (ICIP). IEEE, 2024. http://dx.doi.org/10.1109/icip51287.2024.10648097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sun, Yunrui, Gang Hu, Yinglei Teng, and Dunbo Cai. "Split Federated Learning Over Heterogeneous Edge Devices: Algorithm and Optimization." In 2025 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2025. https://doi.org/10.1109/wcnc61545.2025.10978241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zou, Xiao, and Xueliang Wu. "An Association Rule with Split Aggregate Merge Algorithm for Insurance Risk Management." In 2024 International Conference on Distributed Systems, Computer Networks and Cybersecurity (ICDSCNC). IEEE, 2024. https://doi.org/10.1109/icdscnc62492.2024.10939335.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ghosh, Anjan, and Paparao Palacharla. "Efficient optical preprocessing using split-step algorithms." In OSA Annual Meeting. Optica Publishing Group, 1989. http://dx.doi.org/10.1364/oam.1989.tudd2.

Full text

Abstract:

A new and efficient split-step polynomial preconditioning algorithm is discussed. In this algorithm, basic polynomial preconditioning iterations are repeated several times, each time with an improved matrix. With minor modifications this algorithm can be used for matrix inversion and condition number estimation. The split-step algorithms consist of two nested iterative loops involving matrix multiplications and thus are attractive for parallel optical processors. The details of realization of splitstep algorithms on three different optical matrix multiplier architectures are outlined. The cond

APA, Harvard, Vancouver, ISO, and other styles

5

Wu, C. H., and A. E. Yagle. "The gradient adaptive split lattice algorithm." In [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1992. http://dx.doi.org/10.1109/icassp.1992.226447.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Boeva, Veselka, Milena Angelova, and Elena Tsiporkova. "A Split-Merge Evolutionary Clustering Algorithm." In 11th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2019. http://dx.doi.org/10.5220/0007573103370346.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sun, Jian, Hongyu Jia, Bo Hu, et al. "Speeding up Very Fast Decision Tree with Low Computational Cost." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/177.

Full text

Abstract:

Very Fast Decision Tree (VFDT) is one of the most widely used online decision tree induction algorithms, and it provides high classification accuracy with theoretical guarantees. In VFDT, the split-attempt operation is essential for leaf-split. It is computation-intensive since it computes the heuristic measure of all attributes of a leaf. To reduce split-attempts, VFDT tries to split at constant intervals (for example, every 200 examples). However, this mechanism introduces split-delay for split can only happen at fixed intervals, which slows down the growth of VFDT and finally lowers accurac

APA, Harvard, Vancouver, ISO, and other styles

8

Combettes, Patrick L., and Jean-Christophe Pesquet. "Split convex minimization algorithm for signal recovery." In ICASSP 2009 - 2009 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2009. http://dx.doi.org/10.1109/icassp.2009.4959676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhang, Zheyu, Tianping Zhang, and Jian Li. "Unbiased Gradient Boosting Decision Tree with Unbiased Feature Importance." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/515.

Full text

Abstract:

Gradient Boosting Decision Tree (GBDT) has achieved remarkable success in a wide variety of applications. The split finding algorithm, which determines the tree construction process, is one of the most crucial components of GBDT. However, the split finding algorithm has long been criticized for its bias towards features with a large number of potential splits. This bias introduces severe interpretability and overfitting issues in GBDT. To this end, we provide a fine-grained analysis of bias in GBDT and demonstrate that the bias originates from 1) the systematic bias in the gain estimation of e

APA, Harvard, Vancouver, ISO, and other styles

10

Ling, Hangkun. "Emulating Expert Systems and the Location-Identity Split." In 2018 International Conference on Computer Modeling, Simulation and Algorithm (CMSA 2018). Atlantis Press, 2018. http://dx.doi.org/10.2991/cmsa-18.2018.19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Split algorithm"

1

Warren, Russell, Stanley Osher, and Richard Vanderbeek. Multiple Aerosol Unmixing by the Split Bregman Algorithm. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada555738.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Barrios, Amalia E., and Kenneth H. Craig. Rough Surface Models Implemented Within the Split-Step Parabolic Equation Algorithm. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada280843.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ostashev, Vladimir, Michael Muhlestein, and D. Wilson. Extra-wide-angle parabolic equations in motionless and moving media. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42043.

Full text

Abstract:

Wide-angle parabolic equations (WAPEs) play an important role in physics. They are derived by an expansion of a square-root pseudo-differential operator in one-way wave equations, and then solved by finite-difference techniques. In the present paper, a different approach is suggested. The starting point is an extra-wide-angle parabolic equation (EWAPE) valid for small variations of the refractive index of a medium. This equation is written in an integral form, solved by a perturbation technique, and transformed to the spectral domain. The resulting split-step spectral algorithm for the EWAPE a

APA, Harvard, Vancouver, ISO, and other styles

4

Zhao, George, Grang Mei, Bulent Ayhan, Chiman Kwan, and Venu Varma. DTRS57-04-C-10053 Wave Electromagnetic Acoustic Transducer for ILI of Pipelines. Pipeline Research Council International, Inc. (PRCI), 2005. http://dx.doi.org/10.55274/r0012049.

Full text

Abstract:

In this project, Intelligent Automation, Incorporated (IAI) and Oak Ridge National Lab (ORNL) propose a novel and integrated approach to inspect the mechanical dents and metal loss in pipelines. It combines the state-of-the-art SH wave Electromagnetic Acoustic Transducer (EMAT) technique, through detailed numerical modeling, data collection instrumentation, and advanced signal processing and pattern classifications, to detect and characterize mechanical defects in the underground pipeline transportation infrastructures. The technique has four components: (1) thorough guided wave modal analysis

APA, Harvard, Vancouver, ISO, and other styles

5

Szymczak, William G. Viscous Split Algorithms for the Time Dependent Incompressible Navier Stokes Equations. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada211592.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!