Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Kehong Wu"'
Publikováno v:
IEEE Access, Vol 7, Pp 91518-91534 (2019)
Many association rule mining algorithms have been well-established, such as Apriori, Eclat, FP-Growth, or LCM algorithms. However, the challenge is that the huge size of association rules is extracted by using these algorithms, and it is difficult fo
Externí odkaz:
https://doaj.org/article/d613267b9f33476dae2b1c71ba9ca5c7
Publikováno v:
IEEE Transactions on Smart Grid. 14:965-978
Publikováno v:
NODYCON Conference Proceedings Series ISBN: 9783030811693
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b57dc243c25fa1373db274f7f7afa920
https://doi.org/10.1007/978-3-030-81170-9_22
https://doi.org/10.1007/978-3-030-81170-9_22
Publikováno v:
IEEE Access, Vol 7, Pp 91518-91534 (2019)
Many association rule mining algorithms have been well-established, such as Apriori, Eclat, FP-Growth, or LCM algorithms. However, the challenge is that the huge size of association rules is extracted by using these algorithms, and it is difficult fo
Publikováno v:
2011 International Conference on Remote Sensing, Environment and Transportation Engineering.
The polygon orientation identification and point-in-polygon query algorithm for GIS polygon is in the course of improvement. Robust algorithms are presented in this paper. By comparing the serial number of polygon's four (or three, two) extreme point
Publikováno v:
Geoinformatics
The point-in-polygon test which query about whether a point lies within a polygon or not is a fundamental problem in geometry, and of importance in various applications in GIS (Geographic Information System) and other areas. In taking advantage of th
Publikováno v:
2011 International Conference on Remote Sensing, Environment & Transportation Engineering (RSETE); 2011, p2756-2760, 5p
Publikováno v:
2010 18th International Conference on Geoinformatics; 2010, p1-4, 4p