1276978 14796twf.doc/g 九、發明說明： 【發明所屬之技術領域】 本發明是有關於-種網絡建構方法，且特別是有關於 一種人際關係網絡建構方法，其可查詢及建立人力馬； 彼此關連性。 贫之 【先前技術】 在政府資訊數位化的快速腳步之下，刑案偵辦已從 統的紙筆作業轉換到電腦作業，所有資訊一旦輸入到 資料庫巾後，便可提供其它人貞再次使用。細，由於各 種系統建置時間不一且規格各異，加上歷史資料量龐大且 人際關係牽涉複雜，偵查員經常必須在查詢到資料後再自 行分析嫌犯的人際網路，也容易因為資料不完整或是杳、 的漏失’導致遺漏重要線索。 以查詢多人人際網絡圖為例，若偵查員經由線民得知 王小偉與張大民聯絡頻繁，但兩人過去從未合作犯案，亦 不曾於同一間囚房服刑，出入境資料中也找不到兩人曾搭 ，乘同一班機資料。以傳統方式來處理這個問題時，偵查^ 需往返於各個資料庫間。交叉輸入經由其它系統取得^人 名資料並進行比對，再自行利用紙筆或試算表找出關連 性’無法直接找出可能是第三者介紹而發生關連的可能配 對，導致延誤辦案的時機。 【發明内容】 本發明的目的就是在提供一種人際關係網絡建構方法 ，透過圖形化的資料展示方式，可以完整的呈現其所有關 5 1276978 14796twf.d〇c/g 係類 取得基本關係人之基本= =包括 資料相關資訊以及顯示此上與基本 於資料庫f此資料庫対不絲重^的^^立 依照本發明的較佳實施例所述，n_。 名包含;Π號r及查，。在選以=: 多個人員，則=二;搜哥到與基本關係人直接相關之 行前-搜尋 ，括;=相:人==， 本關係人之間的關連性。最後以二進位方基 ’並將查詢的結果以圖表的方式來分 ==、，會客、•幫派、^ 次…本务明因為在輸入基本資料後可自動至所右Ρ + 貝料庫中找尋符合條件的資料，並將結果呈現 °的 :=Γ呈 =圖可同時呈現超過一個關係別，並‘形 資料，&見際網絡關係，因此可省去閱讀_的文字 、’、' 且無需至各系統中找尋彼此的關聯，即可、^ 的呈現所有關伽綱人際關係網絡畴， 以凡整 資訊的時間。 里即省蒐集 6 1276978 14796twf.doc/g 為讓本發明之上述和其他目的、特徵和優點能更明顯 易懂，下文特舉較佳實施例，並配合所附圖式，作詳細說 明如下。 、。 【實施方式】 請參考圖卜其情示本發明之較佳實施例的一種人 際關係網絡雜方法的流程圖。此—具有人際_網絡建 ，方法主要包括取得基本關係人之基本資料11〇、選定搜 尋範圍12G，搜尋基本資料相關資訊⑽以及顯示資訊 H〇。其搜尋範H錄㈣庫巾，且:賴庫具有互 多個系絲.別。 首先在取得基本關係人基本資料11〇的步驟中，基本 =可包含姓名、身份證號碼、查鱗度、相對應的時間 :二所：:::用ίi指定或相關的資料庫中找到符合條 人。其中查詢深度是指查詢時資料探測層數 :所有待查人資深度為第0層，與任-待 一有直接相關的人資深度為第一層資 有;接相關的人資深度為第二層，以此類推。二數匕 各層人數_合，當作業查 卿^ 及複雜程度。用者可這兩個參數控制查循時間 統別===::有-指定至少-個系 同一,各畫面上看到所有系= 二二 統別的原有畫面分別查詢，可大量減 1276978 14796twf.doc/g ^在搜尋基本貧料相關資訊130中，當搜尋到與基本關 係人直接相關之多個人員，則以找到的相關人員為基本關 係人，重複進行前一搜尋步驟，直至到達查詢深度為止； 而f所找到的多個人員中，最好先剔除與先前找到的人員 重複的部分之後再進行搜尋，如此才不會因為重複搜尋而 造成搜尋過程無法結束。另外，在搜尋的資料庫中，其資 訊可以包括與基本關係人相關的人員以及這些相關人員與 基本關係人之間的關連性。 、/、 接下來簡要說明本作業緣製基本的樹狀資料演算法。 ^ ί ^步’設定—個縱軸的全域變數glGbeY，並:其初 ㈣it步，選定使用者輸人之第—個待查人資為左側數 狀圖的根節點。 第^步，若輸入的待查人資不只—人，則設 待查人貧為右側數狀圖節點，並依照下述方法繪製 點’初始節點為剛剛設定的右側根節點。 寺，若本節點為根節點， 二：否則，將X值設為父節點的X值加_，γ值設為 才双查疋否有子節點？若有，緣製子節點。 重新將本節點的γ值設為（本節點原Υ +gl〇beY)/2，並依據目前設定的綠製比例在書面以 節點。然後繼續檢查是否有旁系節點^ — 知出此 •右有，將globeY加 8 1276978 14796twf.doc/g ^後，繪製此旁系節點。之後附上此演算法之虛擬碼如圖 本作業由於使用了多於-種的系統別，因此對於兩兩 人資的關係值’採用二進位的紀錄方式。將任兩人之關係 值轉換為二進位表示後，若第i個位元的值為零，則表^ 此兩人在第i個系統找不到關聯，反之則表示表示有關 連。舉例而言，若曱與乙的關係值為74,以二進位表示後 為(0100 1010)2，表示曱，乙在第二，第四及第七個系統中 曾經共同出現在同一份資料中。 為料查询完成後將被描寫成XML樓，所有人資以數 狀的資料結構保存。圖3為XML的設計結構。每一個人 資（<cibpers>)a<pkey>指定一個序號，並以此序號作為 後續處理的索引標籤。標記<parent>、<flrstchild>與 <说1_>描述了該人資在數狀結構中的位置。<c〇ntact>則 描述了所有與此人資有關聯的其它人資序號及關係值。 农後顯示搜尋資料内容140，可表示為扇型圖（圖4)、 組織圖（圖5)，相連路徑圖（圖6)等來顯示個人或以兩個主 要人資為基礎與多人之間的關連。其中扇型圖為最簡單的 圖示法；組織圖可清楚呈現每個關係的系統別；相連路徑 圖是判斷圖面上兩個節點人資是否有共通的人資後，直接 連接兩根節點描繪出來的圖形。其閱讀方式為，若晝面中 的任兩人貧間有一或多條線條相連結，則表示至少在一個 系統層中發現兩人之間的關聯。而晝面中左右兩群人資彼 9 1276978 14796twf.doc/g 此若有相連者，一律以深色繪製，因為這些人資是連接左 右兩個根節點的重要關係人。 綜上所述，在本發明之人際關係網絡建構方法，可處 理不同系統不互相重疊之多個系統別，如此可方便使用者 1去閱讀煩瑣白勺文字資料且無需至各系統找尋彼此的關 聯’即可以完整的呈現其所有關係類別的人際關係網絡圖 形，大量節省蒐集資訊的時間。加上使用圖形可清處的呈 現超過一個以上的關係別，故可將其應用在刑案資料、同 囚、會客、入出境、幫派、偵察、移送等系統，以彌補用 人工知作查詢造成遺漏等不必要的缺失。 雖然本發明已以較佳實施例揭露如上，然其並非用以 限^本發明，任何熟習此技藝者，在不脫離本發明之精神 矛範圍内’當可作些許之更動與潤飾，因此本發明之保護 範圍當視後附之申請專利範圍所界定者為準。 【圖式簡單說明】 、圖1繪示本發明較佳實施例的一種人際關係網絡操作 流程圖。 圖2繪示本發明較佳實施例的一種演算法的虛擬碼。 圖3繪示本發明較佳實施例的一種XML設計範例。 圖4%示本發明較佳實施例的一種扇型圖。 圖5繪示本發明較佳實施例的一種組織圖。 图6纟會示本發明較佳實施例的一種相連路徑圖。 【主要元件符號說明】 110 :取得基本關係人之基本資料 1276978 14796twf.doc/g 120 :選定搜尋範圍 130 :搜尋基本資料相關資訊 140 :顯示搜尋資料内容1276978 14796twf.doc/g IX. Description of the Invention: [Technical Field] The present invention relates to a network construction method, and in particular to a method for constructing a human relationship network, which can query and establish human horses; Relevance. Poverty [Prior Art] Under the rapid pace of digitalization of government information, criminal investigations have been converted from computerized paperwork to computer operations. Once all information has been entered into the database, it can be used by others. . Fine, due to the different system construction time and different specifications, coupled with the huge amount of historical data and the complexity of interpersonal relationships, investigators often have to analyze the suspect's network after consulting the information, and it is easy because the information is not A complete or flawed loss leads to the omission of important clues. Take the multi-person network diagram as an example. If the investigators know that Wang Xiaowei and Zhang Damin are in frequent contact with the informants, they have never cooperated in crimes in the past and have not served their sentences in the same prison. I have taken the two people and took the same flight information. When dealing with this problem in the traditional way, the investigation ^ needs to travel between the various databases. Cross-inputs obtain and compare the personal names of the data through other systems, and then use paper or pen or spreadsheets to find out the relevance. It is impossible to directly identify possible matches that may be related to the introduction of the third party, resulting in delays in handling the case. SUMMARY OF THE INVENTION The object of the present invention is to provide a method for constructing a network of interpersonal relationships, through a graphical display of data, which can fully present the basic relationship between the 5 1276978 14796 twf.d〇c/g family. = = includes information related to the information and shows that the database is substantially inconsistent with the database, in accordance with a preferred embodiment of the present invention, n_. Name includes; nickname r and check,. In the election =: multiple personnel, then = two; search brother to the direct relationship with the basic relationship before the line - search, including; = phase: person ==, the relationship between the relationship. Finally, the binary square is used and the results of the query are divided into graphs by ==,, meeting, gang, ^ times... the main reason is that after inputting the basic data, it can automatically go to the right side. Find the qualified information, and display the result in °: = Γ rendering = graph can present more than one relationship at the same time, and 'shaped data, & see the network relationship, so you can save the text of reading _, ', ' And without having to find each other's associations in each system, you can present the relevant gamma interpersonal network domains, to the time of the information. The above and other objects, features, and advantages of the present invention will become more apparent from the description of the appended claims. ,. [Embodiment] Please refer to the flowchart of a human network miscellaneous method in accordance with a preferred embodiment of the present invention. This - with interpersonal _ network construction, the method mainly includes obtaining the basic information of the basic relationship 11 〇, selecting the search scope 12G, searching the basic information related information (10) and displaying the information H〇. It searches for Fan H (4) library towels, and: Laiku has multiple silks. First, in the step of obtaining the basic information of the basic relationship, the basic = can include the name, ID number, check scale, corresponding time: two:::: find the match in the liai specified or related database Personal. The depth of the query refers to the number of data detection layers at the time of inquiry: the degree of veteran of all the persons to be inspected is the 0th floor, and the degree of seniority of the person directly related to the task-to-be-first is the first-level capital; the degree of seniority of the relevant person is the first The second floor, and so on. The number of people in each level is _, when the job is checked, and the complexity. Users can control the timing of the two parameters ===:: Yes - specify at least - the same system, see the original screen of all the systems = 22, respectively, on each screen, can be reduced by 1276978 14796twf.doc/g ^ In the search for basic poor material related information 130, when searching for multiple people directly related to the basic relationship person, the relevant search person is found as the basic relationship person, repeating the previous search step until reaching The depth of the query is up; and among the multiple people found by f, it is better to first remove the part that is duplicated with the previously found person before searching, so that the search process cannot be ended because of repeated searches. In addition, in the searched database, the information may include the people associated with the basic relationship and the relationship between those related and the basic people. /, Next, a brief description of the basic tree data algorithm for this job. ^ ί ^step' is set to the global variable glGbeY of the vertical axis, and its initial (four) step, the first person to be checked by the user is the root node of the left graph. In the second step, if the input person to be checked is not only the person, the person to be checked is poor to the right graph node, and the point is drawn according to the following method. The initial node is the right root node just set. Temple, if the node is the root node, two: Otherwise, set the X value to the X value of the parent node plus _, and the γ value is set to double check if there is a child node? If so, the child node. Re-set the γ value of this node to (the original node + gl〇beY)/2, and write the node according to the current green ratio. Then continue to check if there is a side node ^ - know this • right, add globeY 8 1276978 14796twf.doc / g ^, draw this side node. The virtual code attached to this algorithm is shown in the figure. Since more than one type of system is used in this operation, the binary value is used for the relationship value of the two people. After converting the relationship values of any two people into binary representations, if the value of the i-th bit is zero, then the two persons cannot find an association in the i-th system, and vice versa. For example, if the relationship between 曱 and B is 74, and the binary representation is (0100 1010) 2, it means 曱, and B appears in the same data in the second, fourth, and seventh systems. . After the completion of the inquiry, it will be described as XML building, and all the people will be saved in a data structure. Figure 3 shows the design structure of XML. Each person (<cibpers>)a<pkey> specifies a serial number and uses this serial number as the index label for subsequent processing. The tags <parent>, <flrstchild> and <say 1_> describe the location of the person in the number structure. <c〇ntact> describes all other personnel serial numbers and relationship values associated with this person. After the farm display, the search data content 140 can be expressed as a fan pattern (Fig. 4), an organization chart (Fig. 5), a connected path map (Fig. 6), etc. to display an individual or two main people based on multiple people. The connection between the two. The fan pattern is the simplest graphic method; the organization chart can clearly represent the system of each relationship; the connected path map is to directly connect the two nodes after judging whether the two nodes of the figure have common resources. The graphics depicted. The way to read it is that if any two of the poor people in the face are connected by one or more lines, it means that at least one system layer is found to be related to each other. In the face of the two groups of people and others 9 1276978 14796twf.doc / g If there is a link, all drawn in dark, because these people are the important relationship between the two root nodes. In summary, the method for constructing the human relationship network of the present invention can handle multiple systems in which different systems do not overlap each other, so that the user 1 can easily read the cumbersome text data without having to find each other's associations with each system. 'It is possible to fully present the interpersonal network graphs of all its relationship categories, saving a lot of time for collecting information. In addition, the use of graphics can clear more than one relationship, so it can be applied to criminal data, prisoners, guests, in and out, gang, reconnaissance, transfer and other systems to make up for the use of artificial knowledge. Cause unnecessary omissions such as omissions. Although the present invention has been disclosed in the above preferred embodiments, it is not intended to limit the invention, and those skilled in the art can make some modifications and refinements without departing from the scope of the invention. The scope of the invention is defined by the scope of the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a flow chart showing the operation of a human relationship network in accordance with a preferred embodiment of the present invention. 2 illustrates a virtual code of an algorithm in accordance with a preferred embodiment of the present invention. FIG. 3 illustrates an XML design example of a preferred embodiment of the present invention. Figure 4% shows a fan pattern of a preferred embodiment of the present invention. Figure 5 is a diagram showing the organization of a preferred embodiment of the present invention. Figure 6A shows a connected path diagram of a preferred embodiment of the present invention. [Description of main component symbols] 110: Basic information about people who have obtained basic relationships 1276978 14796twf.doc/g 120 : Selected search range 130 : Search basic information related information 140 : Display search data content
1111