January 2001
·
118,216 Reads
·
16,377 Citations
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
January 2001
·
118,216 Reads
·
16,377 Citations
January 2001
·
404 Reads
·
3,399 Citations
December 1988
·
18 Reads
·
37 Citations
Communications of the ACM
A new system architecture is described that shares certain characteristics with database systems, expert systems, functional programming languages, and spreadsheet systems, but is very different from any of these. It is based on a uniform use of side-effect-free functions that represent facts and knowledge in a nonprocedural programming system. Database objects are represented by arbitrary extensional functions, i.e., tables, while domain knowledge is represented by side-effect-free intensional functions composed from a suitable library. Both default and inexact information are accommodated by treating values of database objects as random variables with associated probability distributions. The uniformity that results from functional representations leads to a corresponding uniformity in database and knowledge-base operations.
October 1987
·
26 Reads
·
27 Citations
IEEE Expert
January 1986
·
19 Reads
·
31 Citations
AI Magazine
July 1985
·
10 Reads
·
11 Citations
Artificial Intelligence
December 1981
·
7 Reads
·
7 Citations
The general problem of drawing inferences from uncertain or incomplete evidence has invited a variety of technical approaches, some mathematically rigorous and some largely informal and intuitive. Most current inference systems in artificial intelligence have emphasized intuitive methods, because the absence of adequate statistical samples forces a reliance on the subjective judgment of human experts. We describe in this paper a subjective Bayesian inference method that realizes some of the advantages of both formal and informal approaches. Of particular interest are the modifications needed to deal with the inconsistencies usually found in collections of subjective statements.
December 1978
·
6 Reads
·
10 Citations
June 1977
·
54 Reads
·
97 Citations
ACM SIGART Bulletin
Rule-based inference systems allow judgmental knowledge about a specific problem domain to be represented as a collection of discrete rules. Each rule states that if certain premises are known, then certain conclusions can be inferred. An important design issue concerns the representational form for the premises and conclusions of the rules. We describe a rule-based system that uses a partitioned semantic network representation for the premises and conclusions.
January 1976
·
44 Reads
·
584 Citations
The general problem of drawing inferences from uncertain or incomplete evidence has invited a variety of technical approaches, some mathematically rigorous and some largely informal and intuitive. Most current inference systems in artificial intelligence have emphasized intuitive methods, because the absence of adequate statistical samples forces a reliance on the subjective judgment of human experts. We describe in this paper a subjective Bayesian inference method that realizes some of the advantages of both formal and informal approaches. Of particular interest are the modifications needed to deal with the inconsistencies usually found in collections of subjective statements.
... k-Nearest Neighbors (k-NN) Regressor: k-NN Regressor predicts continuous values by averaging the output of the k-nearest neighbors in the feature space, offering simplicity and flexibility while requiring proper distance metric selection (Duda et al. 2000). The hyperparameters include 'n_neighbors', the number of neighbors considered (1-20), 'weights', defining neighbor contribution (uniform or distance), 'algorithm', selecting the method for finding closest points (auto, ball_tree, kd_tree, or brute), and 'leaf_size', impacting tree-based search speed (typically 10-50). ...
January 2001
... Unfortunately, this particular statement, which is similar to others we have encountered elsewhere, has no factual basis. [19] Dendral's team even suggested that the lack of feedback they got from users was an indication of successful use (rather than -as most producers of programs would realise -a lack of use of the program) by writing: ...
July 1985
Artificial Intelligence
... Risk classi…cation, cancer detection, object detection, outlier detection, image classi…cation are some applied areas in classi…cation methods. Over the last decade, many statistical methods have been applied including linear regression, logistic regression (LR), neural networks (NNet), Naive Bayes (NB), k-nearest neighbor (kNN), Support Vector Machine (SVM), boosting methods and other approaches [1,2]. The methods are usually based on optimization problems comprised loss functions. ...
Reference:
A CORRECTION ON TANGENTBOOST ALGORITHM
... with m the sample size and A = K + σ 2 y I. Once D and θ are known we can restrict the joint distribution in equation (6) to only describe functions which accommodate the observations in D, inducing the PPD. This is done by conditioning on this joint distribution using D, θ and the input locations of unknown function values X * , ...
January 1970
... This search is then repeated with the found pixel, forming a chain of pixels until the contour is complete. An example of this is the algorithm described by Duda et al. in Reference [13]. The algorithm starts by tracing each pixel of the image, for example, column-by-column from the bottom row to the top row, until a black pixel is encountered. ...
Reference:
Particle Swarm Contour Search Algorithm
June 1967
... A deeper understanding of technology also positively influences the perceived ease of use [37] and affects attitudes toward it [38,39]. AI is often associated with negative attitudes, e.g., related to employee displacement [40,41]. However, Bruckermann et al. [42] showed that acquiring specific knowledge in the context of citizen science projects promotes positive attitudes toward this research. ...
January 1971
... These techniques are the simplest form of artificial intelligence and mimic the reasoning of a human expert in solving a knowledge-intensive problem. In other words, AI-RBSs encode human expert knowledge about a specific topic into an automated system; they are often used to comprise an expert system [43,44]. An AI-RBS reproduces deductive reasoning mechanisms by employing logic rules made of conjunctions of conditions to verify a set of actions to execute [45]. ...
June 1977
ACM SIGART Bulletin
... In Ref. 12. all the character recognition information is processed bottom~up. ...
January 1968
... This condition ensures that for some ✓ 2 R d , the dataset can be perfectly classified. The quantity µ is a margin (Novikoff 1962;Duda, Hart, and G.Stork 2001), which characterizes the distance between the two classes. This assumption is practical in modern machine learning problems (Soudry et al. 2018;Ji and Telgarsky 2018). ...
January 2001
... In the 1980s, the focus shifted to expert systems, AI programs that used knowledge bases to mimic human expertise in specific domains. 12 Additionally, neural networks gained popularity as a model for machine learning. 13 ...
January 1976