A Web Data Mining Algorithm Based on Manifold Distance for Mixed Data in Cloud Service Architecture

Due to the complex distribution of web data and frequent updates under the cloud service architecture, the existing methods for global consistency of data ignore the global consistency of distance measurement and the inability to obtain neighborhood information of data. To overcome these problems, w...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of cognitive informatics & natural intelligence Ročník 18; číslo 1; s. 1 - 7
Hlavní autoři: Wang, Hui, Cai, Tie, Cheng, Dongsheng, Li, Kangshun, Lin, Guangming, Wu, Zhijian
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hershey IGI Global 01.01.2024
Témata:
Algorithms
Cloud computing
Computer architecture
Consistency
Constraints
Data mining
Distance measurement
Informatics
Information technology
Machine learning
Manifolds (mathematics)
Multiple objective analysis
Neighborhoods
Optimization algorithms
Optimization models
Pareto optimization
ISSN:1557-3958, 1557-3966
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Due to the complex distribution of web data and frequent updates under the cloud service architecture, the existing methods for global consistency of data ignore the global consistency of distance measurement and the inability to obtain neighborhood information of data. To overcome these problems, we transform the multi-information goal and multi-user demand (constraint conditions) in web data mining into a constrained multi-objective optimization model and solve it by a constrained particle swarm multi-objective optimization algorithm. While we measure the distance between data by manifold distance. In order to make it easier for the constrained multi-objective particle swarm algorithm to solve different types of problems to find an effective solution set closer to the real Pareto front, a new manifold learning algorithm based on the constrained multi-objective particle swarm algorithm is built and used to solve this problem. Experiments results demonstrate that this can improve the service efficiency of cloud computing.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1557-3958
1557-3966
DOI:10.4018/IJCINI.344021