EP1938219A1 - Procede de tri d'un ensemble de documents electroniques - Google Patents
Procede de tri d'un ensemble de documents electroniquesInfo
- Publication number
- EP1938219A1 EP1938219A1 EP06808294A EP06808294A EP1938219A1 EP 1938219 A1 EP1938219 A1 EP 1938219A1 EP 06808294 A EP06808294 A EP 06808294A EP 06808294 A EP06808294 A EP 06808294A EP 1938219 A1 EP1938219 A1 EP 1938219A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- documents
- correlation
- function
- document
- degree
- 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
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/954—Navigation, e.g. using categorised browsing
Definitions
- the invention relates to the fields of telecommunications and in particular to the field of search engines for the search of electronic documents.
- the invention relates to a method of sorting a set of electronic documents.
- a set results for example from a search carried out by a user by means of a search engine on an Internet-type network, the electronic documents being in this case Web pages (abbreviation of "World Wide Web"), which can be accessed locally via a local storage medium or remotely via the network.
- Web pages abbreviation of "World Wide Web”
- Search engines use several techniques for sorting or sorting pages from a search.
- Some are based on semantics, a page being classified as being all the more relevant because it includes a large number of occurrences of the searched word or words.
- These techniques are sensitive to a practice known as the Anglo-Saxon
- spammming intended to include in a given page a very large number of times the words commonly used by users in their search query, which has the effect of frequently appearing the page as relevant.
- Some of the techniques exploiting the topological structure of the Web consist of classifying Web pages by assigning to the different pages a rank that is a function of the relationships of a page with the others.
- PageRank An example of such a method, known as “PageRank”, is used in the implementation of the Google TM search engine and is described in the document: "The Page Rank Quotation Ranking: Bringing Order on the Web" by L. Page, S. Brin, R. Motwani and T. Winograd; Technical Report, Computer Science Department, Stanford University, 1998.
- the PageRank method orders pages based on their visibility on the Web.
- a random navigation from page to page on the Web following the hypertext links is simulated. This navigation corresponds to that caused by a user accessing the Web when the latter randomly activates one of the hypertext links in a page viewed to access another page.
- This method carries out a probabilistic analysis of this simulated navigation in order to determine the probability for the user to find himself on a given page during such random navigation from page to page.
- the rank of a page is even higher than the number of times this page is quoted by other pages is high.
- Such a method provides a ranking rank that is not necessarily relevant to the search performed by a user, the top ranked pages (of highest rank) not necessarily being the pages corresponding best waiting for the user.
- this method does not make it possible to identify in the set of documents thematic communities or communities of interest, likely to point the user more quickly to an interesting page.
- the object of the invention is therefore in particular to solve the aforementioned drawbacks of the state of the art by proposing a technique for sorting electronic documents, for example Web pages, which makes it possible in particular to detect spamming problems, which is applicable. to a large set of documents while being fast in its implementation, and which allows to simply obtain a sort of documents, not by ranking, but by building communities of documents or subset of documents close each other, that this concept of proximity is defined according to the semantic content of the documents, the hypertext links between these documents or in a different way.
- the object of the invention is, according to a first aspect, a method for sorting a set of electronic documents, comprising:
- the applications of the process are multiple: building clusters of documents, filing or selection of documents. These operations are performed in the space R / as a function of the spatial position of the projections of the documents or on the basis of measurement of distance, that is to say by taking into account their degree of correlation or proximity as determined.
- the method according to the invention can for example be used to perform all sorts of sorting operations, classification, classification of WEB pages resulting from a search carried out by means of a search engine, the most original pages, it is that is, those that are furthest from each other, for example, being ranked first.
- the pages are sorted by group, each group corresponding to a set of pages whose projections by the function X are in a predefined space area of the sphere of the space R /.
- a partition of this sphere into spatial zones is defined, and the documents are classified according to the belonging of their projection to one of the spatial zones of the partition.
- the method according to the invention can also be used to detect the presence of "Spam", that is to say pages that point to each other, because the projections of all these pages on the sphere S will be found substantially close to each other.
- the method according to the invention can also be used to generate a visual representation of the WEB pages resulting from a search carried out by means of a search engine.
- the degree of correlation between two documents u and v is determined as a function of the number of hypertext links and / or the number of cocitation bonds, present between the documents u and v, the degree of correlation being even higher than this number is high, the lack of correlation corresponding to the absence of links.
- This first variant advantageously allows the realization of sorting operations taking into account the hypertext links or cocitation between documents.
- the degree of correlation between two documents u and v is determined as a function of a measure of proximity of the semantic contents of the documents u and v, the degree of correlation being all the greater as this measure is weak, the absence of correlation corresponding to a measurement lower than a predefined threshold.
- This second variant advantageously allows the realization of operations sorting that takes into account the semantic content of documents.
- the degree of correlation is determined according to the favorite pages defined by a plurality of users.
- each user is associated with a set of documents (his favorite pages), the degree of correlation between two documents u and v being determined as the number of such sets to which the documents u and v belong.
- This third variant advantageously makes it possible to take account of user profiles in determining the degree of correlation between pages.
- the three variants can further be combined in them to determine a degree of correlation that takes into account both hypertext links, semantic content and / or user preferences. Any other type of link between two documents can also be used for the definition of a degree of correlation.
- the method further comprising:
- a step of determining a projection function Z of said set on said sphere said projection function Z being obtained from the initial function Z 0 in at least one iteration, each iteration consisting in determining a function Z 1 from the function Z 1-1 obtained at the preceding iteration by replacing, for at least one document u of said set, the value of Z 1-1 (w) by the value X 1 (w) allowing to optimize a predefined criterion which is a function of the value of Z ⁇ 1 (W) as well as values of Z 1-1 (V) and degrees of correlation ⁇ ⁇ u, v) between the documents u and v for any document v belonging to the whole audit.
- the method according to the invention lends itself to an iterative determination of the X function, which simplifies its implementation and makes it possible to precisely control the convergence of the method.
- the function Z 0 is defined randomly. Starting from a random function statistically improves the speed of convergence to the desired X function, without the need for prior knowledge of the function to be obtained.
- the optimization of the predefined criterion consists in to maximize for the document u the value of a quantity ⁇ (w) equal to:
- the invention also relates to a computer program on an information medium readable by a computer system, said program comprising instructions for implementing a method according to the invention as briefly defined above, when this program is loaded. then executed by a computer system.
- the invention also relates to a data processing device comprising data processing means for executing the steps of a method according to the invention.
- a data processing device comprising data processing means for executing the steps of a method according to the invention.
- a device is for example a computer server implementing a document search engine.
- the invention also relates to a recording medium, readable by a computer system, comprising a program comprising program code instructions for implementing a method according to the invention when said program is executed by a system. computer science.
- FIG. 1 is a flowchart of a mode. embodiment of the method according to the invention.
- the method according to the invention is applied to a set of electronic documents, in particular a set of WEB pages, some of which contain one or more hypertext links to one or more other pages.
- the degree of correlation between two documents u and v of the set of documents V is determined as a function of the number of hypertext links and cocitation links existing between the documents u and v.
- the meaning of the hypertext links is not taken into account and "symmetrized" hypertext links are considered, that is to say that one treats in the same way the case where the document u has a link to the document v and the case where the document v has a link to the document u.
- Step S100 consists in determining for any pair (u, v) of documents of set V a weight a ⁇ ⁇ u, v) which is a function of the number of hypertext links between documents u and v.
- the function ⁇ ⁇ ⁇ u, v) is an increasing function of the number of hypertext links between the documents u and v.
- the value of a ⁇ ⁇ u, v) is between a predefined minimum value (typically 0) and a predefined maximum value (typically 1).
- the minimum value corresponds to the absence of a hypertext link between the documents u and v
- the maximum value corresponds for example to the presence of a predetermined minimum number of hypertext links between the documents u and v.
- the value of a ⁇ (u, v) is chosen equal to 0 in the absence of hypertext link and equal to 1 in the presence of at least one hypertext link between the documents u and v.
- the value of o ⁇ (u, v) is chosen equal to 0 in the absence of hypertext link, equal to 0.5 in the presence of a single hypertext link between the documents u and v and equal to 1 in the presence of two or more hypertext links between documents u and v.
- the value of a ⁇ (u, v) is defined as a continuously increasing function of the number N h of hypertext links between the documents u and v, for example:
- Step S105 consists in determining for any pair (u, v) of documents of set V a weight ⁇ 2 (u, v) which is a function of the number of cocitation links between documents u and v.
- the function ⁇ 2 (u, v) is an increasing function of the number of cocitation links between the documents u and v.
- the function definition examples given for a ⁇ (u, v) are transposable to ⁇ 2 (u, v).
- the value of ⁇ 2 (u, v) is chosen equal to 0 in the absence of a cocitation link and equal to 1 in the presence of at least one cocitation link between the documents u and v.
- the degree of correlation ⁇ (u, v) thus takes real values between 0 and 1, the value 0 corresponding to the absence of links.
- the value given to the coefficient k1 will be chosen all the more high if one wishes to give importance to the presence of hypertext links.
- the value given to the coefficient k2 will be chosen all the more high if we wish to give importance to the presence of cocitation bonds.
- This method of determining the degree of correlation between the documents makes it possible to take into account, in the document classification method according to the invention, two types of links between documents: the hypertext links and the cocitation links.
- This method is generalized to other types of links.
- the determination of the degree of correlation between two documents is made on the basis of an analysis and a comparison of the semantic content of both documents.
- known semantic content comparison methods are applicable.
- the degree of correlation represents a measure of the semantic proximity between the two documents.
- the degree of semantic correlation can be determined for example on the basis of a statistical analysis and comparison of the words contained in each of the documents.
- the degree of correlation between two documents is then determined as a weighted sum of elementary correlation degrees, for example a sum of a degree of correlation function of the number of cohesive links between the two documents and a degree of correlation function of semantic contents of both documents.
- the method allows the simultaneous taking into account of information provided by hypertext links between documents and by the semantic content of documents.
- steps S120 to S135 consist in determining a projection function X between the set V of documents and a sphere S of the set R / (Cartesian power d-th of R, where R denotes l set of real numbers and d is a positive integer).
- R denotes l set of real numbers and d is a positive integer.
- d is chosen equal to 2 or 3.
- the determined function X is such that, for at least one document u, the distance in R ⁇ between two points X (u) and X (v) where v is a document for the correlation between the documents u and v, is even smaller as the degree of correlation is high.
- an iterative process is used for the determination of the function X.
- Each iteration of this iterative process consists in determining a function X 1 from the function X 1-1 obtained in the preceding step, in replacing, for at least one document u of the set V, the value of X 1-1 [U) by the value of X 1 (w) making it possible to optimize a predefined criterion; this criterion is on the one hand a function of the value of X 1-1 (U) obtained for the document u considered and values of -X " , _i (v) obtained for any document v of the set V, and of 'other on the other hand, a function of the degrees of correlation ⁇ (u, v) between the document u and any document v of the set V.
- the criterion is chosen so as to converge the sequence of functions X 1 to an X function presenting the properties listed above.
- the optimization of said predefined criterion consists in maximizing for a given document u the value of a quantity ⁇ (w) equal to,
- step S120 the initial projection function Z 0 is determined.
- the initial function Z 0 takes random values on the sphere S.
- step S125 begins the iterative process of determining the projection function X.
- An iteration corresponds to the execution of steps S125, S130 and S135.
- the iterations are indexed by the index i.
- the index i takes its initial value and is 0.
- step S135 it is determined whether the iterative process terminates.
- the process is iterated a sufficient number of times for the function X to be modified at least once for each document u of the set V.
- the decision to stop the iterations can also be based on: - the number of iterations already carried out, a measure of the convergence of the function, carried out after each iteration.
- step S140 If, in step S135, the decision to stop the iterative process is taken, then step S140 is executed; otherwise, the next iteration is executed from step S125.
- step S140 a sorting operation is performed on at least a part of the set V of the documents as a function of the values taken by the function X obtained at the last iteration.
- the position of a point X (u) on the sphere S is a function of the links of the document u with the other documents.
- the distance between two points is representative of the degree of correlation between the documents corresponding to these two points.
- this sorting operation may aim at:
- the sorting operation comprises the following operations:
- the sorting operation comprises the operation of determining a subset V 1 for which any point X (u) belongs to a given set, for example to a predefined area of the space in R /.
- This zone may be for example the interior volume of a sphere, a cube, or a surface defined on the sphere S of R d .
- the method according to the invention thus makes it possible to perform all sorts of sorting operations on a set of documents, on the basis of the values taken by the determined function X.
- the calculation time of an iteration of this process is proportional to the number of hypertext links when the degree of correlation is determined as a function of this number of hypertext links.
- the method of the invention can therefore be used on a large number of pages.
- This representation makes it easier for the user to select relevant sets of documents.
- This representation can be done for example in the form of a two-dimensional cartographic representation, in which each document is represented by a graphic symbol corresponding to the value of the function X determined for this document.
- this graphic representation is displayed on a user's computer terminal, comprising a display screen and a graphic selection tool (for example a mouse used in combination with a pointer allowing define graphic areas on the screen), this tool being suitable for selecting at least a portion of the graphical representation.
- a graphic selection tool for example a mouse used in combination with a pointer allowing define graphic areas on the screen
- the user is then able to make a selection of one or more parts of the graphical representation corresponding to one or more sets, chosen by him, of documents.
- the terminal obtains via the graphical selection tool data defining the selected parts. According to these data, the terminal sorts the set V of the documents. For example, it generates a reduced list of documents, corresponding to documents whose projection is in the parts selected by the user. Alternatively, the documents whose projection is in the selected parts are instead eliminated. From the list of documents retained by the user, additional sorting operations can be performed, these operations being performed automatically on the basis of document properties or their degree of correlation, or performed manually, based on new parts selected within the initially selected parts.
- This mode of viewing the results of a search performed by a search engine is particularly ergonomic for the user. It brings up communities of documents, as a set of points close to each other,
- the projection representation as defined in the invention therefore makes it possible to sort or classify, either visually and manually by means of a graphic selection tool, or automatically, according to predefined criteria related to the position of these documents. in the generated representation.
- the steps of the method of sorting electronic documents, according to the invention are determined by instructions of a computer program.
- computer program herein refers to one or more computer programs forming a set (software) whose purpose is the implementation of the invention when it is executed by an appropriate computer system.
- the method according to the invention is then implemented when the aforesaid program is loaded in computer means incorporated, for example, in a user terminal connected if necessary to an Internet type network and equipped with Internet browser software.
- the invention also relates to such a computer program, particularly in the form of software stored on an information carrier.
- an information carrier may be constituted by any entity or device capable of storing a program according to the invention.
- the medium in question may comprise a hardware storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or a magnetic recording means, for example a hard disk.
- the information carrier may be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the method in question.
- the information medium can also be a transmissible immaterial medium, such as an electrical or optical signal that can be conveyed via an electrical or optical cable, by radio or by other means.
- a program according to the invention can in particular be downloaded to an Internet type network.
- a computer program according to the invention can use any programming language and be in the form of source code, object code, or intermediate code between source code and object code (for example eg, a partially compiled form), or in any other form desirable for implementing a method according to the invention.
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (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
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0552826 | 2005-09-20 | ||
PCT/FR2006/050856 WO2007034096A1 (fr) | 2005-09-20 | 2006-09-07 | Procede de tri d'un ensemble de documents electroniques |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1938219A1 true EP1938219A1 (fr) | 2008-07-02 |
Family
ID=36481229
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP06808294A Ceased EP1938219A1 (fr) | 2005-09-20 | 2006-09-07 | Procede de tri d'un ensemble de documents electroniques |
Country Status (5)
Country | Link |
---|---|
US (1) | US7827173B2 (fr) |
EP (1) | EP1938219A1 (fr) |
JP (1) | JP2009509259A (fr) |
CN (1) | CN101268465B (fr) |
WO (1) | WO2007034096A1 (fr) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4518168B2 (ja) * | 2008-03-21 | 2010-08-04 | 富士ゼロックス株式会社 | 関連文書提示システム及びプログラム |
WO2010078859A1 (fr) * | 2009-01-08 | 2010-07-15 | Beel Joeran | Procédé pour déterminer une similarité entre des documents |
CN101937436B (zh) * | 2009-06-29 | 2013-09-25 | 华为技术有限公司 | 一种文本分类方法及装置 |
US9313284B2 (en) | 2013-03-14 | 2016-04-12 | International Business Machines Corporation | Smart posting with data analytics and semantic analysis to improve a message posted to a social media service |
DK3436392T3 (da) | 2016-03-31 | 2021-05-25 | Nhlo Holding B V | Indretning med en drejelig arm og en konfigurerbar fjeder |
CN112528016B (zh) * | 2020-11-19 | 2024-05-07 | 重庆兆光科技股份有限公司 | 一种基于低维球面投影的文本分类方法 |
Family Cites Families (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5808615A (en) * | 1996-05-01 | 1998-09-15 | Electronic Data Systems Corporation | Process and system for mapping the relationship of the content of a collection of documents |
US6453246B1 (en) * | 1996-11-04 | 2002-09-17 | 3-Dimensional Pharmaceuticals, Inc. | System, method, and computer program product for representing proximity data in a multi-dimensional space |
US5987470A (en) * | 1997-08-21 | 1999-11-16 | Sandia Corporation | Method of data mining including determining multidimensional coordinates of each item using a predetermined scalar similarity value for each item pair |
US6289342B1 (en) * | 1998-01-05 | 2001-09-11 | Nec Research Institute, Inc. | Autonomous citation indexing and literature browsing using citation context |
GB9811874D0 (en) * | 1998-06-02 | 1998-07-29 | Univ Brunel | Information management system |
JP2000076267A (ja) * | 1998-08-31 | 2000-03-14 | Sharp Corp | 情報検索方法、情報検索装置、及び情報検索プログラムを記録したコンピュータ読み取り可能な記録媒体 |
US6862710B1 (en) * | 1999-03-23 | 2005-03-01 | Insightful Corporation | Internet navigation using soft hyperlinks |
JP3604069B2 (ja) * | 1999-05-19 | 2004-12-22 | 日本電信電話株式会社 | 文書間関連度計算装置、その方法およびその記録媒体 |
US6633868B1 (en) * | 2000-07-28 | 2003-10-14 | Shermann Loyall Min | System and method for context-based document retrieval |
US7130848B2 (en) * | 2000-08-09 | 2006-10-31 | Gary Martin Oosta | Methods for document indexing and analysis |
JP4005798B2 (ja) * | 2001-12-05 | 2007-11-14 | 日本電信電話株式会社 | 文書間関連度計算装置並びに記録媒体及びソフトウェア |
US7194465B1 (en) * | 2002-03-28 | 2007-03-20 | Business Objects, S.A. | Apparatus and method for identifying patterns in a multi-dimensional database |
JP3904548B2 (ja) * | 2003-10-30 | 2007-04-11 | チームラボ株式会社 | 関連度の表示装置、表示方法、ならびに、プログラム |
JP2005301786A (ja) * | 2004-04-14 | 2005-10-27 | Internatl Business Mach Corp <Ibm> | 評価装置、クラスタ生成装置、プログラム、記録媒体、評価方法、及びクラスタ生成方法 |
-
2006
- 2006-09-07 JP JP2008531744A patent/JP2009509259A/ja active Pending
- 2006-09-07 WO PCT/FR2006/050856 patent/WO2007034096A1/fr active Application Filing
- 2006-09-07 EP EP06808294A patent/EP1938219A1/fr not_active Ceased
- 2006-09-07 US US12/067,570 patent/US7827173B2/en active Active
- 2006-09-07 CN CN200680034703XA patent/CN101268465B/zh active Active
Non-Patent Citations (1)
Title |
---|
See references of WO2007034096A1 * |
Also Published As
Publication number | Publication date |
---|---|
JP2009509259A (ja) | 2009-03-05 |
US20080208860A1 (en) | 2008-08-28 |
CN101268465A (zh) | 2008-09-17 |
US7827173B2 (en) | 2010-11-02 |
WO2007034096A1 (fr) | 2007-03-29 |
CN101268465B (zh) | 2012-05-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7743047B2 (en) | Accounting for behavioral variability in web search | |
FR2840088A1 (fr) | Moteur de recherche et base de donnees, et procedes pour leur mise en oeuvre | |
US20060085391A1 (en) | Automatic query suggestions | |
US20090158146A1 (en) | Resizing tag representations or tag group representations to control relative importance | |
EP1902412A2 (fr) | Systeme informatique permettant de prevoir le devenir d'un jeu chronologique de valeurs numeriques | |
EP1184796A1 (fr) | Procédé de navigation associative dans des bases de données multimédia | |
WO2013075272A1 (fr) | Reclassement de résultats de recherche basé sur un prototype | |
WO2007034096A1 (fr) | Procede de tri d'un ensemble de documents electroniques | |
CN106599047B (zh) | 一种信息的推送方法及装置 | |
EP1746521A1 (fr) | Procédé de classement d'un ensemble de documents électroniques du type pouvant contenir des liens hypertextes vers d'autres documents électroniques | |
US20100121844A1 (en) | Image relevance by identifying experts | |
CN113239182A (zh) | 一种文章推荐方法、装置、计算机设备及存储介质 | |
WO2006008350A1 (fr) | Recherche automatique de similarite entre images incluant une intervention humaine | |
FR2817066A1 (fr) | Procede de codage par ondelettes d'un maillage representatif d'un objet ou d'une scene en trois dimensions, dispositifs de codage et decodage, systeme et structure de signal correspondants | |
EP2227755B1 (fr) | Procede d'analyse d'un contenu multimedia, produit programme d'ordinateur et dispositif d'analyse correspondants | |
CN112182414A (zh) | 文章推荐方法、装置及电子设备 | |
WO2010066774A1 (fr) | Systeme de recherche d'information visuelle | |
CN115516448A (zh) | 使用分布式训练框架产生的嵌入来评估项之间的相似性 | |
EP2180436B1 (fr) | Système de procédé d'apprentissage semi-supervisé pour la classification de données à partir de paramètres discriminants | |
Sridhar et al. | Envisaging prominence of Indian telecom operators using an ensemble link based approach | |
EP3114597B1 (fr) | Procédé d'analyse d'une pluralité de messages, produit programme d'ordinateur et dispositif associés | |
FR2830958A1 (fr) | Procede d'indexation, de stockage et de comparaison de documents multimedia | |
Cheng et al. | OSNI: Searching for Needles in a Haystack of Social Network Data. | |
EP1408428A1 (fr) | Système et procédé de traitement et de visualisation des résultats de recherches effectuées par un moteur de recherche à base d'indexation, modèle d'interface et méta-modèle correspondants | |
Soto | Exploring the reuse of past search results in information retrieval |
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: 20080403 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
17Q | First examination report despatched |
Effective date: 20080722 |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |
|
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: 20160930 |