九、發明說明： 【發明所屬之技術領域】 特別是指一種可提供順 本發明係有關一種提供職涯規劃之系統， 序性職涯資訊之方法及其系統。 【先前技術】 面對現今社會多元化的職場生態，過 助或建議多半是由專家導向的方式來卢冑h _^之職屋規劃上協 人格特m㈣Λ核理’亦即或透過心理測驗進行 性向與興趣等分析，再考量現實面的條件限制、 :長，：，綠辅以諮商來建立其職涯規劃。 的设計，其品詩受到測驗相_統計分析的影響，—方面 ^成夠品質的樣本，另—方面也仍有無法顧及個體變異度^ 問4，此外亦纽於既有料„源，也無法對敍的使 =的服務。細職涯規劃對個人來說是具有長期且深遠的影塑，= 目期工作的選擇上出現不滿意或缺乏努力以赴的 動機對工作者或僱主都是一種浪費。 皮二此L本發明即針對上述f知技術之數項缺失，提種提供順 方法’整合歷史上大量的職涯實例，從中建構出各』 = 之變化歷程並提供完整的相關資訊，提供使用者可能的 最佳發展順序，以有效克服上述該等問題。 【發明内容】 本發月之主要目的在提供一種提供順序性職涯資訊之方法及其系統， „對使用者對於未來希望達到的赌目標提㈣*由群魅驗所統 。十之ΐ訊’以獲知②目標的可行性及實現歷程。 y本發明之另—目的在提供—種提供順序性職織訊之方法及其系統， /、係利用將資料庫巾之群組資料繪製成參考時間轴之加權有向圖，並得到 各段職涯經歷之連結網路圖。 本發明之再-目的在提供—種提供順序性麟資訊之方法及其系統， 使用者可輸人-求學賴或在職賴，㈣統巾獲得該段經歷之前後最佳 1324752 之轉職選擇。 •, 為達上述之目的，本發明提供一種提供順序性職涯資訊之方法及系 統’其中該系統包括一資料庫，其中記錄有複數筆職涯經歷之資料；一起 _ 點欄位，於其中輸入一起始經歷；一終點欄位，於其中輸入一最終經歷； • 以及一最短路徑欄位，依據起點欄位及終點攔位之内容，從資料庫中取得 從起始經歷到達最終經歷之至少一最短路徑。使用者可在本發明之系統中 分別輸入一起始經歷及最終經歷，系統便會顯示出從起始經歷到達最終經 歷之群體經驗中，最短歷程的資料以供使用者參考。 而提供順序性職涯資料之方法則包括下列步驟：於一資料庫中記錄有 •複數筆職輯料，每-筆職涯資料中包含至少—求學經歷及在職經歷，將 每一筆職涯資料製成一加權有向圖，於加權有向圖中每一段求學經歷及在 職經歷皆設為-個節點；將加權有向圖中相鄰之節點拆成兩兩一組:節點 對，使每個節點對中皆包含-連出節點一連人節點及—加權連線，且節 ·.. 2射之連出節點可為下-個節點對之連人節點；統計每—節點指向特定 節點之-人數’ 相對之加權連線所代表_性分布及依據預先設 定的屬性提供任意兩節點之間的至少一最短路徑。 底下藉由具體實施例詳加制，當更容練解本發明之目的、技術内 容、特點及其所達成之功效。 Φ 【實施方式】 本=_提供-種提供财性職涯龍之方法，其合資料庫 存之歷史資料，從大量的職涯實例中將各種可 ^化歷程建構出來，並提供完整的相訊，建議可能的最佳 序，以協助使用者評估並設定長期發展方向，並擇 歷背景，及該廠商在人才培育的規劃上之可能方向。’、相關予，士 在本發明系統之資料庫中記錄有歷史上大量群體 -筆職涯資料中包含至少—求學 ’貝科’母 序性職涯w财料^心在職歷本發_提供之順 序_處法_圖所示，在步驟S1G中，每—筆職涯資料可 6 丄 W4752 順序的有序事件集，絲多事件集製成一具有時間轴之 職細L 7如第2圖所不，在這加财向财每—段求學經歷及在 1984== 一個節點’並可附加上屬性，例如：大學(19_7 - '1989/11)^5 節點msr所述，將加權有向圖中相鄰之節點拆成兩兩一組之 將第3A圖中一個有向圖之四個節點20、22、24、26， 2〇、ib Sb圖!^三，點對’使每個節點對中皆包含一連出節點 34，且每一㈣料入鱼卽ψ^_223、2伯、26及一加權連線3〇、32、 如步驟U 可為下一個節點對之連入節點；接著， 之叙統計每r節點指向特定節點之次數，此即每一節點 例如其巾出人數，並統計相對之加權連線所代表的屬性分布， 、中由即點20連出到節點22之連線佔所有連出 點編種職務，_卿_==見: 續職成本之#敍應—般制者之考慮因素。 門_ ί ’如步驟S16所述，依據預先設定的屬性提供任音兩_之 為時rJ县據不同的屬性得到不_最短路徑結果，例如：屬性 時，i控之加權連線在加權有向圖中為最短；屬性為f數 :數=::得時，於,料庫中找出與特定== 於資料庫中找出與特定之節點有加權連線之複數節 之職務，並財選出有年齡 複^點其所代表 點之;::所包含之節點數量最少的路徑：：出通過兩節 -終點襴1=第：::及包觸10、-起點攔位12、 屬ϋ攔位16及-最短路徑攔位18，資料庫1〇中 7 有^上大量群體之顧料，朗者可於__彳2及終點欄 为別填入-起始經歷和最終經歷，並在屬性搁位16中選擇在 ㈣依據之屬性’ _猶述之提供順序性職涯資訊之方 料庫1G中制至少—筆關於起始經歷和最終經歷之間的最 ,丑仏之貝5凡’並顯示於最短路徑攔位18中。 =^明之系統中更可包括—連出欄位及—連人欄位，分別提供 二£ Μ、H歷後之下—經歷以及最多人在到達該最終經歷前之上 。-.，里歷’並各顯示前十筆資料於該連出攔位及連人搁位中。 #4Γ^5圖^第6圖為本發明巾侧提供順序性職涯資訊之方法提供 之純的實_，在第5财，起關位及終關位所填入 細料人纽客戶服務主f，射制五筆最短路徑 之建礅於中央之最短路徑攔位（5th加獅中而在 攔位㈣得職起始經歷「細料人貢」連出之最多人選擇 μ^於右下方之搁位中顯示出對起始經歷及最終經歷之加權連線的 第"6 H包括轉龜、平均時間間隔、轉職比例及轉職成本等資訊。 之祕娜及終點觀崎獻之、紐分別為lntemet程式 金融專業主官’則在下方同樣可得到五筆最短路徑之建議、 最夕人連入/連出之經歷及加權連線之統計資訊。 &上所述，本發明提供—提供順序性職涯資訊之方法及 =用資料庫中所儲存之群體資料轉換成順序性之加 :、再拆 ㈣，進行連線分析與統計，得到歷史上各種不同經歷選擇 f際發生人數、所花費時間等統計分布資訊，讓個者可設定一 1展目標’藉由本發明之系統評估達成該目標之可能性，藉以得 人適ΐίΐ方本發明之系統尋找糊學經歷背景之 。適求職者，妓供廠商在未來人才培？的_上可參考的發展 唯以上所述者’僅為本發明之較佳實施例而已，並非用來限 發明實施之範圍。故即凡依本發明巾請範_述之特徵及精神 均等變化或修飾，均應包括於本發明之巾請專利顧…’’、、 1324752 【圖式簡單說明】 第1圖為本發明中提供順序性職涯資訊之方法之流程圖。 第2圖為本發明中一加權有向圖之實施例示意圖。 第3A圖及第3B圖為本發明中將節點拆成節點對之示意圖。 口順序性職涯資訊之系統之方塊圖。 圖。圖及第6圖為本發日种提供順序性職轉訊之系統之實施例示意 【主要元件符號說明】 1〇資料庫 12起點攔位 14終點攔位 16屬性攔位 18最短路徑攔位 20、22、24、26 節點 22a、24a連入節點 22b、24b連出節點 30、32、34加權連線IX. Description of the invention: [Technical field to which the invention pertains] In particular, it relates to a method and system for providing a system for providing career planning, a sequence of career information, and the like. [Prior Art] Faced with the diversified workplace ecology of today's society, most of the help or advice is from an expert-oriented approach. Lu Hao h _^'s job plan is on the basis of the personality of the person(s), or by psychological test. Analysis of sexual orientation and interests, and then consider the conditions of the real world, long::, Green assisted by consultation to establish their career planning. The design of the poems is influenced by the statistical analysis of the _ _ statistical analysis, - the aspects of the quality of the sample, the other side is still unable to take into account the individual variability ^ Q4, in addition to the existing materials „ source, also The service of the syllabus is not long-term and far-reaching. = The dissatisfaction of the choice of the job or the lack of hard work is the same for the worker or employer. A kind of waste. This invention is aimed at the lack of several of the above-mentioned techniques, and provides a way to integrate the history of a large number of career examples, constructing a change history and providing complete information. Providing the best development order possible by the user to effectively overcome the above problems. SUMMARY OF THE INVENTION The main purpose of this month is to provide a method and system for providing sequential career information, „for the user for the future I hope that the goal of the bet will be raised (4)* by the group. Ten of the news] to understand the feasibility and realization of the 2 goals. y Another object of the present invention is to provide a method and system for providing sequential job splicing, and to use a grouped data of a database towel as a weighted directed graph of a reference time axis, and to obtain segments. Linked network map of career experience. A further object of the present invention is to provide a method and system for providing sequential information, which can be used by a user to obtain a student-seeking or in-service job, and (4) a towel to obtain the best job transfer option before and after the experience. For the above purposes, the present invention provides a method and system for providing sequential career information, wherein the system includes a database in which a plurality of information on the career experience is recorded; together with a point field, Enter an initial experience; a final field in which to enter a final experience; • and a shortest path field, based on the content of the starting and ending blocks, from the database to obtain at least the final experience from the initial experience A shortest path. The user can enter an initial experience and a final experience in the system of the present invention, and the system displays the shortest history of the group experience from the initial experience to the final experience for the user's reference. The method for providing sequential career information includes the following steps: recording a plurality of professional materials in a database, and each of the career information includes at least—study experience and on-the-job experience, and each job information is provided. A weighted directed graph is formed, and each of the learning experiences and the in-service experience in the weighted directed graph are set as a node; the adjacent nodes in the weighted directed graph are split into two groups: node pairs, so that each Each node pair includes a connected node and a weighted connection, and the node of the node is a connected node of the next node; the statistics each node points to a specific node. - The number of persons' relative weighted links represents at least one shortest path between any two nodes based on pre-set attributes. The details, technical contents, features and effects achieved by the present invention will be further clarified by the detailed description of the specific embodiments. Φ [Implementation] This =_ provides - a method of providing financial careers, the historical data of the data inventory, from a large number of career examples to construct a variety of processes, and provide complete information Propose the best possible order to assist users in assessing and setting the long-term direction of development, and to choose the background and possible direction of the vendor's planning for talent development. ', related to, in the database of the system of the invention recorded in the history of a large number of groups - pen career information contains at least - to learn 'beca' mother-sexual career w-materials ^ heart in the service of the hair _ provide The sequence _ method _ shows that in step S1G, each job information can be 6 丄 W4752 order of the ordered event set, the silk event set is made into a time axis of the job L 7 as the second The map does not, in this riches to the financial per-section learning experience and in 1984 == a node 'can be attached to attributes, for example: university (19_7 - '1989 / 11) ^ 5 node msr, will be weighted Split the adjacent nodes into two or two groups in the figure. The four nodes 20, 22, 24, 26, 2〇, ib Sb map of a directed graph in Fig. 3A, ^3, point pair 'make each Each node pair includes a connected node 34, and each (four) feeds into the fish 卽ψ^_223, 2 伯, 26 and a weighted connection 3〇, 32, as step U can be the node of the next node pair Then, the statistics count the number of times each r node points to a specific node, that is, each node, for example, its number of people, and counts the genus represented by the weighted connection. Distribution, namely by 20 points to even out the connection node 22 accounted for all kinds of knitting even point out the duties of State _ _ == See: Continued cost of post # Syria should - consider factors like the person's system. Gate _ ί 'As described in step S16, according to the pre-set attribute to provide two voices, the rJ county obtains a non-shortest path result according to different attributes. For example, when the attribute is used, the weighted connection of the i-control is weighted. The shortest picture in the figure; the attribute is f number: number =:: at the time, in the library, find out the position of the complex number with the specific == in the database to find a weighted connection with the specific node, and The election has an age to re-point the points it represents;:: The path with the fewest number of nodes included:: out through two sections - the end point = 1 = the first ::: and the packet touch 10, - the starting point block 12, the genus ϋBlock 16 and - Shortest Path Block 18, 7 in the database 1 有 have a large group of candidates, the lang can be filled in __ 彳 2 and the end column - start experience and final experience, And in the attribute shelf 16 choose the most ugly shell between the initial experience and the final experience in the (4) attribute according to the attribute ' _ 〗 〖 〗 5 where 'and is shown in the shortest path block 18. The system of =^ Ming can include - consecutive fields and - connected fields, respectively providing two £ Μ, H history - experience and the most people before reaching the final experience. -., Lili' and each display the first ten pieces of information in the company and the company. #4Γ^5图^ Figure 6 is a pure example of the method of providing sequential career information for the towel side of the present invention. In the fifth fiscal, the customs clearance and the final customs position are filled with the customer service. The main f, the shortest path to shoot the five shortest paths, the shortest path block in the center (5th plus the lion and the starting position in the block (four), the most popular person to choose the "fine material", the most people choose μ^ in the lower right The position in the position showing the weighted connection to the initial experience and the final experience includes information such as the tortoise, average time interval, turnover ratio and transfer cost. The secret and the end point of the observation , New Zealand is the lntemet program financial professional officer's, then the following can also get the five shortest path recommendations, the latest eve of the connected / connected experience and weighted connection statistics. & above, the present invention provides - Provide methods for sequential career information and = Convert the group data stored in the database into sequential additions: and then dismantle (4), conduct connection analysis and statistics, and obtain the number of people in history. Statistical time distribution information such as time spent, so that everyone can The goal of the exhibition is to evaluate the possibility of achieving this goal by the system of the present invention, so that the system of the invention can be used to find the background of the paste experience. The suitable job seeker, for the future talent training of the manufacturer _ The above-mentioned developments are only for the preferred embodiments of the present invention, and are not intended to limit the scope of the invention. Therefore, the characteristics and spirit of the invention are uniformly changed or modified. , should be included in the towel of the present invention, please refer to the patents... '', 1324752 [Simplified illustration of the drawings] Figure 1 is a flow chart of the method for providing sequential career information in the present invention. A schematic diagram of an embodiment of a weighted directed graph. Figures 3A and 3B are schematic diagrams of a node in which a node is split into a pair of nodes. A block diagram of a system of sequential sequential career information. Fig. and Fig. 6 Example of a system for providing sequential job transfer in this issue [Main component symbol description] 1〇Database 12 starting block 14 End point block 16 attribute block 18 Shortest path block 20, 22, 24, 26 Nodes 22a, 24a connected Points 22b, 24b connected nodes 30, 32, the connection weights