Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Heuristics01:21

Heuristics

83
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
83
Ogive Graph01:07

Ogive Graph

5.6K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
5.6K
The Representativeness Heuristic02:13

The Representativeness Heuristic

15.8K
The representative heuristic describes a biased way of thinking, in which you unintentionally stereotype someone or something. For example, you may assume that your professors spend their free time reading books and engaging in intellectual conversation, because the idea of them spending their time playing volleyball or visiting an amusement park does not fit in with your stereotypes of professors.
15.8K
Collisions in Multiple Dimensions: Problem Solving01:06

Collisions in Multiple Dimensions: Problem Solving

3.7K
In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
3.7K
Bar Graph01:07

Bar Graph

16.1K
A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
16.1K
Time-Series Graph00:54

Time-Series Graph

4.3K
A time-series graph is a line graph with repeated measurements taken at successive intervals of time. It is also called a time series chart. To construct a time-series graph, one must look at both pieces of a paired data set. The horizontal axis is used to plot the time increments, and the vertical axis is used to plot the values of the variable that one is measuring. By using the axes in this way, each point on the graph will correspond to time and a measured quantity. The points on the graph...
4.3K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Interferon-λ drives renal fibrosis by coordinating epithelial-fibroblast crosstalk.

The Journal of experimental medicine·2026
Same author

Unilateral Biportal Endoscopic Discectomy vs Percutaneous Interlaminar Endoscopic Discectomy for L5 to S1 Disc Herniation: A Prospective Comparative Study With Quasirandom Allocation.

International journal of spine surgery·2026
Same author

Protocol: Comparative efficacy of 2 mL vs. 5 mL 0.375% ropivacaine in subparaneural upper trunk brachial plexus block for postoperative analgesia after arthroscopic shoulder surgery-a randomized noninferiority trial.

Frontiers in medicine·2026
Same author

Synergy and interface: design of MXene/LDH composites and their electrochemical energy storage applications.

Physical chemistry chemical physics : PCCP·2026
Same author

A pH-responsive layered double hydroxide nanoradiosensitizer for bone metastasis tumor.

Materials today. Bio·2026
Same author

The Optimal Effective Concentration of Spinal Anesthesia for Interlaminar Endoscopic Lumbar Discectomy: An Approach Based on the Biased Coin Design.

Drug design, development and therapy·2026

Related Experiment Video

Updated: Jun 16, 2025

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports
07:35

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

Published on: October 13, 2023

1.6K

A knowledge graph algorithm enabled deep recommendation system.

Yan Wang1, Xiao Feng Ma2, Miao Zhu1

  • 1Teaching Affairs Office, Capital Medical University, Beijing, China.

Peerj. Computer Science
|August 15, 2024
PubMed
Summary
This summary is machine-generated.

A new deep recommendation system algorithm (D-KGR) enhances personalized online learning by overcoming low accuracy and efficiency issues. This knowledge graph-based approach offers superior performance for large user and resource datasets.

Keywords:
Data miningDeep learningKnowledge graphsRecommendation systems

More Related Videos

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
03:14

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Published on: December 6, 2024

527
Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
09:47

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

Published on: December 15, 2023

998

Related Experiment Videos

Last Updated: Jun 16, 2025

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports
07:35

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

Published on: October 13, 2023

1.6K
Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
03:14

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Published on: December 6, 2024

527
Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
09:47

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

Published on: December 15, 2023

998

Area of Science:

  • Educational Technology
  • Computer Science
  • Artificial Intelligence

Background:

  • Online education faces challenges like learning mazes and information overload.
  • Existing personalized learning resource recommendation algorithms suffer from low accuracy and efficiency.
  • There is a need for advanced algorithms to improve personalized recommendations in online learning environments.

Purpose of the Study:

  • To propose a novel deep recommendation system algorithm based on a knowledge graph (D-KGR) to address the limitations of current personalized learning resource recommendation systems.
  • To enhance the accuracy and efficiency of personalized learning resource recommendations in online education.
  • To integrate knowledge graph, deep learning, neural network, and data mining technologies for improved recommendation performance.

Main Methods:

  • Developed a deep recommendation system algorithm (D-KGR) with four units: recommendation (RS), knowledge graph embedding (KGE), cross-compression (CC), and feature extraction (FE).
  • Integrated multimodal technology and a convolutional neural network (CNN) to optimize knowledge graph reconstruction and process diverse attribute types.
  • Introduced cross-compression in knowledge graph feature learning for user attribute prediction.

Main Results:

  • The D-KGR algorithm demonstrated significant advantages in efficiency and accuracy, especially with over 1,000 learning resources and users.
  • The algorithm effectively integrates particle swarm optimization, neural network simulation, and low resource consumption.
  • It processes massive data rapidly, reduces algorithm complexity, and lowers time and cost requirements.

Conclusions:

  • The proposed D-KGR algorithm offers a superior solution for personalized learning resource recommendations in large-scale online education settings.
  • The integration of knowledge graphs and deep learning significantly improves recommendation system performance.
  • D-KGR provides a more efficient, accurate, and cost-effective approach to personalized online learning.