KR101780581B1 - Method and apparatus for managing user's information exposed on online - Google Patents
Method and apparatus for managing user's information exposed on online Download PDFInfo
- Publication number
- KR101780581B1 KR101780581B1 KR1020160011216A KR20160011216A KR101780581B1 KR 101780581 B1 KR101780581 B1 KR 101780581B1 KR 1020160011216 A KR1020160011216 A KR 1020160011216A KR 20160011216 A KR20160011216 A KR 20160011216A KR 101780581 B1 KR101780581 B1 KR 101780581B1
- Authority
- KR
- South Korea
- Prior art keywords
- keyword
- user
- personal information
- links
- keywords
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
- G06F21/6263—Protecting personal data, e.g. for financial or medical purposes during internet communication, e.g. revealing personal data from cookies
-
- G06F17/30864—
-
- G06F17/30882—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Medical Informatics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The user's personal information of the user stored in advance is called in response to the information collection request of the user and the keyword is searched for the personal information of the user exposed on the online based on the personal information, There is provided a method and apparatus for managing information of a user collecting related links and providing the information to a user.
Description
The following embodiments relate to a method and apparatus for managing information of a user exposed on-line.
As the number of Internet users increases, leakage and infringement of personal information are increasing day by day. In order to minimize the leakage and infringement of such personal information, it is important to delete the personal information remaining on-line.
In general, it is difficult to know easily where user's personal information is exposed. Exceptionally, when using Google search, the user's personal information may be exposed, but in this case, it is inconvenient that the personal information is only exposed through the user's direct search. In addition, it is not easy to distinguish whether a site is a dangerous site because it provides only the URL of the user's personal information. Further, in the case of personal information, there is an inconvenience that it takes much time to delete the personal information because it is necessary to request deletion from the site manager after locating the site.
According to one embodiment, based on personal information input by a user, links including personal information of a user can be automatically searched without being in conflict with the personal information protection law.
According to one embodiment, the retrieved links may be reordered based on the risk of the retrieved links and the accuracy of the links.
According to an exemplary embodiment, links including personal information of a user are collected and analyzed through Web crawling, and links can be provided to the user for deletion, thereby preventing leakage of personal information.
According to one aspect of the present invention, a method of managing information of a user includes the steps of: calling a user's personal information that is stored in advance in response to a user's information collection request; Combining the keyword to be searched for personal information of the user exposed on-line based on the personal information; Collecting links related to the personal information based on the combined keywords; And providing the user with at least some of the collected links based on the accuracy of the collected links.
The combining of the keywords may include extracting a plurality of keywords from the called personal information; Based on the extracted keywords,
Generating a plurality of keyword combinations; And storing the keyword combinations.The collecting of the links associated with the personal information may include performing a search based on the combined keyword; Storing the combined keyword and the retrieved link if the search result exists; And determining accuracy of the retrieved link based on the accuracy corresponding to the combined keyword.
The step of collecting links related to the personal information may include extracting contents included in a site corresponding to the links retrieved based on the combined keyword; Determining whether a keyword similar to at least one keyword in the combined keyword exists among the extracted contents; Collecting the similar keyword and the retrieved link based on the determination result; And determining accuracy of the retrieved link based on the accuracy corresponding to the combined keyword.
The step of collecting the links related to the personal information may include performing an additional search using the search keyword using the search keyword when the search result exists in the search result. The combining of the keywords may include: modifying the combined keywords; And performing an additional search with the changed keyword.
According to one aspect of the present invention, a method of managing information of a user includes the steps of: calling a user's personal information that is stored in advance in response to a user's information collection request; Combining keywords to be used for searching personal information of the user exposed on-line using the personal information and a genetic algorithm; Collecting links associated with the personal information using the combined keyword and genetic algorithm; And providing the collected links to the user.
The step of invoking the user's personal information may include invoking relationships between the user's personal information and the user's personal information from a database using a multi-query.
The combining of the keywords may include extracting at least one keyword from the called personal information; Combining the extracted keywords; And storing the extracted keyword and the combined keyword.
Wherein the storing comprises: determining a key value for the extracted keyword and an accuracy value for the combined keyword; And storing the extracted keyword, the type of the extracted keyword, the key value, and the accuracy value in a tree data structure.
The method of managing information of the user may further include deleting redundant or unnecessary keywords from the tree data structure.
The deleting step further includes deleting, from the tree data structure, a key value corresponding to a duplicated keyword among the combined keywords and a key value corresponding to an unnecessary keyword that is not searched in links related to the user information can do.
The method of managing information of a user may include receiving at least one keyword related to personal information of the user; And combining the input keywords.
The step of collecting the links related to the personal information may include extracting neighboring contents included in the site corresponding to the links related to the personal information using the combined keyword; Determining whether the extracted contents are similar to personal information of the user; And collecting links related to the personal information based on the determination result.
The collecting of the links may further include updating the keyword to be searched based on the extracted neighboring contents if the extracted contents are similar to the user's personal information as a result of the determination.
The step of updating the keyword to be searched may include storing the keyword related to the extracted contents in a tree data structure.
Wherein providing to the user comprises reordering the collected links based on at least one of an accuracy of the collected links and a risk of the collected links; And providing the reordered links to the user.
According to one aspect, an apparatus for managing user information includes a memory for storing user's personal information; And a processor for combining the keywords to be retrieved with the personal information of the user exposed on-line, collecting links related to the personal information using the combined keyword, and providing the collected information to the user. The processor may combine the keywords or collect the links based on a genetic algorithm.
The processor may reorder the collected links based on at least one of the accuracy of the collected links and the risk of the collected links, and provide the reordered links to the user.
The processor may extract at least one keyword from the called personal information, combine the extracted keywords, and store the extracted keyword and the combined keyword.
According to one embodiment, based on personal information input by a user, links including personal information of a user can be automatically searched without being in conflict with the personal information protection law.
According to one embodiment, the retrieved links can be rearranged based on the risk of the retrieved links and the accuracy of the links, thereby allowing the user to easily determine whether or not to delete the personal information exposed on the link.
BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram of a system for managing user information according to an embodiment; Fig.
2 is a flow diagram illustrating a method for managing information of a user according to one embodiment.
3 is a flow diagram illustrating a method of combining keywords in accordance with one embodiment.
4 illustrates program coding of an nCn keyword combination algorithm according to one embodiment;
FIG. 5 is a diagram for explaining a genetic algorithm according to an embodiment; FIG.
6 is a flow diagram illustrating a method of collecting links in accordance with one embodiment;
7 illustrates program coding of a search scratch algorithm for collecting links according to one embodiment;
Figure 8 illustrates program coding of a link extraction algorithm for collecting links according to one embodiment;
9 is a flow diagram illustrating a method for providing collected links in accordance with one embodiment.
10 is a flowchart illustrating a method for managing information of a user according to another embodiment;
11 is a diagram for explaining a process until a link re-arranged according to a user's information collection request according to an embodiment is provided to a user.
12 is a diagram for explaining a method for a user to modify personal information according to an embodiment;
13 is a diagram illustrating a method by which a user transmits a comment on a searched link according to an embodiment;
FIGS. 14 through 15 illustrate screens provided to a user terminal according to a method of managing information of a user according to an exemplary embodiment; FIG.
16 is a block diagram of an apparatus for managing information of a user according to an embodiment;
Specific structural or functional descriptions of embodiments are set forth for illustration purposes only and may be embodied with various changes and modifications. Accordingly, the embodiments are not intended to be limited to the particular forms disclosed, and the scope of the disclosure includes changes, equivalents, or alternatives included in the technical idea.
The terms first or second, etc. may be used to describe various elements, but such terms should be interpreted solely for the purpose of distinguishing one element from another. For example, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component.
It is to be understood that when an element is referred to as being "connected" to another element, it may be directly connected or connected to the other element, although other elements may be present in between.
The singular expressions include plural expressions unless the context clearly dictates otherwise. In this specification, the terms "comprises ", or" having ", and the like, are used to specify one or more of the described features, numbers, steps, operations, elements, But do not preclude the presence or addition of steps, operations, elements, parts, or combinations thereof.
Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art. Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the meaning of the context in the relevant art and, unless explicitly defined herein, are to be interpreted as ideal or overly formal Do not.
Embodiments may be implemented in various forms of products, such as personal computers, laptop computers, tablet computers, smart phones, televisions, smart home appliances, intelligent cars, kiosks, wearable devices, For example, embodiments may be applied to authenticating users in smart phones, mobile devices, smart home systems, and the like. Hereinafter, embodiments will be described in detail with reference to the accompanying drawings. Like reference symbols in the drawings denote like elements.
1 is a block diagram of a system for managing user information according to an exemplary embodiment of the present invention. Referring to FIG. 1, a system for managing information of a user according to an embodiment may include a
The
The
The
The
The personal information created at the time of member registration can be stored in the
The
The
In order to solve such a problem, in one embodiment, the member keyword table linked to the member table can be linked to the member keyword category table using a foreign key called 'member_keyword_category_number'.
The member table includes information such as, for example, a member number, a member e-mail address, and a member password, and the member keyword table may include, for example, a member keyword number, a member number, .
The member keyword category table is a table that substantially manages user's personal information, and may include, for example, a member keyword category number, a member keyword type, a member keyword content, and the like. In one embodiment, a data type called a member keyword type is separately configured for dynamic management.
The
Depending on the embodiment, the
An example of a screen provided to the
2 is a flowchart illustrating a method of managing information of a user according to an exemplary embodiment of the present invention. Referring to FIG. 2, the management apparatus according to an exemplary embodiment of the present invention invokes a pre-stored user's personal information in response to a user's information collection request (210). The management apparatus can store, for example, personal information of a user that has been collected in advance from a user through member registration or the like, in a database. The management apparatus can use the multi-query to invoke relations between the user's personal information and the user's personal information from the database.
Based on the personal information called in
Based on the combined keyword, the management apparatus collects links related to the personal information (230). In one example, the management device may use the combined keyword and genetic algorithm to collect links associated with personal information. The genetic algorithm will be described with reference to FIG. The manner in which the management device collects links is described with reference to Figs.
The management device provides the collected links to the user (240). The manner in which the management device provides the collected links to the user is described with reference to FIG.
3 is a flowchart illustrating a method of combining keywords according to an embodiment. Referring to FIG. 3, the management apparatus according to an exemplary embodiment may extract at least one keyword from the called personal information (310).
The management device may combine the extracted keywords in step 310 (320). The management apparatus can combine the keywords using, for example, the nCn keyword combination algorithm shown in FIG. The management apparatus can combine the keywords according to whether or not the extracted keywords can be combined. Whether or not the extracted keywords can be combined can be determined by, for example, whether the extracted keywords are duplicated keywords or whether the extracted keywords are not searched. The management device may store the extracted keywords in
The management device may determine a key value for the extracted keyword in
The management device can store the extracted keywords, the types of the extracted keywords, the key values, and the accuracy values using the tree data structure (340). The tree data structure may be, for example, a red-black tree. A red black tree is a tree method for balancing an unbalanced tree, and two additional fields can be added that need to distinguish colors from a normal binary tree. A binary search tree containing a red-black tree is a tree that, for all nodes, has the property that 'the data it owns is less than or equal to all the data that the subtree on the right of itself has, Is greater than or equal to '. Because of this nature, if you use a tree data structure, you can quickly find a specific value.
The management device may delete redundant or unnecessary keywords from the tree data structure. The management apparatus deletes from the tree data structure a key value corresponding to the redundant keyword and a key value corresponding to the unnecessary keyword not retrieved from the links related to the personal information from among the combined keywords, for example, Or delete unnecessary keywords.
4 is a diagram showing program coding of an nCn keyword combination algorithm according to an embodiment.
The keyword combination algorithm according to an exemplary embodiment may generate all combinations of keywords related to the user's personal information from the user's personal information stored in the database. If the number of keywords is n, the nCn keyword combination algorithm is nC1 + nC2 + nC3 + ... + nCn keywords can be created.
For example, when the keywords are three (A, B, C), the management apparatus can generate 3C1 + 3C2 + 3C3 = 3 + 3 + 1 = 7 combined keywords by the keyword combination algorithm. Therefore, when the number of keywords is n, the total number of combined keywords may be 2 n - 1.
The program coding shown in FIG. 4 starts from the getcombination method of the second line, and the input data structure is a data structure including the keyword and the accuracy of the keyword as a keywordDTO. At this time, the keyword DTO is stored in a form of a list, and may be a combination of a total number of keywords.
The print method on the first line stores the combined keyword, for example, if the size of the combined keyword is zero, it stores the temporary variable temp. The print method has no return value, because static values are used to share return values within the class.
5 is a diagram for explaining a genetic algorithm according to an embodiment. Referring to FIG. 5, a numerical code showing a genetic algorithm is shown. Genetic algorithms are one of the techniques to solve the optimization problem as a calculation model based on the natural world.
Genetic algorithms, for example, are able to satisfy the conditions of the best solution through repeated iterations, such as making optimal gene combinations through generations through crossover, mutation, etc. It is possible to derive a possible result.
6 is a flow diagram illustrating a method of collecting links in accordance with one embodiment. Referring to FIG. 6, the management apparatus can extract contents included in (in the page of) the site corresponding to the retrieved links based on the combined keyword (610). For example, the management apparatus can extract the content included in (in the page of) the site corresponding to the links related to the personal information by using the combined keyword.
The management apparatus can extract contents included in the site using, for example, a search scratch algorithm.
The search scratch algorithm can scratch the html page. Here, 'scratch' refers to bringing all the contents on the page. The retrieval scratch algorithm can retrieve all the contents of the page by using the combined keyword and the extracted link using the regular expression. The search scratch algorithm will be described with reference to FIG.
The management device may determine whether the extracted contents in
As a result of the determination in
The management apparatus may extract and store a link corresponding to the keyword related to the extracted peripheral contents (640). The management device can extract the link from the scratch html page, for example, using a link extraction algorithm. The management apparatus can extract a link among the values obtained through the regular expression using API (Application Programming Interface) such as Compile (), matcher (), and the like, and store the extracted link. The link extraction algorithm will be described with reference to FIG.
The management apparatus collects information in the tags in the page of the link (s) related to the user's personal information through the above-described method, and arranges the collected information to provide only a part of links to the user.
7 is a diagram illustrating program coding of a search scratch algorithm for collecting links in accordance with one embodiment. Referring to FIG. 7, the search scratch algorithm may use an API such as Execute () which receives an HttpGet object and stores it in an HttpResponse, or HttpClient or HttpResponse that performs Http communication. The search scratch algorithm uses the httpGet class to pass to the constructor the address to look for as a parameter value. The search scratch algorithm can create a StringBuilder class and store the scratched source line by line through the while statement.
8 is a diagram illustrating program coding of a link extraction algorithm for collecting links in accordance with one embodiment. The link extraction algorithm shown in FIG. 8 can scratch the entire page through a search engine, for example, zum.com. The link extraction algorithm takes a link beginning with href into a Java regular expression pattern, and excludes links beginning with #. The link extraction algorithm can only output the result of removing unnecessary pages such as advertisement page, starting unconditionally with http.
9 is a flow diagram illustrating a method of providing collected links in accordance with one embodiment. Referring to FIG. 9, a management device according to one embodiment may reorder 910 collected links based on at least one of the accuracy of the collected links and the risk of collected links. Here, the risk of the collected links can be determined, for example, according to whether or not the link is a reported link that is generally associated with gambling, corruption, According to an embodiment, the management device may rearrange the collected links in order of frequency of exposure of the personal information.
The management device may provide the reordered links to the user (920).
10 is a flowchart illustrating a method of managing information of a user according to another embodiment.
Referring to FIG. 10, the management apparatus according to an exemplary embodiment may retrieve personal information from the
The management apparatus can store the generated keyword combination as a search keyword (1007). In addition, the management apparatus can calculate the accuracy of the search keyword and store it together (1009). The accuracy of the search keyword may be initialized to a predetermined value (e.g., 1). As will be described in detail below, the accuracy of the search keyword affects the accuracy of the link searched by the search keyword, and the accuracy of the searched link can be increased or decreased based on the accuracy of the search keyword according to a predetermined method.
The management apparatus can determine whether there is a keyword to be combined (1011). If it is determined in
The management apparatus can perform the search using the stored search keyword in step 1009 (1013). The management apparatus can determine whether there is a search result of the keyword (1015). If it is determined in
If it is determined in
The management apparatus extracts contents included in the site using the information stored in the red black tree structure (1023), and compares the extracted contents with the personal information received from the database (1001) (1025).
Based on the comparison result in
If it is determined that the content extracted in
If it is determined that the content extracted in
The management device may also store similar keywords and the accuracy of the keywords in a database for the next generation of keyword combinations. The accuracy of the keyword may be determined by multiplying the accuracy of the search keyword by two. The database can be used when performing the
The management apparatus can determine whether the peripheral content search result added in
If it is determined in
If it is determined in
Through the above-described processes, a population of one generation can be completed. The management device may determine whether the intergenerational accuracy has continuously fallen (1039). For example, the accuracy of one generation may be the accuracy of the last chromosome of that generation. Alternatively, the accuracy of one generation may be the highest within that generation. The management apparatus can determine whether the inter-generation accuracy is continuously decreased for a predetermined number (e.g., 3). If it is determined in
If it is determined in
FIG. 11 is a diagram for explaining a process until a re-arranged link is provided to a user by a user's information collection request according to an embodiment. 11, the
Upon receiving the information collection request, the
The
The
Depending on the embodiment, the
12 is a diagram for explaining a method for a user to modify personal information according to an embodiment. Referring to FIG. 12, the
In response to the inquiry of
The
The
13 is a diagram for explaining a method for transmitting a comment on a link searched by a user according to an embodiment. Referring to FIG. 13, the
The created article is stored in the
FIGS. 14 through 15 are views illustrating screens provided to a user terminal according to a method of managing information of a user according to an embodiment.
14, an information
Referring to FIG. 15, a
16 is a block diagram of an apparatus for managing information of a user according to an embodiment. Referring to FIG. 16, an apparatus (hereinafter referred to as a 'management apparatus') for managing user information according to an embodiment includes a
The
The
The
The
The embodiments described above may be implemented in hardware components, software components, and / or a combination of hardware components and software components. For example, the devices, methods, and components described in the embodiments may be implemented within a computer system, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, such as an array, a programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.
The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be in the form of any type of machine, component, physical device, virtual equipment, computer storage media, or device , Or may be permanently or temporarily embodied in a transmitted signal wave. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.
The method according to an embodiment may be implemented in the form of a program command that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.
Although the embodiments have been described with reference to the drawings, various technical modifications and variations may be applied to those skilled in the art. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced.
Claims (5)
Combining the keyword to be searched for personal information of the user exposed on-line based on the personal information;
Collecting links related to the personal information based on the combined keywords; And
Providing at least some of the collected links to the user based on the accuracy of the collected links
Lt; / RTI >
The step of combining the keywords
Extracting a plurality of keywords from the called personal information;
Based on the extracted keywords, Generating a plurality of keyword combinations; And
Storing the keyword combinations
The method comprising the steps of:
The step of collecting links associated with the personal information
Performing a search based on the combined keyword;
Storing the combined keyword and the retrieved link if the search result exists; And
Determining an accuracy of the retrieved link based on the accuracy corresponding to the combined keyword
The method comprising the steps of:
Combining the keyword to be searched for personal information of the user exposed on-line based on the personal information;
Collecting links related to the personal information based on the combined keywords; And
Providing at least some of the collected links to the user based on the accuracy of the collected links
Lt; / RTI >
The step of collecting links associated with the personal information
Extracting contents included in a site corresponding to a searched link based on the combined keyword;
Determining whether a keyword similar to at least one keyword in the combined keyword exists among the extracted contents;
Collecting the similar keyword and the retrieved link based on the determination result; And
Determining an accuracy of the retrieved link based on the accuracy corresponding to the combined keyword
The method comprising the steps of:
Combining the keyword to be searched for personal information of the user exposed on-line based on the personal information;
Collecting links related to the personal information based on the combined keywords; And
Providing at least some of the collected links to the user based on the accuracy of the collected links
Lt; / RTI >
The step of collecting links associated with the personal information
If there is a search result in the search result, performing an additional search with the keyword using the search field
Lt; / RTI >
The step of combining the keywords
Modifying the combined keyword; And
Performing an additional search with the changed keyword
The method comprising the steps of:
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020160011216A KR101780581B1 (en) | 2016-01-29 | 2016-01-29 | Method and apparatus for managing user's information exposed on online |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020160011216A KR101780581B1 (en) | 2016-01-29 | 2016-01-29 | Method and apparatus for managing user's information exposed on online |
Publications (2)
Publication Number | Publication Date |
---|---|
KR20170090633A KR20170090633A (en) | 2017-08-08 |
KR101780581B1 true KR101780581B1 (en) | 2017-09-21 |
Family
ID=59653196
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
KR1020160011216A KR101780581B1 (en) | 2016-01-29 | 2016-01-29 | Method and apparatus for managing user's information exposed on online |
Country Status (1)
Country | Link |
---|---|
KR (1) | KR101780581B1 (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20230053344A1 (en) * | 2020-02-21 | 2023-02-23 | Nec Corporation | Scenario generation apparatus, scenario generation method, and computer-readablerecording medium |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101176317B1 (en) * | 2011-08-23 | 2012-08-23 | 김봉근 | Searched information arrangement method with correlation between search query and searched information |
-
2016
- 2016-01-29 KR KR1020160011216A patent/KR101780581B1/en active IP Right Grant
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101176317B1 (en) * | 2011-08-23 | 2012-08-23 | 김봉근 | Searched information arrangement method with correlation between search query and searched information |
Also Published As
Publication number | Publication date |
---|---|
KR20170090633A (en) | 2017-08-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11928596B2 (en) | Platform management of integrated access of public and privately-accessible datasets utilizing federated query generation and query schema rewriting optimization | |
US7676453B2 (en) | Partial query caching | |
Lin et al. | Website reorganization using an ant colony system | |
US20160092591A1 (en) | Clustering repetitive structure of asynchronous web application content | |
US20080270549A1 (en) | Extracting link spam using random walks and spam seeds | |
CN104516910A (en) | Method and system for recommending content in client-side server environment | |
JP2009099124A (en) | Method and system for data construction | |
CA2805870C (en) | Systems and methods for generating issue libraries within a document corpus | |
CN111400504A (en) | Method and device for identifying enterprise key people | |
CN105760443A (en) | Project recommending system, device and method | |
US20220171874A1 (en) | Apparatuses, methods, and computer program products for privacy-preserving personalized data searching and privacy-preserving personalized data search training | |
CN110162711A (en) | A kind of resource intelligent recommended method and system based on internet startup disk method | |
Robu et al. | Mining frequent patterns in data using apriori and eclat: A comparison of the algorithm performance and association rule generation | |
KR101683138B1 (en) | Apparatus for searching information, and control method thereof | |
Consoli et al. | A quartet method based on variable neighborhood search for biomedical literature extraction and clustering | |
Bei et al. | Non-recursive cluster-scale graph interacted model for click-through rate prediction | |
CN109614521A (en) | A kind of efficient secret protection subgraph inquiry processing method | |
KR101780581B1 (en) | Method and apparatus for managing user's information exposed on online | |
US20150358165A1 (en) | Method and arrangement for distributed realisation of token set management and recommendation system with clustering | |
Dong et al. | Select actionable positive or negative sequential patterns | |
Singh et al. | Nonreplicated static data allocation in distributed databases using biogeography-based optimization | |
Yin et al. | Shortest paths based web service selection in internet of things | |
Chen et al. | Reinforcement Re-ranking with 2D Grid-based Recommendation Panels | |
JP5555238B2 (en) | Information processing apparatus and program for Bayesian network structure learning | |
Zhou et al. | Incremental association rule mining based on matrix compression for edge computing |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A201 | Request for examination | ||
E902 | Notification of reason for refusal | ||
E701 | Decision to grant or registration of patent right |