About: Using Singular Value Decomposition (SVD) as a solution for search result clustering

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Using Singular Value Decomposition (SVD) as a solution for search result clustering Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	There are many search engines in the web, but they return a long list of search results, ranked by their relevancies to the given query. Web users have to go through the list and examine the titles and (short) snippets sequentially to identify their required results. In this paper we present how usage of Singular Value Decomposition (SVD) as a very good solution for search results clustering. There are many search engines in the web, but they return a long list of search results, ranked by their relevancies to the given query. Web users have to go through the list and examine the titles and (short) snippets sequentially to identify their required results. In this paper we present how usage of Singular Value Decomposition (SVD) as a very good solution for search results clustering. (en)
Title	Using Singular Value Decomposition (SVD) as a solution for search result clustering Using Singular Value Decomposition (SVD) as a solution for search result clustering (en)
skos:prefLabel	Using Singular Value Decomposition (SVD) as a solution for search result clustering Using Singular Value Decomposition (SVD) as a solution for search result clustering (en)
skos:notation	RIV/61989100:27240/08:86075664!RIV11-MSM-27240___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Abdulla, Hussam Snášel, Václav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	401891
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/08:86075664
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	clustering; result; search; for; solution; (SVD); Decomposition; Value; Singular; Using (en)
http://linked.open.../riv/klicoveSlovo	Value clustering for (SVD) search Decomposition Using result solution Singular
http://linked.open...ontrolniKodProRIV	[B7874424407D]
http://linked.open...v/mistoKonaniAkce	U ARAB EMIRATES
http://linked.open...i/riv/mistoVydani	NEW YORK
http://linked.open...i/riv/nazevZdroje	IIT: 2008 INTERNATIONAL CONFERENCE ON INNOVATIONS IN INFORMATION TECHNOLOGY
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Snášel, Václav Abdulla, Hussam
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000274017600015
http://linked.open.../riv/zahajeniAkce	2008-12-16 (xsd:date)
number of pages	5 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
https://schema.org/isbn	978-1-4244-3396-4
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 91 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software