Sciweavers

5733 search results - page 1064 / 1147
» Clustering Categorical Data
Sort
View
169
Voted
ICML
1994
IEEE
15 years 9 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
15 years 9 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...
AAAI
2008
15 years 8 months ago
Hybrid Markov Logic Networks
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
Jue Wang, Pedro Domingos
CIKM
2008
Springer
15 years 8 months ago
Metric-based ontology learning
Ontology learning is an important task in Artificial Intelligence, Semantic Web and Text Mining. This paper presents a novel framework for, and solutions to, three practical probl...
Hui Yang, Jamie Callan
CCGRID
2005
IEEE
15 years 8 months ago
The Composite Endpoint Protocol (CEP): scalable endpoints for terabit flows
We introduce the Composite Endpoint Protocol (CEP) which efficiently composes a set of transmission elements to support high speed flows which exceed the capabilities of a single...
Eric Weigle, Andrew A. Chien
« Prev « First page 1064 / 1147 Last » Next »