CN113254739A - Topic facet tree visualization method based on first-order curve - Google Patents

Topic facet tree visualization method based on first-order curve Download PDF

Info

Publication number
CN113254739A
CN113254739A CN202110464783.9A CN202110464783A CN113254739A CN 113254739 A CN113254739 A CN 113254739A CN 202110464783 A CN202110464783 A CN 202110464783A CN 113254739 A CN113254739 A CN 113254739A
Authority
CN
China
Prior art keywords
facet
tree
offset
branch
facets
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110464783.9A
Other languages
Chinese (zh)
Other versions
CN113254739B (en
Inventor
魏笔凡
郝子琛
刘均
郑庆华
张玲玲
郑玉龙
关海山
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN202110464783.9A priority Critical patent/CN113254739B/en
Publication of CN113254739A publication Critical patent/CN113254739A/en
Application granted granted Critical
Publication of CN113254739B publication Critical patent/CN113254739B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/904—Browsing; Visualisation therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/906—Clustering; Classification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0481—Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
    • G06F3/0483—Interaction with page-structured environments, e.g. book metaphor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/20—Education
    • G06Q50/205—Education administration or guidance

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Educational Administration (AREA)
  • Educational Technology (AREA)
  • Data Mining & Analysis (AREA)
  • Tourism & Hospitality (AREA)
  • General Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • General Business, Economics & Management (AREA)
  • Human Computer Interaction (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a theme facet tree visualization method based on a first-order curve, which belongs to the field of visual courses, wherein theme facet tree data are visualized as required, and a theme facet tree trunk is drawn; then drawing first-level facets on two sides of the trunk of the subject facet tree; when the number of the secondary facets is more than 9, 8 secondary facets are selected, and the rest secondary facets are folded by 'other'; when the number of the secondary facets is less than 9, folding is not needed; the second-level facet establishes the second-level branch by calculating the height of the font size of the adjacent second-level branch and the tangent value of the offset thereof as the minimum offset angle, thereby avoiding the phenomenon of font overlapping, ensuring that the learner can quickly integrate the theme resources and simultaneously relieving the problem of cognitive load of the learner caused by the facet overlapping phenomenon. And the phenomenon of tight font aggregation is avoided by calculating the offset of the fonts and the starting node, so that the phenomenon of distraction of the learner due to tight font aggregation is reduced, and the learning efficiency of the learner is improved. Through the steps, the visual result of the subject facet tree is ensured to be closer to the botanical tree, the requirement of a learner for quickly integrating the subject learning resources is met, and the learning efficiency of the learner is improved.

Description

Topic facet tree visualization method based on first-order curve
Technical Field
The invention belongs to the field of visual courses, and particularly relates to a theme facet tree visualization method based on first-order curves.
Background
With the development of the internet, the popularization of mobile intelligent terminals, group interaction and large-scale resource sharing under the big data background, online learning systems and data are increased rapidly, and meanwhile, the problem of knowledge fragmentation is brought. The knowledge forest is proposed as a brand-new fragmented knowledge aggregation mode, and fragmented knowledge aggregation is mainly carried out through three steps of topic facet tree generation, fragmented knowledge assembly and cognitive relationship mining. After the aggregation is completed, related visualization design needs to be performed on the data sets therein. At present, the main method is that the curriculum theme and facets are visualized through elastic layers, and the method is that when the number of facets corresponding to the theme exceeds 7, the rest facets are folded through calculation, so that the overlapping problem is solved, and the interaction experience of a user is improved; the folded facets cannot show the secondary facets, and the drawn subject facet tree is not similar to a tree in appearance and is not in line with the subject facet tree in the subject.
Tanja Munz et al draw a tree-type structure through an elliptical layout and a Pythagorean tree drawing idea, and when the Pythagorean tree is less than 5 layers, the structure is not displayed like a tree, the used scene is limited in hierarchical data with the layer number more than 5, the limitation is large, and the layer number in the data of a knowledge forest is less than three layers, so that the visualization method is not suitable for the knowledge forest.
The Monnwei et al visually designs the topic facet tree through the cubic Bessel curve, and statistics show that the second-level facet overlapping rate is as high as 14.7% in the visual result, and the experience and efficiency of learners are seriously affected by the facet overlapping, so that how to solve the problem of the visual overlapping rate of the hierarchical structure data of the topic facet tree needs to further optimize the method of the topic facet tree.
Disclosure of Invention
The invention aims to provide a topic facet tree visualization method based on a first-order curve so as to overcome the defects of the prior art.
In order to achieve the purpose, the invention adopts the following technical scheme:
a topic facet tree visualization method based on first-order curves comprises the following steps:
s1, visualizing the data of the theme facet tree according to the needs and drawing a main trunk of the theme facet tree;
s2, drawing first-level facets on two sides of the main trunk of the subject facet tree;
s3, when the number of the secondary facets is larger than 9, 8 secondary facets with the largest fragment knowledge number are selected for display, and the rest secondary facets are folded by 'other'; when the number of the secondary facets is less than 9, folding is not needed; the second-level facet establishes a second-level branch by calculating the height of the font size of the adjacent second-level branch and the tangent value of the offset thereof as a minimum offset angle and taking the branch tail end of the first-level facet as a starting point, thereby realizing the visualization of the theme facet tree.
Furthermore, the first-level facet uses a first-order curve to represent the branch, the font is arranged along the direction of the branch of the first-level facet, and the facet name is arranged along the direction of the branch.
Furthermore, the main trunk of the subject facet tree is drawn according to the size of a screen based on a front-end svg method, the height of the main trunk is marked as trunkhight, and the main trunk becomes thinner from bottom to top in sequence.
Furthermore, after the starting nodes of all the first-level facets in the trunk of the subject facet tree are calculated, all the first-level facets draw branches in sequence from two sides of each starting node, and the offset angle between each branch and the horizontal plane is a fixed angle.
Further, the minimum deviation angle of the facet is obtained by a tangent function,
Figure BDA0003043307370000031
where textHeight represents the height of the font, dxi-1Indicating the amount of facet offset from the last rendering.
Further, the offset angle range is
Figure BDA0003043307370000032
Wherein alpha isiFor the minimum offset angle calculated by the above formula,
Figure BDA0003043307370000033
denotes the maximum offset angle, and second BranchNums denotes the number of second-order branches belonging to the first-order facet.
Further, the offset angle θiIs taken as
Figure BDA0003043307370000034
The phenomenon of tight font and font aggregation needs to be considered, and the phenomenon will aggravate the phenomenon of distraction of learners. At this time dxiThe value of (c) is as shown in the following equation 5-1, textLeniThe font length representing the current branch name. When the offset of the adjacent branch is less than or equal to the product of the font length of the current branch and the cosine value of the offset angle, the offset of the current branch subtracts the current font length from the offset of the adjacent branch multiplied by the secant value of the current offset angle; otherwise, firstly calculating the offset of the adjacent branch and the sum of the font lengths of the adjacent branches, and then multiplying the obtained sum by the secant value of the current offset angle;
Figure BDA0003043307370000035
further, when the angle theta is deviatediIs taken as
Figure BDA0003043307370000036
And the phenomenon that the fonts are tightly gathered is not considered. The value range of the offset dxi is: [0, branchLen-textLeni]BranchLen denotes the default length of the branch, textLeniIndicating the length of the font.
Further, when the number of secondary facets is greater than 9, the number of fragments of each secondary facet is counted, the first eight with the largest number are reserved as branches, and the rest of the passes are folded by 'other'.
Compared with the prior art, the invention has the following beneficial technical effects:
the invention relates to a visualization method of a theme facet tree based on a first-order curve, which comprises the steps of firstly drawing a main trunk of the theme facet tree according to theme facet tree data needing visualization; then drawing first-level facets on two sides of the trunk of the subject facet tree; when the number of the secondary facets is larger than 9, counting the number of fragments of each secondary facet, keeping the first eight with the largest fragment knowledge number as the display of the normal branch, and folding the rest by using other. When the number of the secondary facets is less than 9, folding is not needed; the second-level facet establishes the second-level branch by calculating the height of the font size of the adjacent second-level branch and the tangent value of the offset thereof as the minimum offset angle and taking the tail end of the first-level branch as the starting point, thereby realizing the visualization of the theme facet tree. The visual result of the theme facet tree is more close to the botanical tree through the steps, and the requirement of a subject group is met. Meanwhile, the learner can more quickly know the facet structure of the whole theme, and the probability of facet overlapping in the theme facet tree is greatly reduced. The method ensures that the learner can quickly integrate the theme resources and simultaneously relieves the problem of cognitive load of the learner caused by the facet overlapping phenomenon.
Furthermore, the phenomenon that the fonts and the fonts of adjacent branches are tightly gathered is avoided by calculating the offset of the fonts and the branch starting point, the step can reduce the phenomenon of distraction of learners due to tight font gathering, and the learning efficiency of learners is improved.
Drawings
FIG. 1 is a flow chart of a method embodied in an embodiment of the present invention.
FIG. 2 is a diagram illustrating a trunk structure of a subject facet tree according to an embodiment of the present disclosure.
Fig. 3 is a schematic diagram of a first-level facet drawing result in the embodiment of the present invention.
FIG. 4 is a diagram illustrating the results of the two-step facet rendering of the simple method deflection angle in the embodiment of the present invention.
Fig. 5 is a schematic diagram of a minimum offset angle of the second-level facet rendering according to the embodiment of the present invention.
Fig. 6 is a schematic diagram illustrating an offset structure of a current branch when an offset of an adjacent branch is less than or equal to a product of a font length of the current branch and a cosine value of an offset angle in the embodiment of the present invention.
Fig. 7 is a schematic diagram illustrating an offset structure of a current branch when an offset of an adjacent branch is greater than a product of a font length of the current branch and a cosine value of an offset angle in the embodiment of the present invention.
Fig. 8 is a final visualization result in an embodiment of the invention.
FIG. 9 is a schematic view of a facet structure according to an embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to the accompanying drawings:
as shown in fig. 1, a method for visualizing a topic facet tree based on a first-order curve includes the following steps:
s1, visualizing the data of the theme facet tree according to the needs, and drawing the trunk of the theme facet tree, wherein the result is shown in FIG. 2;
the type of the data is a json type, and the json data is divided into three layers. The first theme layer (firstLayer) comprises three main attributes of a theme name (topicName), the number of contained first-level facets (firstfacetnems) and a first-level facet list (firstFacetList). The second layer is a first level facet layer (second layer) containing three main attributes of a first level facet name (firstFacetName), a number of contained second level facets (firstfacetnems), and a list of contained second level facets (second facetlist). The third layer is a second level facet layer (thirdLayer), a second level facet name (secondFacetName) one of the main attributes. The main trunk of the subject facet tree is drawn according to the front end svg method and the size of a screen, a line which is in accordance with the plant tree is drawn, the height of the line is marked as trunkHeight, and the line becomes thinner from bottom to top in sequence.
S2, drawing first-level facets on two sides of the main trunk of the subject facet tree;
growing the first-level facets on two sides of the trunk of the subject facet tree to simulate the growth process of the botanical tree; the first-level facet uses a first-order curve to represent the branch, the font is arranged along the direction of the first-level facet branch, and the facet name is arranged along the direction of the branch. Since the height of the main trunk of the subject facet tree is trunkHeight, the number of the first-level facets is fisrtFacetNums as can be known from the parameter data. The trunk lines will be divided into
Figure BDA0003043307370000051
The nodes, on both sides of which different facets are to be placed in sequence, are referred to herein as the starting nodes of the facets. The starting nodes are spaced apart by a distance of
Figure BDA0003043307370000061
After the starting nodes of the first-level facets in the trunk of the subject facet tree are calculated, the first-level facets sequentially draw branches from two sides of each starting node, the deviation angle between the branches and the horizontal plane is a fixed angle, and the result is a first-level facet drawing result schematic diagram of the subject 'phylogenetic tree' as shown in fig. 3.
S3, when the number of the second-level facets is larger than 9, the first eight second-level facets with the fragment number rank are taken as normal display, the rest second-level facets are folded by other facets, and a user can check the rest second-level facet information by clicking other second-level facets; when the number of the second-level facets is less than 9, folding is not needed, the second-level branches are established on the first-level facets as the minimum offset angle by calculating the tangent value of the height of the font size of the adjacent second-level branches and the offset of the font size, and the minimum offset angle ensures that the font and the previous branches of the branches are not overlapped;
subject matter: refer to the knowledge unit under the course, such as the topics of "linked list", "red and black tree", "graph theory term" in the course of "data structure".
First-stage splitting: refers to a point of knowledge in one dimension that is directly related to the subject. Such as "basic operations", "applications", "definitions" etc. under the subject "red and black trees".
Second-stage splitting: some dimension knowledge point that is not directly related to the topic, but is directly related to a certain level of facet under the topic. The primary facet "basic operation" of the theme "red and black tree" includes secondary facets such as "delete node", "insert node", and the like.
Subject facet tree: namely, a theme under a course and the architecture information of each level of facet contained in the theme.
Knowledge fragmentation: i.e. the specific information of a certain facet, and the part is also the content that the learner finally needs to learn. The method comprises two forms of rich text and video.
Offset angle thetai: the included angle between the current secondary branch and the last drawn secondary branch is referred to, wherein the offset angle of the first drawn secondary branch is the included angle between the first drawn secondary branch and the horizontal direction. As can be seen from FIG. 4, the included angle θ between the two-level facet matrix method and the horizontal direction0Is the initial deflection angle. Angle theta between the two-stage facet ' reduction method ' and ' matrix method1Is the deflection angle of the "reduced law".
Offset dxi: and the distance between the position of the starting node of the branch name and the font is represented. dx (x)i-1Denoted as the offset of the previous drawn branch. As shown in particular in fig. 7. dx (x)iRepresents the offset of the branch "reduced" currently drawn. dx (x)i-1The offset of the branch "matrix method" drawn last time is indicated.
Having introduced the relevant definitions, this documentThe minimum offset angle of the present branch is calculated by calculating the tangent value of the minimum offset angle. As shown in fig. 5, in order to ensure that the branch of the facet "reduction method" does not overlap with the font of the facet "matrix method", the minimum offset angle of the branch of the facet "reduction method" is tangent to the font of the "matrix method". textHeight is expressed as the height of the branching font. As can be seen from FIG. 5, the minimum offset angle αiThe calculation formula is as follows:
Figure BDA0003043307370000071
where textHeight represents the font size, dxiRepresents the distance, i.e. offset, of the position of the starting node of the current rendering branch i from the position of the font. dx (x)i-1Indicating the amount of facet offset from the last rendering. As shown in particular in fig. 7. dx (x)iRepresents the offset of the branch "reduced" currently drawn. dx (x)i-1The offset of the branch "matrix method" drawn last time is indicated. Alpha is alphaiRepresenting the minimum angle of branch i with respect to branch i-1, i.e., the minimum offset angle. As shown in particular in fig. 5.
To simulate the growing process of a natural tree, the calculated offset angles of adjacent branches and the offset of the branches will be randomly generated within a certain range.
Offset angle thetaiIn the range of
Figure BDA0003043307370000072
Wherein alpha isiThe minimum offset angle calculated for the above formula to avoid overlap of branches and fonts;
Figure BDA0003043307370000073
denotes the maximum offset angle, second branch number denotes the number of second branches of the first branch, and this result is mainly to prevent the offset angle of some two branches from being too large, which leads to the situation that the rest branches are placed everywhere.
When the angle theta is deviatediIs taken as
Figure BDA0003043307370000074
At this time, consideration is needed to avoid the phenomenon of tight font aggregation. At this time dxiThe value of (c) is shown in the following formula 5-1, and textLen represents the font length of the current branch name. When the offset of the adjacent branch is less than or equal to the product of the font length of the current branch and the cosine value of the offset angle, the offset of the current branch is obtained by subtracting the current font length from the secant value of the current offset angle multiplied by the offset of the adjacent branch, and the result is shown in fig. 6; otherwise, the offset of the adjacent branch plus the sum of the font lengths of the adjacent branches is first calculated, and then the resulting sum is multiplied by the secant value of the current offset angle, with the result shown in fig. 7. The purpose of this is to offset the fonts of adjacent branches that are closer together, preventing the problem of distraction of the learner due to tight font clustering.
Figure BDA0003043307370000081
When the angle theta is deviatediIs taken as
Figure BDA0003043307370000082
At this time, because the adjacent branches are far away, the phenomenon that the fonts are gathered tightly cannot be considered.
Offset dx at this timeiThe value range is as follows: [0, branchLen-textLeni]. BranchLen denotes the default length of the branch, textLeniIndicating the length of the font.
As can be seen from statistics of the knowledge forest data set, the number of the current primary facets is 409526, and the number of the primary facets including more than 9 secondary facets is 107. It can be calculated that the probability that the number of secondary facets is less than or equal to 9 is 99.97%; the probability of a first-order facet containing more than 9 second-order facets is less than 0.03%, and can be almost ignored in the knowledge forest data set. Therefore, in the phenomenon of avoiding overlapping of facets, the phenomenon that the number of facets is less than or equal to 9 is emphasized. When the number of the secondary facets is more than 9, counting the number of fragments of each secondary facet, reserving the first eight with the largest number as branches, and folding the rest parts by using other parts;
the final visualization results are shown in fig. 8 and 9.
The visualization of the hierarchical data such as the subject facet tree is completed based on a first-order curve mode. The method has the following two advantages:
1) by means of statistical folding and design of the minimum offset angle of the secondary branches, the overlapping probability of the branches and the fonts in the secondary facet is greatly reduced. The problem of learner's learning lost caused by the overlapping of the split fonts is avoided.
2) By calculating the offset of the font and the branch starting point, the font aggregation in the branch is not tight, and the phenomenon of distraction of learners due to tight font aggregation is avoided.

Claims (10)

1. A topic facet tree visualization method based on first-order curves is characterized by comprising the following steps:
s1, visualizing the data of the theme facet tree according to the needs and drawing a main trunk of the theme facet tree;
s2, drawing first-level facets on two sides of the main trunk of the subject facet tree;
s3, when the number of the secondary facets is larger than 9, 8 secondary facets with the largest fragment knowledge number are selected for display, and the rest secondary facets are folded by 'other'; when the number of the secondary facets is less than 9, folding is not needed; the second-level facet establishes a second-level branch by calculating the height of the font size of the adjacent second-level branch and the tangent value of the offset thereof as a minimum offset angle and taking the branch tail end of the first-level facet as a starting point, thereby realizing the visualization of the theme facet tree.
2. The method as claimed in claim 1, wherein the first-order facet uses a first-order curve to represent its branch, the font is set along the direction of the branch of the first-order facet, and the facet name is set along the direction of the branch.
3. The method as claimed in claim 1, wherein the main trunk of the subject facet tree is drawn in a manner of drawing a line conforming to the plant tree according to the screen size based on a front-end svg technique, and the height of the line is denoted as trunkhight, and the height of the line becomes thinner from bottom to top.
4. The method as claimed in claim 1, wherein after the starting nodes of the first-order facets in the trunk of the topic facet tree are calculated, the first-order facets sequentially draw branches from both sides of the starting nodes, and the offset angle between the branches and the horizontal is a fixed angle.
5. The method as claimed in claim 1, wherein the minimum deviation angle of the facet is obtained by tangent function,
Figure FDA0003043307360000021
where textHeight represents the height of the font, dxi-1Indicating the amount of facet offset from the last rendering.
6. The method as claimed in claim 1, wherein the offset angle range is within
Figure FDA0003043307360000022
Wherein alpha isiFor the minimum offset angle calculated by the above formula,
Figure FDA0003043307360000023
denotes the maximum offset angle, and second BranchNums denotes the number of second-order branches belonging to the first-order facet.
7. The method of claim 6, wherein the angle of offset is offset
Figure FDA0003043307360000024
When is, dxiThe value of (c) is as shown in the following equation 5-1, textLeniThe font length representing the name of the current branch,
Figure FDA0003043307360000025
8. the method of claim 7, wherein the angle of deviation is determined by a method of visualizing the first-order curve-based topic facet tree
Figure FDA0003043307360000026
In time, the phenomenon of tight font clustering will not be considered, and the offset dxiThe value range is as follows: [0, branchLen-textLeni]BranchLen denotes the default length of the branch, textLeniIndicating the length of the font.
9. The method for visualizing the subject facet tree based on the first-order curve of claim 1, wherein when the number of the second-order facets is greater than 9, the number of fragments of each second-order facet is counted, the first eight with the largest number are reserved as branches, and the rest of the passes are folded by 'other'.
10. The method as claimed in claim 1, wherein the distance between each start node is
Figure FDA0003043307360000027
After calculating the starting nodes of each first-level facet in the main trunk of the subject facet tree, each first-level facet will be sequentially from each starting nodeThe branches are drawn in sequence on the two sides, and the offset angle between the branches and the horizontal plane is a fixed angle.
CN202110464783.9A 2021-04-28 2021-04-28 Topic facet tree visualization method based on first-order curve Active CN113254739B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110464783.9A CN113254739B (en) 2021-04-28 2021-04-28 Topic facet tree visualization method based on first-order curve

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110464783.9A CN113254739B (en) 2021-04-28 2021-04-28 Topic facet tree visualization method based on first-order curve

Publications (2)

Publication Number Publication Date
CN113254739A true CN113254739A (en) 2021-08-13
CN113254739B CN113254739B (en) 2023-03-14

Family

ID=77222313

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110464783.9A Active CN113254739B (en) 2021-04-28 2021-04-28 Topic facet tree visualization method based on first-order curve

Country Status (1)

Country Link
CN (1) CN113254739B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104036549A (en) * 2014-07-02 2014-09-10 中国林业科学研究院资源信息研究所 Three-dimensional visualization simulation method for morphological structures of sympodial branching trees
CN104346413A (en) * 2013-08-09 2015-02-11 聚游互动（北京）科技发展有限公司 Method and system for presenting visual search results on mobile terminal
US20150324481A1 (en) * 2014-05-06 2015-11-12 International Business Machines Corporation Building Entity Relationship Networks from n-ary Relative Neighborhood Trees
CN106484754A (en) * 2016-07-28 2017-03-08 西安交通大学 Based on hierarchical data and the knowledge forest layout method of diagram data visualization technique
CN107844350A (en) * 2017-10-20 2018-03-27 北京集奥聚合科技有限公司 A kind of screening technique and device for visualizing multi-level state
CN108108430A (en) * 2017-12-18 2018-06-01 西安交通大学 A kind of method realized based on Unity3D knowledge forests virtual reality system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104346413A (en) * 2013-08-09 2015-02-11 聚游互动（北京）科技发展有限公司 Method and system for presenting visual search results on mobile terminal
US20150324481A1 (en) * 2014-05-06 2015-11-12 International Business Machines Corporation Building Entity Relationship Networks from n-ary Relative Neighborhood Trees
CN104036549A (en) * 2014-07-02 2014-09-10 中国林业科学研究院资源信息研究所 Three-dimensional visualization simulation method for morphological structures of sympodial branching trees
CN106484754A (en) * 2016-07-28 2017-03-08 西安交通大学 Based on hierarchical data and the knowledge forest layout method of diagram data visualization technique
CN107844350A (en) * 2017-10-20 2018-03-27 北京集奥聚合科技有限公司 A kind of screening technique and device for visualizing multi-level state
CN108108430A (en) * 2017-12-18 2018-06-01 西安交通大学 A kind of method realized based on Unity3D knowledge forests virtual reality system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
YING SUN ET AL.: ""Characterizing Tree Species of a Tropical Wetland in Southern China at the Individual Tree Level Based on Convolutional Neural Network"", 《IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING》 *
魏晓: ""文本概念语义空间模型及其应用研究"", 《中国博士学位论文全文数据库 信息科技辑》 *

Also Published As

Publication number Publication date
CN113254739B (en) 2023-03-14

Similar Documents

Publication Publication Date Title
CN106484754B (en) Knowledge forest layout method based on hierarchical data Yu diagram data visualization technique
CN103617576B (en) General fault detecting and maintenance method for equipment
CN107145559B (en) Intelligent classroom Knowledge Management Platform and method based on semantic technology and game
Lahsen Should AI be designed to save us from ourselves?: artificial intelligence for sustainability
CN105046287B (en) A kind of online more strokes repeat the cluster and approximating method of skeletonizing
WO2000065427A2 (en) Fast extraction of counts from sparse data
CN103020295A (en) Problem label marking method and device
CN110414835A (en) A kind of TV play drama quantitative evaluation system and method
CN109920476A (en) The disease associated prediction technique of miRNA- based on chaos game playing algorithm
CN113254739B (en) Topic facet tree visualization method based on first-order curve
CN112417267A (en) User behavior analysis method and device, computer equipment and storage medium
CN103700027A (en) Method for achieving multi-dimensional bidirectional free-matching visual display of electric power data and graphics
CN109446506B (en) Automatic reconstruction method and device for electronic form table
CN108304519A (en) A kind of knowledge forest construction method based on chart database
CN112115707A (en) Emotion dictionary construction method for bullet screen emotion analysis and based on expressions and tone
CN106485616A (en) A kind of adaptive mobile network's teaching hierarchy model and system
CN103559244B (en) The acquisition methods of message body based on mbx form and system
CN106777061A (en) Information hiding system, method and extracting method based on web page text and image
CN111177411A (en) Knowledge graph construction method based on NLP
CN111191242A (en) Vulnerability information determination method and device, computer readable storage medium and equipment
CN101685443A (en) Display system and method of associated word query interface
CN113011875A (en) Text processing method and device, computer equipment and storage medium
CN112818263A (en) Forest navigation learning system implementation method based on augmented reality technology knowledge
Kharaghani et al. SPECIAL ISSUE ON ARTIFICIAL INTELLIGENCE AND CLIMATE CHANGE
Fienberg et al. On small world statistics

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant