EP1301872A2 - Procede pour comparer des profils de recherche - Google Patents

Procede pour comparer des profils de recherche

Info

Publication number
EP1301872A2
EP1301872A2 EP01956301A EP01956301A EP1301872A2 EP 1301872 A2 EP1301872 A2 EP 1301872A2 EP 01956301 A EP01956301 A EP 01956301A EP 01956301 A EP01956301 A EP 01956301A EP 1301872 A2 EP1301872 A2 EP 1301872A2
Authority
EP
European Patent Office
Prior art keywords
comparison
data fields
value
offer
agent
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.)
Ceased
Application number
EP01956301A
Other languages
German (de)
English (en)
Inventor
Daniel Veit
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.)
Siemens AG
Original Assignee
Siemens AG
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 Siemens AG filed Critical Siemens AG
Publication of EP1301872A2 publication Critical patent/EP1301872A2/fr
Ceased legal-status Critical Current

Links

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/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9535—Search customisation based on user profiles and personalisation

Definitions

  • a search profile given to a user is compared with a reference profile stored in a database.
  • the profiles are each divided into a certain number of data fields in which the information to be compared is stored.
  • Each profile has at least two different types of data fields.
  • the profiles to be compared each include the same types of data fields.
  • the at least two different types of data fields are compared with different comparison functions and the respective comparison is evaluated with a preliminary comparison value.
  • a final comparison value is calculated from the preliminary comparison values.
  • the method according to the invention thus compares profiles structured into individual data fields.
  • different comparison functions are used for the different types of data fields, with which preliminary comparison values are calculated.
  • a final comparison value is calculated from the preliminary comparison values.
  • the invention thus compares the individual data fields in a type-specific manner and the results of the individual comparisons, that is to say the preliminary comparison values, are combined to form a final comparison value.
  • the method according to the invention can very advantageously be integrated into an agent system.
  • This agent system comprises at least three types of agents, namely a search agent, an offer agent and a comparison agent which, when requested by the search agent, compares and evaluates the profiles stored in the search agents and offer agents.
  • the agent system is preferably an open agent system, which means that further agents, in particular offer agents, can be added.
  • the agents are preferably mobile agents, that is to say that they can be active in different places in a computer network and can change their location in the computer network.
  • 5b shows two data records which are derived from the free texts shown in FIG. 4a
  • FIG. 8 shows a network for connecting computers on which the agent system from FIG. 6 is installed in a block diagram.
  • a search profile is compared with an offer profile stored in a database.
  • 2 shows a profile description of an exemplary embodiment of the invention.
  • This profile description comprises eight data fields, of which the name of the respective data field is given in the left column in FIG. 2, the variable character of the data field in the middle column and a brief description of the data field in the right column.
  • an automatic comparison process differentiates between an offer profile and a search profile.
  • the profile description of the offer profile and the search profile match in structure. They differ only in the content of their profile type data field, in which the information on whether it is an offer profile or a search profile is stored.
  • the data field profile type t is a boolean data field, the content of which can be either 0 or 1.
  • the other data fields are the title, the keywords, the exact description, the costs, dates, duration and the participants.
  • the title data field contains a brief description of the service offered or sought in the form of a so-called verb-noun expression.
  • a sentence is an unordered collection of elements of the same type, such as words, real numbers, integers or the like.
  • the variable of a sentence is shown between two curly braces.
  • the exact description data field includes a free text that describes the service offered or sought.
  • the data field Cost contains information about the minimum or maximum expected costs.
  • the cost data field therefore represents an interval.
  • Duration data field the length of time that is required to carry out the service offered is specified.
  • the Participants data field contains a list of the names of the participants who offer or are to offer the service.
  • a list is shown in the form of a superscript plus sign.
  • the expression in brackets [1: 2] means that each list element is composed of two individual elements, namely the first and last name.
  • the data field% ⁇ [1: 2] + and the data field ( ⁇ i) are complex variables which are explained in more detail below.
  • FIG. 3 shows the structure of the profile description from FIG. 2.
  • the profile description is divided into three levels (level 0, level 1 and level 2).
  • Level 2 is the highest level in which the data fields shown in FIG. 2 are arranged.
  • the complex data fields ⁇ and ⁇ 8 [1: 2] + each refer to further data fields, which are represented by corresponding variables in the level below.
  • the complex variable ⁇ i thus relates to the list of keywords stored in level 1.
  • the complex data field x 8 [l: 2] + the participant refers to a list of further data fields.
  • the elements of this list are field arrangements [1: 2], each comprising two names, the first and last name.
  • a field arrangement comprises a certain number of elements of the same type.
  • the field arrangements x 8 [1: 2] thus refer to further data fields, which are arranged in level 0 and each have a word entry, namely the first name or the last name. Two such data fields x 8 are combined to form such a field arrangement.
  • the data fields that refer to other data fields in a subordinate level are called complex data fields.
  • the remaining data fields are basic data fields.
  • the information of the respective profile is stored in the basic data fields.
  • several basic data fields in the form of records, lists, field arrangements or registers (record) are combined into one
  • Field arrangement projected at the highest level Similar to field arrangements, registers are formed from successive elements of a predetermined number, which in turn can consist of different types.
  • level 2 the top level
  • Column 1 shows a list of the basic data fields.
  • Column 1 shows the variable names of the basic data fields Xi to x 8 .
  • the middle column contains the names of the corresponding basic data fields and the right column contains a brief description of the content.
  • step S2 all data fields x 8 [1: 2] are provided with a preliminary comparison value.
  • step S3 the preliminary comparison values assigned to the names are evaluated. This is usually done by weighted averaging. Since the elements to be compared are each of the same type, they are equivalent and are therefore all weighted with 1. An average of the values entered in the complex data fields x 8 [1: 2] is thus formed. This mean value is a preliminary comparison value of the second order, which is entered in level 2 in the complex data field of the list of names t 8 [1: 2] + .
  • the data fields Xi of the search profile containing the keywords are compared with the corresponding data fields of the offer profile.
  • the comparison function for comparing the keywords is designed such that each keyword of the search profile is compared with each keyword of the offer profile and if a keyword of the search profile is not among the
  • Keywords of the offer profile is included, the value 1 is saved. Otherwise the value 1 is saved.
  • the mean value of these values is calculated and entered in the data field of the list of key words ⁇ Xi ⁇ .
  • step S5 the contents of the data fields title x 2 , exact description x 3 , costs x 5 , dates x 6 , and duration x 7 are compared with one another.
  • the comparison function for comparing titles x 2 is a common comparison function for comparing verb-noun expressions.
  • the comparison function for comparing the data field exact description x 3 is a comparison function for comparing free texts.
  • 5a shows two examples of free texts di, d 2 , each of which contains a text in the English language u. These free texts are first transformed into data records DSi and DS 2 , in which all words from the free texts that are not stop words are adopted. Stop words are words that have little information content. There are lists with the usual stop words. In the present case, the following words are assessed as stop words:
  • idfj inverse document frequency
  • N is the total number of documents and df j is the number of documents that contain the word j.
  • each free text represents a document.
  • the frequency tf ⁇ , j of the words j in the documents i is also taken into account.
  • the weighting factor ⁇ , j is the product of the frequency tf ⁇ , j and the inverse document frequency idfj
  • the weighting factors W ⁇ , j and w 2fj each form elements of document vectors DVi and DV 2 .
  • the distance between the corresponding document vectors DV L and DV 2 is calculated.
  • the distance between the two vectors is calculated as the Euclidean distance according to the following formula:
  • the Euclidean norm fulfills all requirements for a metric distance: - The distance between two identical vectors is 0. The distance from a first vector to a second vector is equal to the distance from the second vector to the first vector. That means the distance calculation is symmetrical. - The distance from a first vector to a third
  • Vector is less than the sum of the distances from the first vector to a second vector and from the second vector to the third vector.
  • the comparison function for comparing the data fields containing the costs is a comparison function for comparing intervals.
  • no numbers are compared, which is why no corresponding comparison function is used for the comparison.
  • Such a comparison function can be implemented very simply, for example, by determining the absolute value of the difference between the numbers to be compared.
  • step S5 The preliminary comparison values determined when comparing the data fields x 2 , x 3 , x 5 , X ⁇ and x are stored. This concludes step S5.
  • step S6 the individual preliminary comparison values for the data fields Xi to x 8 of level 2 are used to calculate a final comparison value.
  • a weighted average is calculated here, the individual data fields being weighted differently depending on their importance.
  • the result of this weighted averaging is a distance value that specifies the distance between the two profiles to be compared, the search profile and the offer profile.
  • step S7 Since, as a rule, a similarity value and no distance value is desired, the reciprocal of the distance value is formed (step S7). This similarity value represents the final comparison value. This comparison value is output in step S8. The method is ended in step S9.
  • the final comparison value can be used to sort the corresponding offer profile in a list of offer profiles according to the calculated similarity to the search profile.
  • the method according to the invention described above is carried out for each offer profile, the individual offer profiles are sorted with decreasing similarity with respect to the search profile and the most similar offer profiles are output to the user as a result.
  • the method according to the invention can be implemented as a computer program for the automatic comparison of profiles.
  • a particularly advantageous implementation of the method according to the invention is in the form of an agent system.
  • Agents are autonomous, cooperative software units that consist of code and data. They are software units that function independently and do not require constant interaction with the user. There are both stationary and mobile agents.
  • Mobile agents are e.g. known from US 5,603,031. Mobile agents are programs that can be active in different places on a computer network and can change their location in the computer network.
  • a comparison agent a search agent and an offer agent are used here.
  • the comparison agent contains a database in which the offer agents known to him are stored with their respective offer profiles.
  • the offer agents can enter their offer profile in the corresponding database or delete this offer profile if they no longer maintain the corresponding offer.
  • a search agent who is looking for a specific service turns to a comparison agent and sends a search query to the comparison agent.
  • the search query contains a corresponding search profile.
  • the comparison agent compares this search profile with the data stored in its database. bot profiles and evaluates them according to the procedure described above. It transmits a corresponding search response to the search agent, which contains a list with the names of the relevant offer agents, each offer agent being rated with a comparison value.
  • the search agent can either forward the search response to its original client or send a request for delivery of the corresponding service to the offer agent to whom the best comparison value is assigned.
  • the service can then be provided by the offer agent to the search agent, who forwards it to his client.
  • Fig. 1 shows schematically simplified a network in which such an agent system is implemented.
  • the network has a number of computers 1 which are connected to one another via data lines 2.
  • An agent system AG is installed on each computer 1.
  • In the network there are some mobile agents AG-I to AG-IV, which are either arranged on one of the computers 1 or move from one computer to another.
  • Each agent system has an agent platform that includes utilities that an agent needs in order to be able to be executed on the respective computer 1.
  • Agents AG-I are offer agents and agents AG-II are search agents.
  • Agent AG-III is a comparison agent.
  • the offer profiles of the offer agents AG-I are stored in the comparison agent AG-III.
  • a search agent AG-II can make a search request to the comparison agent AG-III, which the latter answers with a corresponding search response.
  • the search agents can then process the search response in the correspondingly predetermined manner and, in particular, can forward it to the user who is operating a computer in the network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention concerne un procédé pour comparer automatiquement des profils de recherche. Selon ce procédé, un profil de recherche est comparé à un ou plusieurs profils d'offre, enregistrés dans une base de données. Les profils individuels sont subdivisés en champs de données, dans lesquels sont enregistrées les informations devant être comparées. Chaque profil comprend différents types de champs de données, mais les profils individuels possèdent la même structure. Lors de la comparaison d'un profil de recherche avec un profil d'offre, au moins deux types différents de champs de données sont comparés à l'aide de différentes fonctions de comparaison. Une valeur de comparaison finale est alors calculée à partir des valeurs de comparaison préalablement déterminées. Selon ce procédé, différentes fonctions de comparaison sont appliquées aux différents types de champs de données, ce qui permet une comparaison sensiblement plus individuelle des informations individuelles qu'avec les procédés classiques.
EP01956301A 2000-07-17 2001-06-29 Procede pour comparer des profils de recherche Ceased EP1301872A2 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10034694A DE10034694B4 (de) 2000-07-17 2000-07-17 Verfahren zum Vergleichen von Suchprofilen sowie dessen Verwendung
DE10034694 2000-07-17
PCT/DE2001/002407 WO2002006974A2 (fr) 2000-07-17 2001-06-29 Procede pour comparer des profils de recherche

Publications (1)

Publication Number Publication Date
EP1301872A2 true EP1301872A2 (fr) 2003-04-16

Family

ID=7649194

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01956301A Ceased EP1301872A2 (fr) 2000-07-17 2001-06-29 Procede pour comparer des profils de recherche

Country Status (6)

Country Link
US (1) US7831602B2 (fr)
EP (1) EP1301872A2 (fr)
JP (1) JP4868484B2 (fr)
CN (1) CN1304991C (fr)
DE (1) DE10034694B4 (fr)
WO (1) WO2002006974A2 (fr)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040148274A1 (en) * 1999-10-15 2004-07-29 Warnock Christopher M. Method and apparatus for improved information transactions
US7536561B2 (en) * 1999-10-15 2009-05-19 Ebrary, Inc. Method and apparatus for improved information transactions
US8311946B1 (en) 1999-10-15 2012-11-13 Ebrary Method and apparatus for improved information transactions
DE10339466B3 (de) * 2003-08-27 2005-02-17 Siemens Ag Verfahren sowie Computerprogramm mit Programmcode-Mitteln und Computerprogramm-Produkt zum Austauschen von Daten
US7840564B2 (en) 2005-02-16 2010-11-23 Ebrary System and method for automatic anthology creation using document aspects
US7433869B2 (en) * 2005-07-01 2008-10-07 Ebrary, Inc. Method and apparatus for document clustering and document sketching
DE102006021540A1 (de) * 2006-05-08 2007-11-15 Abb Technology Ag System und Verfahren zum mengenbezogenem Vergleich zwischen Planungs- und Vorgabedaten eines technischen Prozesses oder eines technischen Projektes
US20080208847A1 (en) * 2007-02-26 2008-08-28 Fabian Moerchen Relevance ranking for document retrieval
US8874545B2 (en) * 2007-10-19 2014-10-28 Oracle International Corporation Data source-independent search system architecture
US20100131447A1 (en) * 2008-11-26 2010-05-27 Nokia Corporation Method, Apparatus and Computer Program Product for Providing an Adaptive Word Completion Mechanism
US8312105B2 (en) * 2009-04-28 2012-11-13 International Business Machines Corporation Natural ordering in a graphical user interface
US10698914B2 (en) * 2015-03-31 2020-06-30 Microsoft Technology Licensing, Llc Query-by-example for finding similar people
CN105095464B (zh) * 2015-07-30 2019-03-05 北京奇虎科技有限公司 一种检索系统的检测方法和装置
CN113094338B (zh) * 2021-03-15 2022-12-13 上海机电工程研究所 数据比对方法及系统、装置、介质

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB8929158D0 (en) * 1989-12-23 1990-02-28 Int Computers Ltd Database system
JPH06282574A (ja) * 1993-03-24 1994-10-07 Toshiba Corp 類似検索装置
JPH0744570A (ja) * 1993-06-29 1995-02-14 Mitsubishi Electric Corp データ検索装置
EP0674282B1 (fr) * 1994-03-24 2002-07-24 NCR International, Inc. Procédé et système pour la recherche de dépôts de ressources d'information
JP2697651B2 (ja) * 1994-12-26 1998-01-14 日本電気株式会社 データベース検索結果評価方式
US6366956B1 (en) * 1997-01-29 2002-04-02 Microsoft Corporation Relevance access of Internet information services
DE59801992D1 (de) * 1997-08-26 2001-12-06 Siemens Ag Verfahren und system zur rechnergestützten ermittlung einer relevanz eines elektronischen dokuments für ein vorgebbares suchprofil
US20010014868A1 (en) * 1997-12-05 2001-08-16 Frederick Herz System for the automatic determination of customized prices and promotions
JP3657785B2 (ja) * 1998-09-10 2005-06-08 株式会社東芝 情報記憶検索方法、情報記憶検索システム及び記録媒体
US7502748B1 (en) * 1999-08-31 2009-03-10 Careerious Inc. Job matching system and method
AU2448601A (en) * 1999-12-16 2001-06-25 Zrep Inc. Method and apparatus for scoring and matching attributes of a seller to project or job profiles of a buyer
GB0009750D0 (en) * 2000-04-19 2000-06-07 Erecruitment Limited Method and apparatus for data object and matching,computer readable storage medium,a program for performing the method,

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
None *
See also references of WO0206974A3 *

Also Published As

Publication number Publication date
JP4868484B2 (ja) 2012-02-01
CN1304991C (zh) 2007-03-14
US20040030680A1 (en) 2004-02-12
US7831602B2 (en) 2010-11-09
WO2002006974A2 (fr) 2002-01-24
DE10034694B4 (de) 2005-06-09
WO2002006974A3 (fr) 2002-12-27
DE10034694A1 (de) 2002-02-07
CN1455902A (zh) 2003-11-12
JP2004515837A (ja) 2004-05-27

Similar Documents

Publication Publication Date Title
EP1301872A2 (fr) Procede pour comparer des profils de recherche
DE69527926T2 (de) Ein mit Rechner durchgeführtes Verfahren und System zur Informationswiederauffindung
DE68924525T2 (de) Gemeinschaftsobjektszustandsanzeige.
DE69838158T2 (de) Auf die Anzahl von in den Tabellen gespeicherten Datensätzen basiertes Ordnen von Verbindungen
DE60000678T2 (de) Optischer Scanner und zugehörige Software
DE69407287T2 (de) Datenwiederauffindungssystem
DE69026764T2 (de) Verfahren zur Datenübertragung mit hoher Geschwindigkeit
DE102004001797A1 (de) Kartendaten-Verarbeitungsvorrichtung und Zentrumssystem
EP1770635A1 (fr) Méthode itérative d'interpolation d'image
DE3911465A1 (de) Verfahren zur konfiguration technischer systeme aus komponenten
DE3855494T2 (de) Abfragevorrichtung und -methode
DE3643585A1 (de) Verarbeitungssystem fuer grafische daten
DE69728675T2 (de) Informationsübertragungsverfahren und vorrichtung dafür
WO2002021353A2 (fr) Procede et dispositif permettant de realiser une vente aux encheres electronique dans un reseau de communication
DE69126823T2 (de) Verfahren zur bedingten Löschung von Datenobjekten in einem Datenverarbeitungssystem
DE69725899T2 (de) Verfahren zur Instandhaltung eines Netzwerks von teilweise replizierten Datenbanken
EP2021951A1 (fr) Procédé de commande d'un système de gestion de banque de données relationnelle
DE102012025349B4 (de) Bestimmung eines Ähnlichkeitsmaßes und Verarbeitung von Dokumenten
DE19538448B4 (de) Datenbankmanagementsystem sowie Datenübertragungsverfahren
DE69706987T2 (de) Speichersystem und speicherverfahren für ein verteiltes speichersystem
EP2601594A1 (fr) Procédé et dispositif de traitement automatique de données en un format de cellule
DE102012025351B4 (de) Verarbeitung eines elektronischen Dokuments
WO2001059609A1 (fr) Dispositif, support d'informations et procede pour trouver des objets presentant une grande similitude par rapport a un objet predetermine
DE102019203427A1 (de) Verfahren und Vorrichtung zum Führen von Fahrzeugen in einem Parkraum
EP1094405A2 (fr) Mèthode de creation d'une interface dynamique d'une base de donnees

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20030110

AK Designated contracting states

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB IT SE

17Q First examination report despatched

Effective date: 20110203

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20180611