2018
DOI: 10.12783/dtcse/wcne2017/19880
|View full text |Cite
|
Sign up to set email alerts
|

Intelligent Selection Recommendation Algorithm in the "Double" Mechanism

Abstract: Abstract. Aiming at the phenomenon of blind selection during the course selection of college students under the credit system, the paper puts forward the most preferred course selection recommendation algorithm and the recommended course selection algorithm based on comprehensive evaluation of curriculum. The most preferred course selection recommendation algorithm uses 0-1 integer programming model to give the minimal courses and the maximum credits; the comprehensive evaluation of curriculum based on conside… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…The Head is divided into three or four detection heads depending on the configuration file, responsible for final classification and regression on different-sized feature maps. It outputs classification information, background/foreground judgments, and coordinate information [16][17][18].…”
Section: Object Detection Methods Based On Yolov7mentioning
confidence: 99%
“…The Head is divided into three or four detection heads depending on the configuration file, responsible for final classification and regression on different-sized feature maps. It outputs classification information, background/foreground judgments, and coordinate information [16][17][18].…”
Section: Object Detection Methods Based On Yolov7mentioning
confidence: 99%
“…The self-attentive mechanism differs from the general attention mechanism in that the Query, Key and Value come from the same data source, and the purpose is to obtain the connection between the data of the data sources. The self-attention mechanism can be formalized as Equation (2).…”
Section: π΄π‘‘π‘‘π‘’π‘›π‘‘π‘–π‘œπ‘› 𝑄 𝐾 𝑉mentioning
confidence: 99%
“…Knowledge Graph (KG) contains a large amount of auxiliary information and can provide an effective way to organize and manage a large amount of information. Introducing Knowledge Graph in recommendation algorithms can help to explore deeper potential connections between users and items and enhance the recommendation results [2].…”
Section: Introductionmentioning
confidence: 99%