default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmand Prieditis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i1]Michele Bennett, Mehdi Nekouei, Armand Prieditis, Rajesh Mehta, Ewa J. Kleczyk, Karin Hayes:
Methodology to Create Analysis-Naive Holdout Records as well as Train and Test Records for Machine Learning Analyses in Healthcare. CoRR abs/2205.03987 (2022)
2010 – 2019
- 2013
- [c9]Armand Prieditis, Gang Chen:
Mapping the Internet: Geolocating Routers by Using Machine Learning. COM.Geo 2013: 101-105 - [c8]Stephanie Sapp, Armand Prieditis:
Accuracy-Based Classification EM: Combining Clustering with Prediction. MLDM 2013: 458-465 - [c7]Armand Prieditis, Moontae Lee:
When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency. MLDM 2013: 466-480 - [c6]Armand Prieditis, Stephanie Sapp:
Lazy Overfitting Control. MLDM 2013: 481-491
1990 – 1999
- 1999
- [j7]Robert Davis, Armand Prieditis:
Designing Optimal Sequential Experiments for a Bayesian Classifier. IEEE Trans. Pattern Anal. Mach. Intell. 21(3): 193-201 (1999) - 1998
- [j6]Armand Prieditis:
Depth-First Branch-and-Bound vs. Depth-Bounded IDA*. Comput. Intell. 14(2): 188-206 (1998) - [j5]Armand Prieditis, Evan Fletcher:
Two-agent IDA*. J. Exp. Theor. Artif. Intell. 10(4): 451-485 (1998) - 1997
- [j4]Armand Prieditis:
Adding upper-bound pruning to IDA*. J. Exp. Theor. Artif. Intell. 9(1): 67-81 (1997) - 1995
- [j3]Armand Prieditis, Robert Davis:
Quantitatively Relating Abstractness to the Accuracy of Admissible Heuristics. Artif. Intell. 74(1): 165-175 (1995) - [e1]Armand Prieditis, Stuart Russell:
Machine Learning, Proceedings of the Twelfth International Conference on Machine Learning, Tahoe City, California, USA, July 9-12, 1995. Morgan Kaufmann 1995, ISBN 1-55860-377-8 [contents] - 1993
- [j2]Robert Davis, Armand Prieditis:
The Expected Length of a Shortest Path. Inf. Process. Lett. 46(3): 135-141 (1993) - [j1]Armand Prieditis:
Machine Discovery of Effective Admissible Heuristics. Mach. Learn. 12: 117-141 (1993) - [c5]Armand Prieditis, Bhaskar Janakiraman:
Generating Effective Admissible Heuristics by Abstraction and Reconstitution. AAAI 1993: 743-748 - 1991
- [c4]Armand Prieditis:
Machine Discovery of Effective Admissible Heuristics. IJCAI 1991: 720-725
1980 – 1989
- 1989
- [c3]Jack Mostow, Armand Prieditis:
Discovering Admissible Search Heuristics by Abstracting and Optimizing. ML 1989: 240-240 - [c2]Jack Mostow, Armand Prieditis:
Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach. IJCAI 1989: 701-707 - 1987
- [c1]Armand Prieditis, Jack Mostow:
PROLEARN: Towards a Prolog Interpreter that Learns. AAAI 1987: 494-498
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
