200807321 九、發明說明： 【發明所屬之技術領域】 本發明係有關一種提供職涯規劃之系統，特別是指一種可接徂 序性職涯資訊之方法及其系統。 ' 【先前技術】 面對現今社會多元化的職場生態，過去對於個人之職涯規劃上協 助或建議多半是由專家導向的方式來處理，亦即或透過心理測驗進行 人格特質、價值觀、性向與興趣等分析，再考量現實面的條件限制、τ 專長等資訊，最後伽諮棘建立錢涯賴。此綠包含各種測驗 的設計，其品質都受到測驗相關的統計分析的影響，一方面需要耗費 大，成本取得夠品質的樣本，另一方面也仍有無法顧及個體變異度的 問題；此外亦受限於既有的專業資源，也無法對廣大的使用者提=充 伤的服務。然而職職鑛個人來說是料細且深遠的影響，缺乏 長期目標往往造成對短期工作的選擇上出現不 ^赴 動機，對功者或粒較—槪f。 ⑽ 序性:二ί發Γ即針對上述習知技術之數項缺失，提出-種提供順 可处:貝3之法’整合歷史上大量的職涯實例，從中建構出各種 ίίΐϊί之變化歷程並提供完整的相關資訊，提供使用者可能的 取佳發展順序，以有效克服上_等問題。 ㈣ 【發明内容】 計之資1，以獲知該目標的可行性及實::提供過去由群體經驗所統 其二:提:―種提供順序性職涯資訊之方法及其系統， 各段職涯經歷之連結網路^料繪製成參考時間軸之加權有向圖，並得到 使用者可輸入:求種提供順序性職涯資訊之方法及其系統’ 、、二歷或在職經歷’從系統中獲得該段經歷之前後最佳 5 200807321 之轉職選擇。 $達述之目的，本發明提供—種提供順序性職涯資訊之方法及系 、先/、中違系統包括—貢料庫，其中記錄有複數筆職涯經歷之資料;一起 點攔=於其中輸入一起始經歷；一終點搁位，於其中輸入一最終經歷； 、v短路彳I攔位’依據起點攔位及終點攔位之， 條 經朗達最終經歷之至少—最短路徑。使用者可在本發明 ^ *入触經歷及最終經歷，系統便會顯示出從起始經 娘 歷之群體經驗中，最短歷程的資料以供使用者參考。 敢― 雜職轉料之方_包括下辭驟:於―f料料記錄有 Ϊ:!料’每一筆職涯資料中包含至少-求學經歷及在職經歷，將 ^·、職涯貝料製成一加權有向圖，於加權有向圖中每一段求學經歷及在 ==昏個節點;將加權有向圖中相鄰之節點拆成兩兩一組之節點 對中皆包含一連出節點、—連入節點及一加權連線，且節 料為下—個節點對之連人節點；統計每—節點指向特定 =的屬二批計相對之加權連線所代表的屬性分布；以及依據預先設 疋的屬性楗供任思兩節點之間的至少一最短路徑。 底下藉由具體實施例詳加制，t更容歸解本發明之 容、特點及其所達成之功效。 议仰⑺ 【實施方式】 中所二種提供順雜職_訊之方法，其合資料庫 办斤保存之歷史貝料’從大量的職涯實例中將各種可能的發展順序及 =匕歷=建構出來’並提供完整的相關資訊，建議可能的最佳發展順 t以協助使用者評估並設定長期發展方向，並可與短期之工作選擇 二ί合可提供薇商設定或尋找適合的求職者其相關學經 歷月尽，及该廠商在人才培育的規劃上之可能方向。 一妓在本月系統之資料庫中記錄有歷史上大量群體之職涯資料，每 二筆職涯讀巾包含至少—求學經歷及在職經歷，本發明所提供之順 序性職涯資料方法如第]圖所示，在步驟⑽中，每—筆職涯資料可 6 200807321 視為一組特定順序的有序事件集，將眾多事件集製成一具有時間軸之 加權有向圖，如第2圖所示，在這加權有向圖中每一段求學經歷及在 職經歷皆設為一個節點’並可附加上屬性，例如：大學(1980/07 · 1984/07)、軟體工程師(1987/01 · 1989/11)等，而節點之間的加權連線 可代表事件變遷之相關屬性’如花費時間，在第2圖中共顯示了五個 人的有序事件集。 ^再如步驟S12所述，將加權有向圖中相鄰之節點拆成兩兩一組之 節點對，例如將第3A圖中一個有向圖之四個節點2〇、22、24、26， 拆成如第3B圖中之三組節點對，使每個節點對中皆包含一連出節點 =、22b、24b、-連入節點 22a、24a、26 及-加權連線 3〇、32、 ^且每-節點對中之連出節點可為下一個節點對之連入節點；接著， 統計每一節點指向特定節點之次數，此即每-節點 例如其中由節點20人斤代表的屬性分布， 點代表兩種職務，則其加權連線所反 轉職=，此轉職成本之計算係反應—般使用者之考慮^本了視作 -I；：!：；：, 時’最短路徑係參考連出有向圖中為最短；屬性為人數 節點；屬性為薪資所得時US:，量，選出最多人進出之 之複數節點其所代表之職務 '甘= 與特定之節點有加權連線 齡時，於資料庫中找薪資所得較高者；屬性為年 之職務，並從中選出複數節_^^ 點之^中所包含之節點數則選出通過兩節 本發明之系統如第4 ^ P為攻知:路徑。 -終點攔位14、一屬性椚:二匕含—資料庫1〇、-起點攔位12、 屬_位16及-最短路徑攔位18，資料庫川中 7 200807321 儲存有歷^上大量群體之職涯轉，使用者可於起關位12及終點搁 位ϋ中一刀別填人起始經歷和最終經歷，並在屬性欄位16中選擇在 搜尋最紐路彳I%依據之屬性，則經過前述之提供順序性職涯資訊之方 法可從貝料庫10中得到至少一筆關於起始經歷和最終經歷之間的最 短路徑之資訊，並顯示於最短路徑攔位18中。 於本發明之純中更可包括—連出攔位及—連人攔位，分別提供 ❹人在起始經歷後之下-經歷以及最多人在到達該最終經歷前之上 -經，，並各|細前十筆龍於該連出攔位及連人棚位中。 第5圖及第6圖為本發明中利用提供順序性職涯資訊之方法提供 最短路徑之純的實_，在g 5圖中，起點欄位及終點攔位所填二 查f料人M及客戶服務主#，則可_五筆最短路徑 建4 ;中央之敢短路徑欄位（5th Sh〇rtest Paths)巾，而在左 f 中則得到從起始經歷「細審計人M」連出之最多人選擇 中辭㈣起始經歷及最終經歷之加權連線的 、笛°=由t職數、平均時間間隔、轉職比例及轉職成本等資訊。 回之起點攔位及終點攔位内所填入之經歷分別為丨 y ，則在下方囉可·五筆最短路徑之建議二 取夕t連入/連出之經歷及加權連線之統計資訊。 练上所述，本發明提供一提供順序性職涯之 _資料料所儲存之群體雜轉換成順序性之加財賴 即點對後進仃連線分析與統計，得到歷上 =生，、所花費時間等統計分布資訊，讓使用者 期發展目標’勤本發明之純評简目標之 2涯發展方向亦可本㈣之系統尋找 S3 ^上所4者，僅為本發明之較佳實施例而已，麟 务明貝施之制。故即凡依本發明中魏騎述之特徵及精神本 均等變化或修飾，職包括於本發明之申請專利翻内。為之 200807321 【圖式簡單說明】 第1圖為本發明中提供順序性職涯資訊之方法之流程圖。 第2圖為本發明中一加權有向圖之實施例示意圖。 ，3A圖及第犯圖為本發明中將節點拆成節點對之示意圖。 ▲=目為本發明中提供順序性龜資訊之系統之方塊圖。 • ^圖及第6圖為本發财提供順序性職_之系統之實施例示意 【主要元件符號說明】 10資料庫 Φ 12起點攔位 14終點欄位 16屬性攔位 18最短路徑攔位 20、22、24、26 節點 22a、24a連入節點 22b、24b連出節點 30、32、34加權連線200807321 IX. INSTRUCTIONS: TECHNICAL FIELD OF THE INVENTION The present invention relates to a system for providing career planning, and more particularly to a method and system for receiving career information. '[Previous technology] In the face of the diversified workplace ecology of today's society, in the past, most of the assistance or advice for personal career planning was handled by an expert-oriented approach, that is, through psychological tests for personality traits, values, and sexual orientation. Analysis of interest and other factors, and then consider the conditions of the real world, τ expertise and other information, and finally gaze the establishment of Qian Ya Lai. This green contains the design of various tests, and its quality is affected by the statistical analysis related to the test. On the one hand, it requires a large amount of cost, and the cost is sufficient to obtain a sample of sufficient quality. On the other hand, there is still a problem that the individual variability cannot be considered; Limited to existing professional resources, and can not provide services for the majority of users. However, the occupational mines are intimate and far-reaching. The lack of long-term goals often leads to a lack of motivation for the choice of short-term jobs, and for those who are more or less. (10) Preface: Two Γ Γ Γ 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对 针对Provide complete and relevant information to provide users with a possible development sequence to effectively overcome the above problems. (4) [Inventive content] Calculate the capital 1 to know the feasibility and reality of the goal:: Provide the past by the group experience: 2: "Methods and systems for providing sequential career information, each segment The link network of the experience of the world is drawn into the weighted directed graph of the reference time axis, and is input by the user: the method of providing sequential job information and its system ', , two calendar or in-service experience 'from the system In the middle of the period before getting the best 5 200807321 transfer option. For the purpose of the statement, the present invention provides a method and system for providing sequential career information, a first/, and a violation system including a tribute library, in which a plurality of documents of the career experience are recorded; Wherein, an initial experience is entered; an end position is placed, and a final experience is entered therein; and v is short-circuited, and the I-stop is based on at least the shortest path that Ronda eventually experiences. The user can display the shortest course of the group experience from the beginning of the experience of the present invention for the user's reference. Dare - the side of the miscellaneous job transfer _ including the following words: in the "f material records have a flaw: ! material 'each job information contains at least - study experience and on-the-job experience, will ^,, career a weighted directed graph, in each of the weighted directed graphs, and at == faint nodes; the nodes in the weighted directed graph are split into two or two nodes, each of which contains a connected node - the connected node and a weighted connection, and the material is the lower node of the node pair; the statistical attribute distribution of each node to the specific weighted connection of the two batches; and The pre-set attribute is at least one shortest path between the two nodes. The details of the present invention are further explained by the detailed description of the specific embodiments, and the effects achieved by the present invention are further explained. Argument (7) [Implementation] The two methods of providing a commissary _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ Constructed and provided complete and relevant information, suggesting possible best developments to assist users in assessing and setting long-term development directions, and with short-term work options to provide Weishang settings or find suitable job seekers The relevant academic experience is exhausted and the possible direction of the manufacturer in the planning of talent cultivation. In the database of this month's system, there are historical career information records of a large number of groups. Each of the two career readings contains at least—study experience and on-the-job experience. The sequential career information method provided by the present invention is as follows. In the figure, in step (10), each job information can be regarded as a set of ordered events in a specific order, and a plurality of event sets are made into a weighted directed graph with a time axis, such as the second As shown in the figure, each of the learning experiences and on-the-job experience in this weighted directed graph is set as a node' and can be attached to attributes such as: University (1980/07 · 1984/07), Software Engineer (1987/01 · 1989/11), etc., and the weighted connection between nodes can represent the relevant attributes of event transitions. If it takes time, a set of ordered events of five people is shown in Figure 2. ^ As described in step S12, the adjacent nodes in the weighted directed graph are split into two pairs of node pairs, for example, four nodes 2〇, 22, 24, 26 of a directed graph in FIG. 3A. , split into three pairs of node pairs as shown in Figure 3B, so that each node pair includes a connected node =, 22b, 24b, - connected nodes 22a, 24a, 26 and - weighted connections 3, 32, ^ and the connected nodes in each-node pair can be connected to the node of the next node pair; then, the number of times each node points to a specific node is counted, that is, the distribution of attributes of each node, for example, represented by node 20 , the point represents two positions, then the weighted connection is reversed =, the calculation of the transfer cost is the reaction of the general user ^ is regarded as -I;:!:;:, when the 'shortest path The reference is the shortest in the directed graph; the attribute is the number of nodes; the attribute is the US:, the amount of salary, the number of nodes that select the most people to enter and exit, the position they represent, 'Gan = weighted connection with the specific node When you are old, find the higher salary in the database; the attribute is the position of the year, and choose from it. The number of nodes included in the number of _^^ points is selected by two sections of the system of the present invention, such as 4^P for attack: path. - Endpoint block 14, a property 椚: two 匕 — - database 1 〇, - starting block 12, genus _ bit 16 and - shortest path block 18, database Chuanzhong 7 200807321 stored a large number of groups After the career transfer, the user can fill in the initial experience and the final experience in the starting position 12 and the final position, and select the attribute in the search field No. 16 in the attribute field 16 At least one piece of information about the shortest path between the initial experience and the final experience can be obtained from the shell library 10 via the aforementioned method of providing sequential career information and displayed in the shortest path barrier 18. In the pureness of the present invention, it may further include - connecting the intercepting position and the - connecting the person to block, respectively providing the deaf person after the initial experience - the experience and the most people before the arrival of the final experience - and, and Each of the ten top ten pens is in the chain and the shed. Figure 5 and Figure 6 show the pure real__ of the shortest path by using the method of providing sequential career information in the present invention. In the g5 diagram, the starting point and the ending block are filled in. And customer service main #, then _ five shortest path to build 4; central short path field (5th Sh〇rtest Paths) towel, and in the left f is from the initial experience "fine auditor M" The most people choose to resign (4) the starting experience and the final experience of the weighted connection, flute ° = by t number of positions, average time interval, transfer ratio and transfer costs and other information. The experience of returning to the starting point and ending point is 丨 y, then the following is the recommended short-term path of the five shortest paths, and the statistical information of the experience of connecting/connecting and the weighted connection. In view of the above, the present invention provides a sequence of career information stored in the data to be converted into a sequence of riches, that is, point-to-point analysis and statistics, to get the calendar = birth, and Spending time and other statistical distribution information, so that users can develop their goals. The development direction of the pure evaluation target of this invention can also be found in the system of (4), which is only the preferred embodiment of the present invention. However, Lin Wu Mingbei Shi system. Therefore, the characteristics and spirit of the Wei riding in the present invention are equally changed or modified, and the job is included in the patent application of the present invention. For the 200807321 [Simplified Schematic] FIG. 1 is a flow chart of a method for providing sequential career information in the present invention. Figure 2 is a schematic diagram of an embodiment of a weighted directed graph in the present invention. The 3A diagram and the first diagram are schematic diagrams of the node being split into node pairs in the present invention. ▲= is a block diagram of a system for providing sequential turtle information in the present invention. • ^ 图 and 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 图 10 实施 Φ Φ Φ 10 10 10 10 10 10 10 10 10 10 10 10 10 10 Φ Φ Φ Φ Φ Φ Φ Φ Φ Φ Φ Φ Φ Φ Φ Φ , 22, 24, 26 nodes 22a, 24a connected to nodes 22b, 24b connected to nodes 30, 32, 34 weighted connection