EP1400903A1 - Stockage et extraction d'informations - Google Patents

Stockage et extraction d'informations Download PDF

Info

Publication number
EP1400903A1
EP1400903A1 EP03255294A EP03255294A EP1400903A1 EP 1400903 A1 EP1400903 A1 EP 1400903A1 EP 03255294 A EP03255294 A EP 03255294A EP 03255294 A EP03255294 A EP 03255294A EP 1400903 A1 EP1400903 A1 EP 1400903A1
Authority
EP
European Patent Office
Prior art keywords
nodes
information
information items
data
client system
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
EP03255294A
Other languages
German (de)
English (en)
Inventor
Jonathan Richard Thorpe
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.)
Sony Europe Ltd
Original Assignee
Sony United Kingdom Ltd
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
Priority claimed from GB0221774A external-priority patent/GB2393271A/en
Application filed by Sony United Kingdom Ltd filed Critical Sony United Kingdom Ltd
Priority to EP07018039A priority Critical patent/EP1906317A3/fr
Publication of EP1400903A1 publication Critical patent/EP1400903A1/fr
Ceased legal-status Critical Current

Links

Images

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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33—Querying
    • G06F16/332—Query formulation
    • G06F16/3325—Reformulation based on results of preceding query
    • G06F16/3326—Reformulation based on results of preceding query using relevance feedback from the user, e.g. relevance feedback on documents, documents sets, document terms or passages
    • G06F16/3328—Reformulation based on results of preceding query using relevance feedback from the user, e.g. relevance feedback on documents, documents sets, document terms or passages using graphical result space presentation or visualisation

Definitions

  • This invention relates to information storage and retrieval.
  • a first step is to pre-process the document text, and then a feature vector is derived from each pre-processed document.
  • this may be a histogram showing the frequencies of occurrence of each of a large dictionary of words.
  • Each data value i.e. each frequency of occurrence of a respective dictionary word
  • n is the total number of candidate words in the dictionary (43222 in the example described in this paper).
  • Weighting may be applied to the n vector values, perhaps to stress the increased relevance or improved differentiation of certain words.
  • n-value vectors are then mapped onto smaller dimensional vectors (i.e. vectors having a number of values m (500 in the example in the paper) which is substantially less than n. This is achieved by multiplying the vector by an (n x m) "projection matrix" formed of an array of random numbers. This technique has been shown to generate vectors of smaller dimension where any two reduced-dimension vectors have much the same vector dot product as the two respective input vectors. This vector mapping process is described in the paper "Dimensionality Reduction by Random Mapping: Fast Similarity Computation for Clustering", Kaski, Proc IJCNN, pages 413-418, 1998.
  • the reduced dimension vectors are then mapped onto nodes (otherwise called neurons) on the SOM by a process of multiplying each vector by a "model" (another vector).
  • the models are produced by a learning process which automatically orders them by mutual similarity onto the SOM, which is generally represented as a two-dimensional grid of nodes. This is a non-trivial process which took Kohonen et al six weeks on a six-processor computer having 800 MB of memory, for a document database of just under seven million documents.
  • the grid of nodes forming the SOM is displayed, with the user being able to zoom into regions of the map and select a node, which causes the user interface to offer a link to an internet page containing the document linked to that node.
  • This invention provides an information retrieval system in which a set of distinct information items map to respective nodes in an array of nodes by mutual similarity of the information items, so that similar information items map to nodes at similar positions in the array of nodes; the system comprising:
  • the invention provides an efficient and convenient way of operating an information retrieval system over a network such as the internet.
  • the "data representing information items” could be the item itself, if it is of a size and nature appropriate for full display, or could be data indicative of the item.
  • Figure 1 is a schematic diagram of an information storage and retrieval system based around a general-purpose computer 10 having a processor unit 20 including disk storage 30 for programs and data, a network interface card 40 connected to a network 50 such as an Ethernet network or the Internet, a display device such as a cathode ray tube device 60, a keyboard 70 and a user input device such as a mouse 80.
  • the system operates under program control, the programs being stored on the disk storage 30 and provided, for example, by the network 50, a removable disk (not shown) or a pre-installation on the disk storage 30.
  • the storage system operates in two general modes of operation.
  • a set of information items e.g. textual information items
  • the second mode of operation is the actual searching against the indexed and sorted data.
  • the embodiments are applicable to many types of information items.
  • a non-exhaustive list of appropriate types of information includes patents, video material, emails, presentations, internet content, broadcast content, business reports, audio material, graphics and clipart, photographs and the like, or combinations or mixtures of any of these.
  • the information items are loaded onto the disk storage 30 in a conventional manner. Preferably, they are stored as part of a database structure which allows for easier retrieval and indexing of the items, but this is not essential.
  • the process used to arrange them for searching is shown schematically in Figure 2.
  • the indexed information data need not be stored on the local disk drive 30.
  • the data could be stored on a remote drive connected to the system 10 via the network 50.
  • the information may be stored in a distributed manner, for example at various sites across the internet. If the information is stored at different internet or network sites, a second level of information storage could be used to store locally a "link" (e.g. a URL) to the remote information, perhaps with an associated summary, abstract or MetaData associated with that link. So, the remotely held information would not be accessed unless the user selected the relevant link (e.g. from the results list 260 to be described below), although for the purposes of the technical description which follows, the remotely held information, or the abstract/summary/MetaData, or the link/URL could be considered as the "information item".
  • a link e.g. a URL
  • a formal definition of the "information item” is an item from which a feature vector is derived and processed (see below) to provide a mapping to the SOM.
  • the data shown in the results list 260 may be the information item itself (if it is held locally and is short enough for convenient display) or may be data representing and/or pointing to the information item, such as one or more of MetaData, a URL, an abstract, a set of key words, a representative key stamp image or the like. This is inherent in the operation "list” which often, though not always, involves listing data representing a set of items.
  • the information items could be stored across a networked work group, such as a research team or a legal firm.
  • a hybrid approach might involve some information items stored locally and/or some information items stored across a local area network and/or some information items stored across a wide area network.
  • the system could be useful in locating similar work by others, for example in a large multi-national research and development organisation, similar research work would tend to be mapped to similar output nodes in the SOM (see below).
  • the present technique could be used to check for its originality by detecting previous programmes having similar content.
  • the system 10 of Figure 1 is but one example of possible systems which could use the indexed information items.
  • the initial (indexing) phase would be carried out by a reasonably powerful computer, most likely by a non-portable computer
  • the later phase of accessing the information could be carried out at a portable machine such as a "personal digital assistant" (a term for a data processing device with display and user input devices, which generally fits in one hand), a portable computer such as a laptop computer, or even devices such as a mobile telephone, a video editing apparatus or a video camera.
  • a portable machine such as a "personal digital assistant" (a term for a data processing device with display and user input devices, which generally fits in one hand)
  • a portable computer such as a laptop computer
  • devices such as a mobile telephone, a video editing apparatus or a video camera.
  • practically any device having a display could be used for the information-accessing phase of operation.
  • FIG. 2 is a schematic flow chart illustrating a so-called “feature extraction” process followed by an SOM mapping process.
  • Feature extraction is the process of transforming raw data into an abstract representation. These abstract representations can then be used for processes such as pattern classification, clustering and recognition. In this process, a so-called "feature vector" is generated, which is an abstract representation of the frequency of terms used within a document.
  • the process of forming the visualisation through creating feature vectors includes:
  • each document (information item) 100 is opened in turn.
  • all "stop words” are removed from the document. Stop-words are extremely common words on a pre-prepared list, such as “a”, “the”, “however”, “about”, “and”, and “the”. Because these words are extremely common they are likely, on average, to appear with similar frequency in all documents of a sufficient length. For this reason they serve little purpose in trying to characterise the content of a particular document and should therefore be removed.
  • the remaining words are stemmed at a step 120, which involves finding the common stem of a word's variants. For example the words “thrower”, “throws”, and “throwing” have the common stem of "throw”.
  • a "dictionary" of stemmed words appearing in the documents (excluding the "stop” words) is maintained. As a word is newly encountered, it is added to the dictionary, and a running count of the number of times the word has appeared in the whole document collection (set of information items) is also recorded.
  • football can be assumed to be a better term for characterising the content of a document than "News".
  • the word “fottball” (a misspelling of "football") appears only once in the entire set of documents, and so is discarded for having too low an occurrence.
  • Such words may be defined as those having a frequency of occurrence which is lower than two standard deviations less than the mean frequency of occurrence, or which is higher than two standard deviations above the mean frequency of occurrence.
  • a feature vector is then generated at a step 130.
  • a term frequency histogram is generated for each document in the set.
  • a term frequency histogram is constructed by counting the number of times words present in the dictionary (pertaining to that document set) occur within an individual document. The majority of the terms in the dictionary will not be present in a single document, and so these terms will have a frequency of zero. Schematic examples of term frequency histograms for two different documents are shown in Figures 3a and 3b.
  • frequency histograms have a very much larger number of terms in them than the example.
  • a histogram may plot the frequency of over 50000 different terms, giving the histogram a dimension of over 50000. The dimension of this histogram needs to be reduced considerably if it is to be of use in building an SOM information space.
  • Each entry in the term frequency histogram is used as a corresponding value in a feature vector representing that document.
  • the result of this process is a (50000 x 1) vector containing the frequency of all terms specified by the dictionary for each document in the document collection.
  • the vector may be referred to as "sparse" since most of the values will typically be zero, with most of the others typically being a very low number such as 1.
  • the size of the feature vector, and so the dimension of the term frequency histogram, is reduced at a step 140.
  • Two methods are proposed for the process of reducing the dimension of the histogram.
  • Random mapping succeeds in reducing the dimension of the histogram by multiplying it by a matrix of random numbers.
  • the "raw" feature vector (shown schematically in Figure 4a) is typically a sparse vector with a size in the region of 50000 values. This can be reduced to a size of about 200 (see schematic Figure 4b) and still preserve the relative characteristics of the feature vector, that is to say, its relationship such as relative angle (vector dot product) with other similarly processed feature vectors. This works because although the number of orthogonal vectors of a particular dimension is limited, the number of nearly orthogonal vectors is very much larger.
  • a Kohonen Self-Organising map is used to cluster and organise the feature vectors that have been generated for each of the documents.
  • a self-organising map consists of input nodes 170 and output nodes 180 in a two-dimensional array or grid of nodes illustrated as a two-dimensional plane 185. There are as many input nodes as there are values in the feature vectors being used to train the map. Each of the output nodes on the map is connected to the input nodes by weighted connections 190 (one weight per connection).
  • each of these weights is set to a random value, and then, through an iterative process, the weights are "trained".
  • the map is trained by presenting each feature vector to the input nodes of the map.
  • the "closest" output node is calculated by computing the Euclidean distance between the input vector and weights of each of the output nodes.
  • the closest node is designated the "winner” and the weights of this node are trained by slightly changing the values of the weights so that they move "closer” to the input vector.
  • the nodes in the neighbourhood of the winning node are also trained, and moved slightly closer to the input vector.
  • each of the documents can be presented to the map to see which of the output nodes is closest to the input feature vector for that document. It is unlikely that the weights will be identical to the feature vector, and the Euclidean distance between a feature vector and its nearest node on the map is known as its "quantisation error".
  • a dither component is added at a step 160, which will be described with reference to Figure 6 below.
  • a potential problem with the process described above is that two identical, or substantially identical, information items may be mapped to the same node in the array of nodes of the SOM. This does not cause a difficulty in the handling of the data, but does not help with the visualisation of the data on display screen (to be described below). In particular, when the data is visualised on a display screen, it has been recognised that it would be useful for multiple very similar items to be distinguishable over a single item at a particular node. Therefore, a "dither" component is added to the node position to which each information item is mapped. The dither component is a random addition of up to ⁇ 1 / 2 of the node separation. So, referring to Figure 6, an information item for which the mapping process selects an output node 200 has a dither component added so that it in fact may be mapped to any node position within the area 210 bounded by dotted lines on Figure 6.
  • the information items can be considered to map to positions on the plane of Figure 6 at node positions other than the "output nodes" of the SOM process.
  • Figure 7 schematically illustrates a display on the display screen 60 in which data sorted into an SOM is graphically illustrated for use in a searching operation.
  • the display shows a search enquiry 250, a results list 260 and an SOM display area 270.
  • the user types a key word search enquiry into the enquiry area 250.
  • the user then initiates the search, for example by pressing enter on the keyboard 70 or by using the mouse 80 to select a screen "button" to start the search.
  • the key words in the search enquiry box 250 are then compared with the information items in the database using a standard keyword search technique. This generates a list of results, each of which is shown as a respective entry 280 in the list view 260. Also, each result has a corresponding display point on the node display area 270.
  • each point on the area 270 corresponds to the respective entry in the SOM associated with one of the results in the result list 260; and the positions at which the points are displayed within the area 270 correspond to the array positions of those nodes within the node array.
  • Figure 8 schematically illustrates a technique for reducing the number of "hits" (results in the result list).
  • the user makes use of the mouse 80 to draw a box 300 around a set of display points corresponding to nodes of interest.
  • the results list area 260 only those results corresponding to points within the box 300 are displayed. If these results turn out not to be of interest, the user may draw another box encompassing a different set of display points.
  • results area 260 displays list entries for those results for which display points are displayed within the box 300 and which satisfied the search criteria in the word search area 250.
  • the box 300 may encompass other display positions corresponding to populated nodes in the node array, but if these did not satisfy the search criteria they will not be displayed and so will not form part of the subset of results shown in the box 260.
  • Figure 9 schematically illustrates a technique for detecting the node position of an entry in the list view 260.
  • the user may "select" one or more of the entries in the results list view. In the examples shown, this is done by a mouse click on a "check box" 310 associated with the relevant results. However, it could equally be done by clicking to highlight the whole result, or by double-clicking on the relevant result and so on.
  • the corresponding display point representing the respective node in the node array is displayed in a different manner. This is shown schematically for two display points 320 corresponding to the selected results 330 in the results area 260.
  • the change in appearance might be a display of the point in a larger size, or in a more intense version of the same display colour, or in a different display colour, or in a combination of these varying attributes.
  • a new information item can be added to the SOM by following the steps outlined above (i.e. steps 110 to 140) and then applying the resulting reduced feature vector to the "pre-trained" SOM models, that is to say, the set of SOM models which resulted from the self-organising preparation of the map. So, for the newly added information item, the map is not generally "retrained”; instead steps 150 and 160 are used with all of the SOM models not being amended. To retrain the SOM every time a new information item is to be added is computationally expensive and is also somewhat unfriendly to the user, who might grow used to the relative positions of commonly accessed information items in the map.
  • a retraining process is appropriate. For example, if new terms (perhaps new items of news, or a new technical field) have entered into the dictionary since the SOM was first generated, they may not map particularly well to the existing set of output nodes. This can be detected as an increase in a so-called "quantisation error" detected during the mapping of newly received information item to the existing SOM.
  • the quantisation error is compared to a threshold error amount. If it is greater than the threshold amount then either (a) the SOM is automatically retrained, using all of its original information items and any items added since its creation; or (b) the user is prompted to initiate a retraining process at a convenient time.
  • the retraining process uses the feature vectors of all of the relevant information items and reapplies the steps 150 and 160 in full.
  • FIG. 10 schematically illustrates a camcorder 500 as an example of a video acquisition and/or processing apparatus, the camcorder including an image capture device 510 with an associated lens 520; a data/signal processor 530; tape storage 540; disk or other random access storage 550; user controls 560; and a display device 570 with eyepiece 580.
  • image capture device 510 with an associated lens 520
  • data/signal processor 530 a data/signal processor 530
  • tape storage 540 disk or other random access storage 550
  • user controls 560 user controls 560
  • a display device 570 with eyepiece 580 with eyepiece 580.
  • MetaData relating to captured video material may be stored on the storage 550, and an SOM relating to the stored data viewed on the display device 570 and controlled as described above using the user controls 560.
  • FIG 11 schematically illustrates a personal digital assistant (PDA) 600, as an example of portable data processing apparatus, having a display screen 610 including a display area 620 and a touch sensitive area 630 providing user controls; along with data processing and storage (not shown).
  • PDA personal digital assistant
  • the PDA may be used as described above in connection with the system of Figure 1.
  • Figure 12 schematically illustrates a networked information storage and retrieval apparatus.
  • the system may operate under software control as described earlier.
  • the operation is divided between a client system 800 and one or more storage nodes 810, the client system and the storage nodes being connected to one another by a networked connection such as an internet connection 820.
  • a networked connection such as an internet connection 820.
  • Figure 12 schematic connections are shown between each storage node 810 and the client system. Many network arrangements including the internet will notionally provide a physical connection between all of the nodes connected to that network, including between pairs of storage nodes 810. However the connections in Figure 12 are intended to represent logical data paths between the different nodes.
  • a search engine or internet search provider (server) 830 may also be logically connected to the client system.
  • the client system 800 comprises display / user interface logic 840 providing (or being connectable to) a user display operating as described above, content organisation service logic 850 and index service logic 860.
  • Each storage node comprises information storage (e.g. disk storage) 870, optional metadata extraction logic 880 and index agent logic 890.
  • the information storage 870 of the storage nodes is the primary repository of the information items in this embodiment. However, it will be appreciated that this is just for the purposes of the present example; there is no technical reason why information items could not also be stored "locally", i.e. at the client system.
  • the client system provides the following functionality described earlier:
  • the index agent at each storage node derives data (e.g. by steps corresponding to the steps 110, 120) from textual matter either contained in an information item stored at that node or derived from such an information item by the metadata extraction logic 880 (e.g. in respect of information items consisting at least primarily of audio/video material).
  • the resulting data is then forwarded to the indexing service logic 860 of the client system. This can take place in one or more of several ways:
  • the data forwarded to the client system can be, for example, one or more of:
  • the content organisation service logic when any of (a) to (d) is received from an index agent, the content organisation service logic generates a feature vector and, from that, an SOM map position, which is stored at the client system, along with an identifier of the information item (e.g. a URL or URI - universal resource indicator) which identifies where the information item is stored. If (e) is received, an SOM map position is generated and stored at the client system along with a URL/URI.
  • an identifier of the information item e.g. a URL or URI - universal resource indicator
  • the user control (input to the logic 840) is passed to the index service logic 860 which then distributes it to the nodes connected to the network. They respond with data as described above, which is assimilated into the SOM representation for display to the user.
  • the indexing service logic may receive similar data from an Internet search engine such as Google RTM . This data is handled in the same way as already described.
  • the transmission of the data form the search engine to the indexing service may be initiated in any of the ways described above.
EP03255294A 2002-09-19 2003-08-26 Stockage et extraction d'informations Ceased EP1400903A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP07018039A EP1906317A3 (fr) 2002-09-19 2003-08-26 Stockage et récupération d'informations basé sur le principe de cartes auto-structurantes

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
GB0221774 2002-09-19
GB0221774A GB2393271A (en) 2002-09-19 2002-09-19 Information storage and retrieval
GB0229072 2002-12-12
GB0229072A GB2393275A (en) 2002-09-19 2002-12-12 Information storage and retrieval

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP07018039A Division EP1906317A3 (fr) 2002-09-19 2003-08-26 Stockage et récupération d'informations basé sur le principe de cartes auto-structurantes

Publications (1)

Publication Number Publication Date
EP1400903A1 true EP1400903A1 (fr) 2004-03-24

Family

ID=31948045

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03255294A Ceased EP1400903A1 (fr) 2002-09-19 2003-08-26 Stockage et extraction d'informations

Country Status (4)

Country Link
US (1) US20040130569A1 (fr)
EP (1) EP1400903A1 (fr)
JP (1) JP2004110834A (fr)
CN (1) CN100449534C (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004049206A1 (fr) * 2002-11-27 2004-06-10 Sony United Kingdom Limited Stockage et extraction d'informations
WO2011055256A1 (fr) 2009-11-04 2011-05-12 Nds Limited Classement de contenu basé sur les demandes des utilisateurs
US8181201B2 (en) 2005-08-30 2012-05-15 Nds Limited Enhanced electronic program guides
US8220023B2 (en) 2007-02-21 2012-07-10 Nds Limited Method for content presentation

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2395804A (en) * 2002-11-27 2004-06-02 Sony Uk Ltd Information retrieval
US8751632B2 (en) * 2010-04-29 2014-06-10 Yahoo! Inc. Methods for web site analysis
US20120166439A1 (en) * 2010-12-28 2012-06-28 Yahoo! Inc. Method and system for classifying web sites using query-based web site models
CN103678384A (zh) * 2012-09-18 2014-03-26 鸿富锦精密工业（深圳）有限公司 顺序索引生成系统及方法
US9582519B2 (en) 2013-08-15 2017-02-28 Dassault Systemes Simulia Corp. Pattern-enabled data entry and search
TWI650656B (zh) 2017-05-26 2019-02-11 虹光精密工業股份有限公司 於電腦系統搜尋影像檔案之方法、影像檔案搜尋裝置以及電腦系統
CN110858367A (zh) * 2018-08-24 2020-03-03 北京京东尚科信息技术有限公司 销售信息存储方法和装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5655080A (en) * 1995-08-14 1997-08-05 International Business Machines Corporation Distributed hash group-by cooperative processing
US6260036B1 (en) * 1998-05-07 2001-07-10 Ibm Scalable parallel algorithm for self-organizing maps with applications to sparse data mining problems

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6151643A (en) * 1996-06-07 2000-11-21 Networks Associates, Inc. Automatic updating of diverse software products on multiple client computer systems by downloading scanning application to client computer and generating software list on client computer
US6742023B1 (en) * 2000-04-28 2004-05-25 Roxio, Inc. Use-sensitive distribution of data files between users
CA2404319A1 (fr) * 2000-03-31 2001-10-11 Andrei Mikheev Procede et systeme pour reunir, organiser et afficher des informations provenant de recherches de donnees
AU2001273306A1 (en) * 2000-07-05 2002-01-14 Camo, Inc. Method and system for the dynamic analysis of data
US6874019B2 (en) * 2001-03-08 2005-03-29 International Business Machines Corporation Predictive caching and highlighting of web pages
US6839769B2 (en) * 2001-05-31 2005-01-04 Intel Corporation Limiting request propagation in a distributed file system
US7440994B2 (en) * 2001-07-06 2008-10-21 Intel Corporation Method and apparatus for peer-to-peer services to shift network traffic to allow for an efficient transfer of information between devices via prioritized list
US7146359B2 (en) * 2002-05-03 2006-12-05 Hewlett-Packard Development Company, L.P. Method and system for filtering content in a discovered topic
US7017186B2 (en) * 2002-07-30 2006-03-21 Steelcloud, Inc. Intrusion detection system using self-organizing clusters
US7096464B1 (en) * 2002-12-02 2006-08-22 Sap Aktiengesellschaft Software update method and apparatus

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5655080A (en) * 1995-08-14 1997-08-05 International Business Machines Corporation Distributed hash group-by cooperative processing
US6260036B1 (en) * 1998-05-07 2001-07-10 Ibm Scalable parallel algorithm for self-organizing maps with applications to sparse data mining problems

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
JADAV D ET AL: "Batching and dynamic allocation techniques for increasing the stream capacity of an on-demand media server", PARALLEL COMPUTING, ELSEVIER PUBLISHERS, AMSTERDAM, NL, vol. 23, no. 12, 1 December 1997 (1997-12-01), pages 1727 - 1742, XP004103447, ISSN: 0167-8191 *
KOHONEN, KASKI, LAGUS, SALOJARVI, HONKELA, PAATERO, SAARELA: "Self Organization of a Massive Document Collection", IEEE TRANSACTIONS ON NEURAL NETWORKS, vol. 11, no. 3, May 2000 (2000-05-01), pages 574 - 585, XP002259639, ISSN: 1045-9227 *
RISVIK K M ET AL: "Search engines and Web dynamics", COMPUTER NETWORKS, ELSEVIER SCIENCE PUBLISHERS B.V., AMSTERDAM, NL, vol. 39, no. 3, 21 June 2002 (2002-06-21), pages 289 - 302, XP004357475, ISSN: 1389-1286 *
SAMUEL KASKI: "Dimensionality Reduction by Random Mapping: Fast Similarity Computation for Clustering", PROCEEDINGS OF INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS 98, 9 May 1998 (1998-05-09), pages 413 - 418, XP002259640, Retrieved from the Internet <URL:http://citeseer.nj.nec.com/kaski98dimensionality.html> [retrieved on 20031024] *
XIA LIN, DAGOBERT SOERGEL, GARY MARCHIONINI: "A self-organizing semantic map for information retrieval", PROCEEDINGS OF THE 14TH ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, September 1991 (1991-09-01), Chicago, Illinois, USA, pages 262 - 269, XP002259641, ISBN: 0-89791-448-1 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004049206A1 (fr) * 2002-11-27 2004-06-10 Sony United Kingdom Limited Stockage et extraction d'informations
US8181201B2 (en) 2005-08-30 2012-05-15 Nds Limited Enhanced electronic program guides
US8220023B2 (en) 2007-02-21 2012-07-10 Nds Limited Method for content presentation
US8843966B2 (en) 2007-02-21 2014-09-23 Cisco Technology Inc. Method for content presentation
WO2011055256A1 (fr) 2009-11-04 2011-05-12 Nds Limited Classement de contenu basé sur les demandes des utilisateurs
US9147012B2 (en) 2009-11-04 2015-09-29 Cisco Technology Inc. User request based content ranking

Also Published As

Publication number Publication date
JP2004110834A (ja) 2004-04-08
CN100449534C (zh) 2009-01-07
CN1495647A (zh) 2004-05-12
US20040130569A1 (en) 2004-07-08

Similar Documents

Publication Publication Date Title
US7502780B2 (en) Information storage and retrieval
EP1565846B1 (fr) Stockage et extraction d&#39;informations
EP1426882A2 (fr) Stockage et récuperation des informations
US8230364B2 (en) Information retrieval
US7627820B2 (en) Information storage and retrieval
EP1494143A2 (fr) Procédé et système de représentation d&#39;éléments d&#39;information dans une pseudo-image
US7668853B2 (en) Information storage and retrieval
US20060053176A1 (en) Information handling
US20050086223A1 (en) Image retrieval based on relevance feedback
EP1400903A1 (fr) Stockage et extraction d&#39;informations
US20040107195A1 (en) Information storage and retrieval
GB2403559A (en) Index updating system employing self organising maps

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

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 IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

17P Request for examination filed

Effective date: 20040909

17Q First examination report despatched

Effective date: 20041004

AKX Designation fees paid

Designated state(s): DE FR GB

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: 20070919