2015
DOI: 10.1007/s11721-015-0116-8
|View full text |Cite
|
Sign up to set email alerts
|

An ant colony-based semi-supervised approach for learning classification rules

Abstract: The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(12 citation statements)
references
References 27 publications
0
12
0
Order By: Relevance
“…(1) and No. (24) tour routes. The two routes' generation tree weight function value L(•) is the minimum value, and thus it relates to the maximum sub-unit motive function I(•) iteration value, that is, the tourist can get the best motive benefits from the two optimal routes.…”
Section: Optimal Tour Route Searching Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…(1) and No. (24) tour routes. The two routes' generation tree weight function value L(•) is the minimum value, and thus it relates to the maximum sub-unit motive function I(•) iteration value, that is, the tourist can get the best motive benefits from the two optimal routes.…”
Section: Optimal Tour Route Searching Resultsmentioning
confidence: 99%
“…While considering that the trip in the whole tour route will be influenced by factors, like geographic information services, traffic information services, physical qualifications, tourist site attraction indexes, etc., a tour route planning algorithm should combine with these factors, as they are indispensable objective conditions in the trip process, and they conform to the tour reality [24][25][26]. The tour routes output by the smart machine have the following features: (1) all tourist site classifications and specific tourist sites conform to the tourist's needs and interests; (2) all tourist sites are nearest to temporary accommodation, which demands the lowest expenditure; (3) temporary accommodations are the both starting point and terminal point of the whole trip, which conforms to the schedule; (4) the algorithm combines with factors that influence the motive benefits of the trip, which conforms to the tour reality; and, (5) the smart machine not only outputs optimal tour routes, but also outputs sub-optimal ones, guide maps, and decision supports.…”
Section: Introductionmentioning
confidence: 99%
“…The pheromone model and the probability model are the core of this algorithm [31]. ACO algorithms have been widely used for pattern classification [32], cloud computing [33], network coding [34], robot path planning [35] and in other fields. We propose some optimizations to improve the ACO algorithm for the study of the virtual globe platform and penetration route planning.…”
Section: Route Planning Methodsmentioning
confidence: 99%
“…5. 4 The joint angle values of the particles are updated according to the speed (eq. 5) and position equation (eq.…”
Section: The Particle (P) Loop Is Startedmentioning
confidence: 99%