Results 1  10
of
1,044,802
Candidate Set Strategies for Ant Colony
"... Abstract. Ant Colony Optimisation based solvers systematically scan the set of possible solution elements before choosing a particular one. Hence, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sens ..."
Abstract
 Add to MetaCart
sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests these on the travelling salesman and car sequencing problems. The results show that the use of candidate sets helps to find competitive solutions to the test problems in a relatively short amount
Mining Frequent Patterns without Candidate Generation: A FrequentPattern Tree Approach
 DATA MINING AND KNOWLEDGE DISCOVERY
, 2004
"... Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriorilike candidate set generationandtest approach. However, candidate set generation is still co ..."
Abstract

Cited by 1700 (64 self)
 Add to MetaCart
Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriorilike candidate set generationandtest approach. However, candidate set generation is still
Candidate Sets for Complex Interval Arithmetic
, 1999
"... Uncertainty of measuring complexvalued physical quantities can be described by complex sets. These sets can have complicated shapes, so we would like to find a good approximating family of sets. Which approximating family is the best? We reduce the corresponding optimization problem to a geometric ..."
Abstract
 Add to MetaCart
is consistent with the fact that such sets have indeed been successful in computations. It stimulates to study further candidates. Construction of Optimal Families A practical problem leading to complex sets. Many physical quantities are complexvalued: wave function in quantum mechanics, complex amplitude
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 526 (72 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
Candidate Set Strategies for Ant Colony Optimisation ∗
, 2008
"... Ant Colony Optimisation is a maturing class of metaheuristic search algorithms for discrete optimisation problems that are being increasingly applied to real world problems in areas such as communications and transportation. As these techniques systematically scan the set of possible solution eleme ..."
Abstract
 Add to MetaCart
elements before choosing a particular one, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests
Computational Optimality Theory with finite candidate sets∗
"... • CCamelOT is an opensource webbased program that takes an input and a constraint ranking, and finds the output using OTCC. • OTCC (“OT with Candidate Chains”,?) is a theory of phonology with finite candidate sets, so CCamelOT can produce complete candidate sets and find the outputs in them. • ..."
Abstract
 Add to MetaCart
• CCamelOT is an opensource webbased program that takes an input and a constraint ranking, and finds the output using OTCC. • OTCC (“OT with Candidate Chains”,?) is a theory of phonology with finite candidate sets, so CCamelOT can produce complete candidate sets and find the outputs in them
Mining Association Rules between Sets of Items in Large Databases
 IN: PROCEEDINGS OF THE 1993 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, WASHINGTON DC (USA
, 1993
"... We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel esti ..."
Abstract

Cited by 3260 (17 self)
 Add to MetaCart
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.
Computational Optimality Theory with finite candidate sets∗
, 2006
"... • CCamelOT is an opensource webbased program that takes an input and a constraint ranking, and finds the output using OTCC. • OTCC (“OT with Candidate Chains”, McCarthy 2006) is a theory of phonology with finite candidate sets, so CCamelOT can produce complete candidate sets and find the output ..."
Abstract
 Add to MetaCart
• CCamelOT is an opensource webbased program that takes an input and a constraint ranking, and finds the output using OTCC. • OTCC (“OT with Candidate Chains”, McCarthy 2006) is a theory of phonology with finite candidate sets, so CCamelOT can produce complete candidate sets and find
An Empirical Model of Candidate Set Generation in Information Retrieval
"... Abstract: String Transformation is still an important research issue in the field of natural language processingand search engine optimization, Even though various traditional approaches available for string transformation they are not optimal because of Accuracy and efficiency are the basic paramet ..."
Abstract
 Add to MetaCart
parameters to optimize. While generation of the output Strings, Initially we consider the set of similar keywords. In this paper we are proposing an efficient approach of String transformation with Candidate generation and Selection and Query Reformulation, for the generation of the candidate sets we
Coarsetofine nbest parsing and MaxEnt discriminative reranking
 In ACL
, 2005
"... Discriminative reranking is one method for constructing highperformance statistical parsers (Collins, 2000). A discriminative reranker requires a source of candidate parses for each sentence. This paper describes a simple yet novel method for constructing sets of 50best parses based on a co ..."
Abstract

Cited by 509 (14 self)
 Add to MetaCart
Discriminative reranking is one method for constructing highperformance statistical parsers (Collins, 2000). A discriminative reranker requires a source of candidate parses for each sentence. This paper describes a simple yet novel method for constructing sets of 50best parses based on a
Results 1  10
of
1,044,802