-
Ardo, A.; Lundberg, S.: ¬A regional distributed WWW search and indexing service : the DESIRE way (1998)
0.04
0.039136328 = product of:
0.117408976 = sum of:
0.048439488 = weight(_text_:web in 4190) [ClassicSimilarity], result of:
0.048439488 = score(doc=4190,freq=8.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.43268442 = fieldWeight in 4190, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=4190)
0.009910721 = weight(_text_:information in 4190) [ClassicSimilarity], result of:
0.009910721 = score(doc=4190,freq=4.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.16457605 = fieldWeight in 4190, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=4190)
0.04511566 = weight(_text_:system in 4190) [ClassicSimilarity], result of:
0.04511566 = score(doc=4190,freq=8.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.41757566 = fieldWeight in 4190, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=4190)
0.013943106 = product of:
0.027886212 = sum of:
0.027886212 = weight(_text_:22 in 4190) [ClassicSimilarity], result of:
0.027886212 = score(doc=4190,freq=2.0), product of:
0.120126344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03430388 = queryNorm
0.23214069 = fieldWeight in 4190, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=4190)
0.5 = coord(1/2)
0.33333334 = coord(4/12)
- Abstract
- Creates an open, metadata aware system for distributed, collaborative WWW indexing. The system has 3 main components: a harvester (for collecting information), a database (for making the collection searchable), and a user interface (for making the information available). all components can be distributed across networked computers, thus supporting scalability. The system is metadata aware and thus allows searches on several fields including title, document author and URL. Nordic Web Index (NWI) is an application using this system to create a regional Nordic Web-indexing service. NWI is built using 5 collaborating service points within the Nordic countries. The NWI databases can be used to build additional services
- Date
- 1. 8.1996 22:08:06
- Footnote
- Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia
- Object
- Nordic Web Index
-
Lösse, M.; Svensson, L.: "Classification at a Crossroad" : Internationales UDC-Seminar 2009 in Den Haag, Niederlande (2010)
0.03
0.025175523 = product of:
0.10070209 = sum of:
0.024219744 = weight(_text_:web in 4379) [ClassicSimilarity], result of:
0.024219744 = score(doc=4379,freq=2.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.21634221 = fieldWeight in 4379, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=4379)
0.056763813 = weight(_text_:suche in 4379) [ClassicSimilarity], result of:
0.056763813 = score(doc=4379,freq=2.0), product of:
0.17138755 = queryWeight, product of:
4.996156 = idf(docFreq=812, maxDocs=44218)
0.03430388 = queryNorm
0.3312015 = fieldWeight in 4379, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.996156 = idf(docFreq=812, maxDocs=44218)
0.046875 = fieldNorm(doc=4379)
0.019718532 = product of:
0.039437063 = sum of:
0.039437063 = weight(_text_:22 in 4379) [ClassicSimilarity], result of:
0.039437063 = score(doc=4379,freq=4.0), product of:
0.120126344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03430388 = queryNorm
0.32829654 = fieldWeight in 4379, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=4379)
0.5 = coord(1/2)
0.25 = coord(3/12)
- Abstract
- Am 29. und 30. Oktober 2009 fand in der Königlichen Bibliothek in Den Haag das zweite internationale UDC-Seminar zum Thema "Classification at a Crossroad" statt. Organisiert wurde diese Konferenz - wie auch die erste Konferenz dieser Art im Jahr 2007 - vom UDC-Konsortium (UDCC). Im Mittelpunkt der diesjährigen Veranstaltung stand die Erschließung des World Wide Web unter besserer Nutzung von Klassifikationen (im Besonderen natürlich der UDC), einschließlich benutzerfreundlicher Repräsentationen von Informationen und Wissen. Standards, neue Technologien und Dienste, semantische Suche und der multilinguale Zugriff spielten ebenfalls eine Rolle. 135 Teilnehmer aus 35 Ländern waren dazu nach Den Haag gekommen. Das Programm umfasste mit 22 Vorträgen aus 14 verschiedenen Ländern eine breite Palette, wobei Großbritannien mit fünf Beiträgen am stärksten vertreten war. Die Tagesschwerpunkte wurden an beiden Konferenztagen durch die Eröffnungsvorträge gesetzt, die dann in insgesamt sechs thematischen Sitzungen weiter vertieft wurden.
- Date
- 22. 1.2010 15:06:54
-
Devadason, F.J.; Intaraksa, N.; Patamawongjariya, P.; Desai, K.: Faceted indexing application for organizing and accessing internet resources (2003)
0.02
0.022663467 = product of:
0.09065387 = sum of:
0.036104664 = weight(_text_:web in 3966) [ClassicSimilarity], result of:
0.036104664 = score(doc=3966,freq=10.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.32250395 = fieldWeight in 3966, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=3966)
0.004671959 = weight(_text_:information in 3966) [ClassicSimilarity], result of:
0.004671959 = score(doc=3966,freq=2.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.0775819 = fieldWeight in 3966, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03125 = fieldNorm(doc=3966)
0.04987724 = weight(_text_:system in 3966) [ClassicSimilarity], result of:
0.04987724 = score(doc=3966,freq=22.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.46164727 = fieldWeight in 3966, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03125 = fieldNorm(doc=3966)
0.25 = coord(3/12)
- Abstract
- Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the WWW. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing System of Ranganathan. A prototype software system has been designed to create a database of records specifying Web documents according to the Dublin Core and input a faceted subject heading according to DSIS. Synonymous terms are added to the standard terms in the heading using appropriate symbols. Once the data are entered along with a description and URL of the Web document, the record is stored in the system. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The system stores the surrogates and keeps the faceted subject headings separately after establishing a link. Search is carried out an index entries derived from the faceted subject heading using chain indexing technique. If a single term is input, the system searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved headings is too large (running into more than a page) then the user has the option of entering another search term to be searched in combination. The system searches subject headings already retrieved and look for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL the original document an the web can be accessed. The prototype system developed under Windows NT environment using ASP and web server is under rigorous testing. The database and indexes management routines need further development.
- Source
- Subject retrieval in a networked environment: Proceedings of the IFLA Satellite Meeting held in Dublin, OH, 14-16 August 2001 and sponsored by the IFLA Classification and Indexing Section, the IFLA Information Technology Section and OCLC. Ed.: I.C. McIlwaine
-
Gödert, W.: Facet classification in online retrieval (1991)
0.02
0.020712039 = product of:
0.082848154 = sum of:
0.028543243 = weight(_text_:web in 5825) [ClassicSimilarity], result of:
0.028543243 = score(doc=5825,freq=4.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.25496176 = fieldWeight in 5825, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=5825)
0.008258934 = weight(_text_:information in 5825) [ClassicSimilarity], result of:
0.008258934 = score(doc=5825,freq=4.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.13714671 = fieldWeight in 5825, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=5825)
0.046045978 = weight(_text_:system in 5825) [ClassicSimilarity], result of:
0.046045978 = score(doc=5825,freq=12.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.42618635 = fieldWeight in 5825, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=5825)
0.25 = coord(3/12)
- Abstract
- The study of faceted classification systems has primarily been directed towards application for precombined catalogues or bibliographies, not so much for use in post coordinated retrieval systems. Argues that faceted classification systems in some respects are superior to other techniques of on-line retrieval as far as facet and concept analysis is combined with an expressive notational system in order to guide a form of retrieval which will use Boolean operators (for combining the facets regardless of one special citation order) and truncation for retrieving hierarchically different sets of documents. This point of view is demonstrated by 2 examples. The 1st one uses a short classification system derived from B. Buchanan and the 2nd is built upon the classification system used by Library and Information Science Abstracts (LISA). Further discussion is concerned with some possible consequences which could be derived from a retrieval with PRECIS strings
"Online retrieval" conjures up a very different mental image now than in 1991, the year this article was written, and the year Tim Berners-Lee first revealed the new hypertext system he called the World Wide Web. Gödert shows that truncation and Boolean logic, combined with notation from a faceted classification system, will be a powerful way of searching for information. It undoubtedly is, but no system built now would require a user searching for material on "nervous systems of bone fish" to enter "Fdd$ and Leaa$". This is worth reading for someone interested in seeing how searching and facets can go together, but the web has made this article quite out of date.
-
Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998)
0.02
0.019192733 = product of:
0.07677093 = sum of:
0.048941467 = weight(_text_:web in 1673) [ClassicSimilarity], result of:
0.048941467 = score(doc=1673,freq=6.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.43716836 = fieldWeight in 1673, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.0115625085 = weight(_text_:information in 1673) [ClassicSimilarity], result of:
0.0115625085 = score(doc=1673,freq=4.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.1920054 = fieldWeight in 1673, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.016266957 = product of:
0.032533914 = sum of:
0.032533914 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
0.032533914 = score(doc=1673,freq=2.0), product of:
0.120126344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03430388 = queryNorm
0.2708308 = fieldWeight in 1673, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=1673)
0.5 = coord(1/2)
0.25 = coord(3/12)
- Abstract
- The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib
- Date
- 1. 8.1996 22:08:06
- Footnote
- Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia; vgl. auch: http://www7.scu.edu.au/programme/posters/1846/com1846.htm.
-
Yu, N.: Readings & Web resources for faceted classification
0.02
0.019086568 = product of:
0.1145194 = sum of:
0.03425189 = weight(_text_:web in 4394) [ClassicSimilarity], result of:
0.03425189 = score(doc=4394,freq=4.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.3059541 = fieldWeight in 4394, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=4394)
0.08026751 = weight(_text_:extraction in 4394) [ClassicSimilarity], result of:
0.08026751 = score(doc=4394,freq=2.0), product of:
0.20380433 = queryWeight, product of:
5.941145 = idf(docFreq=315, maxDocs=44218)
0.03430388 = queryNorm
0.39384598 = fieldWeight in 4394, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.941145 = idf(docFreq=315, maxDocs=44218)
0.046875 = fieldNorm(doc=4394)
0.16666667 = coord(2/12)
- Abstract
- The term "facet" has been used in various places, while in most cases it is just a buzz word to replace what is indeed "aspect" or "category". The references below either define and explain the original concept of facet or provide guidelines for building 'real' faceted search/browse. I was interested in faceted classification because it seems to be a natural and efficient way for organizing and browsing Web collections. However, to automatically generate facets and their isolates is extremely difficult since it involves concept extraction and concept grouping, both of which are difficult problems by themselves. And it is almost impossible to achieve mutually exclusive and jointly exhaustive 'true' facets without human judgment. Nowadays, faceted search/browse widely exists, implicitly or explicitly, on a majority of retail websites due to the multi-aspects nature of the data. However, it is still rarely seen on any digital library sites. (I could be wrong since I haven't kept myself updated with this field for a while.)
-
Ellis, D.; Vasconcelos, A.: Ranganathan and the Net : using facet analysis to search and organise the World Wide Web (1999)
0.02
0.0178789 = product of:
0.0715156 = sum of:
0.04194983 = weight(_text_:web in 726) [ClassicSimilarity], result of:
0.04194983 = score(doc=726,freq=6.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.37471575 = fieldWeight in 726, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=726)
0.0070079383 = weight(_text_:information in 726) [ClassicSimilarity], result of:
0.0070079383 = score(doc=726,freq=2.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.116372846 = fieldWeight in 726, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=726)
0.02255783 = weight(_text_:system in 726) [ClassicSimilarity], result of:
0.02255783 = score(doc=726,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.20878783 = fieldWeight in 726, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=726)
0.25 = coord(3/12)
- Abstract
- This article gives a cheerfully brief and undetailed account of how to make a faceted classification system, then describes information retrieval and searching on the web. It concludes by saying that facets would be excellent in helping users search and browse the web, but offers no real clues as to how this can be done.
-
National Seminar on Classification in the Digital Environment : Papers contributed to the National Seminar an Classification in the Digital Environment, Bangalore, 9-11 August 2001 (2001)
0.02
0.016870974 = product of:
0.05061292 = sum of:
0.022834593 = weight(_text_:web in 2047) [ClassicSimilarity], result of:
0.022834593 = score(doc=2047,freq=16.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.2039694 = fieldWeight in 2047, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.015625 = fieldNorm(doc=2047)
0.008092071 = weight(_text_:information in 2047) [ClassicSimilarity], result of:
0.008092071 = score(doc=2047,freq=24.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.1343758 = fieldWeight in 2047, product of:
4.8989797 = tf(freq=24.0), with freq of:
24.0 = termFreq=24.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.015625 = fieldNorm(doc=2047)
0.015038553 = weight(_text_:system in 2047) [ClassicSimilarity], result of:
0.015038553 = score(doc=2047,freq=8.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.13919188 = fieldWeight in 2047, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.015625 = fieldNorm(doc=2047)
0.0046477024 = product of:
0.009295405 = sum of:
0.009295405 = weight(_text_:22 in 2047) [ClassicSimilarity], result of:
0.009295405 = score(doc=2047,freq=2.0), product of:
0.120126344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03430388 = queryNorm
0.07738023 = fieldWeight in 2047, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.015625 = fieldNorm(doc=2047)
0.5 = coord(1/2)
0.33333334 = coord(4/12)
- Date
- 2. 1.2004 10:35:22
- Footnote
- Rez. in: Knowledge organization 30(2003) no.1, S.40-42 (J.-E. Mai): "Introduction: This is a collection of papers presented at the National Seminar an Classification in the Digital Environment held in Bangalore, India, an August 9-11 2001. The collection contains 18 papers dealing with various issues related to knowledge organization and classification theory. The issue of transferring the knowledge, traditions, and theories of bibliographic classification to the digital environment is an important one, and I was excited to learn that proceedings from this seminar were available. Many of us experience frustration an a daily basis due to poorly constructed Web search mechanisms and Web directories. As a community devoted to making information easily accessible we have something to offer the Web community and a seminar an the topic was indeed much needed. Below are brief summaries of the 18 papers presented at the seminar. The order of the summaries follows the order of the papers in the proceedings. The titles of the paper are given in parentheses after the author's name. AHUJA and WESLEY (From "Subject" to "Need": Shift in Approach to Classifying Information an the Internet/Web) argue that traditional bibliographic classification systems fall in the digital environment. One problem is that bibliographic classification systems have been developed to organize library books an shelves and as such are unidimensional and tied to the paper-based environment. Another problem is that they are "subject" oriented in the sense that they assume a relatively stable universe of knowledge containing basic and fixed compartments of knowledge that can be identified and represented. Ahuja and Wesley suggest that classification in the digital environment should be need-oriented instead of subjectoriented ("One important link that binds knowledge and human being is his societal need. ... Hence, it will be ideal to organise knowledge based upon need instead of subject." (p. 10)).
AHUJA and SATIJA (Relevance of Ranganathan's Classification Theory in the Age of Digital Libraries) note that traditional bibliographic classification systems have been applied in the digital environment with only limited success. They find that the "inherent flexibility of electronic manipulation of documents or their surrogates should allow a more organic approach to allocation of new subjects and appropriate linkages between subject hierarchies." (p. 18). Ahija and Satija also suggest that it is necessary to shift from a "subject" focus to a "need" focus when applying classification theory in the digital environment. They find Ranganathan's framework applicable in the digital environment. Although Ranganathan's focus is "subject oriented and hence emphasise the hierarchical and linear relationships" (p. 26), his framework "can be successfully adopted with certain modifications ... in the digital environment." (p. 26). SHAH and KUMAR (Model for System Unification of Geographical Schedules (Space Isolates)) report an a plan to develop a single schedule for geographical Subdivision that could be used across all classification systems. The authors argue that this is needed in order to facilitate interoperability in the digital environment. SAN SEGUNDO MANUEL (The Representation of Knowledge as a Symbolization of Productive Electronic Information) distills different approaches and definitions of the term "representation" as it relates to representation of knowledge in the library and information science literature and field. SHARADA (Linguistic and Document Classification: Paradigmatic Merger Possibilities) suggests the development of a universal indexing language. The foundation for the universal indexing language is Chomsky's Minimalist Program and Ranganathan's analytico-synthetic classification theory; Acording to the author, based an these approaches, it "should not be a problem" (p. 62) to develop a universal indexing language.
SELVI (Knowledge Classification of Digital Information Materials with Special Reference to Clustering Technique) finds that it is essential to classify digital material since the amount of material that is becoming available is growing. Selvi suggests using automated classification to "group together those digital information materials or documents that are "most similar" (p. 65). This can be attained by using Cluster analysis methods. PRADHAN and THULASI (A Study of the Use of Classification and Indexing Systems by Web Resource Directories) compare and contrast the classificatory structures of Google, Yahoo, and Looksmart's directories and compare the directories to Dewey Decimal Classification, Library of Congress Classification and Colon Classification's classificatory structures. They find differentes between the directories' and the bibliographic classification systems' classificatory structures and principles. These differentes stem from the fact that bibliographic classification systems are used to "classify academic resources for the research community" (p. 83) and directories "aim to categorize a wider breath of information groups, entertainment, recreation, govt. information, commercial information" (p. 83). NEELAMEGHAN (Hierarchy, Hierarchical Relation and Hierarchical Arrangement) reviews the concept of hierarchy and the formation of hierarchical structures across a variety of domains. NEELAMEGHAN and PRADAD (Digitized Schemes for Subject Classification and Thesauri: Complementary Roles) demonstrate how thesaural relationships (NT, BT, and RT) can be applied to a classification scheme, the Colon Classification in this Gase. NEELAMEGHAN and ASUNDI (Metadata Framework for Describing Embodied Knowledge and Subject Content) propose to use the Generalized Facet Structure framework which is based an Ranganathan's General Theory of Knowledge Classification as a framework for describing the content of documents in a metadata element set for the representation of web documents. CHUDAMANI (Classified Catalogue as a Tool for Subject Based Information Retrieval in both Traditional and Electronic Library Environment) explains why the classified catalogue is superior to the alphabetic cata logue and argues that the same is true in the digital environment.
PARAMESWARAN (Classification and Indexing: Impact of Classification Theory an PRECIS) reviews the PRECIS system and finds that "it Gould not escape from the impact of the theory of classification" (p. 131). The author further argues that the purpose of classification and subject indexing is the same and that both approaches depends an syntax. This leads to the conclusion that "there is an absolute syntax as the Indian theory of classification points out" (p. 131). SATYAPAL and SANJIVINI SATYAPAL (Classifying Documents According to Postulational Approach: 1. SA TSAN- A Computer Based Learning Package) and SATYAPAL and SANJIVINI SATYAPAL (Classifying Documents According to Postulational Approach: 2. Semi-Automatic Synthesis of CC Numbers) present an application to automate classification using a facet classification system, in this Gase, the Colon Classification system. GAIKAIWARI (An Interactive Application for Faceted Classification Systems) presents an application, called SRR, for managing and using a faceted classification scheme in a digital environment. IYER (Use of Instructional Technology to Support Traditional Classroom Learning: A Case Study) describes a course an "Information and Knowledge Organization" that she teaches at the University at Albany (SUNY). The course is a conceptual course that introduces the student to various aspects of knowledge organization. GOPINATH (Universal Classification: How can it be used?) lists fifteen uses of universal classifications and discusses the entities of a number of disciplines. GOPINATH (Knowledge Classification: The Theory of Classification) briefly reviews the foundations for research in automatic classification, summarizes the history of classification, and places Ranganathan's thought in the history of classification.
Discussion The proceedings of the National Seminar an Classification in the Digital Environment give some insights. However, the depth of analysis and discussion is very uneven across the papers. Some of the papers have substantive research content while others appear to be notes used in the oral presentation. The treatments of the topics are very general in nature. Some papers have a very limited list of references while others have no bibliography. No index has been provided. The transfer of bibliographic knowledge organization theory to the digital environment is an important topic. However, as the papers at this conference have shown, it is also a difficult task. Of the 18 papers presented at this seminar an classification in the digital environment, only 4-5 papers actually deal directly with this important topic. The remaining papers deal with issues that are more or less relevant to classification in the digital environment without explicitly discussing the relation. The reason could be that the authors take up issues in knowledge organization that still need to be investigated and clarified before their application in the digital environment can be considered. Nonetheless, one wishes that the knowledge organization community would discuss the application of classification theory in the digital environment in greater detail. It is obvious from the comparisons of the classificatory structures of bibliographic classification systems and Web directories that these are different and that they probably should be different, since they serve different purposes. Interesting questions in the transformation of bibliographic classification theories to the digital environment are: "Given the existing principles in bibliographic knowledge organization, what are the optimum principles for organization of information, irrespectively of context?" and "What are the fundamental theoretical and practical principles for the construction of Web directories?" Unfortunately, the papers presented at this seminar do not attempt to answer or discuss these questions."
-
McIlwaine, I.C.: ¬The UDC and the World Wide Web (2003)
0.02
0.016251095 = product of:
0.06500438 = sum of:
0.04036624 = weight(_text_:web in 3814) [ClassicSimilarity], result of:
0.04036624 = score(doc=3814,freq=8.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.36057037 = fieldWeight in 3814, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=3814)
0.0058399485 = weight(_text_:information in 3814) [ClassicSimilarity], result of:
0.0058399485 = score(doc=3814,freq=2.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.09697737 = fieldWeight in 3814, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=3814)
0.018798191 = weight(_text_:system in 3814) [ClassicSimilarity], result of:
0.018798191 = score(doc=3814,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.17398985 = fieldWeight in 3814, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=3814)
0.25 = coord(3/12)
- Abstract
- The paper examines the potentiality of the Universal Decimal Classification as a means for retrieving subjects from the World Wide Web. The analytico-synthetic basis of the scheme provides the facility to link concepts at the input or search stage and to isolate concepts via the notation so as to retrieve the separate parts of a compound subject individually if required. Its notation permits hierarchical searching and overrides the shortcomings of natural language. Recent revisions have been constructed with this purpose in mind, the most recent being for Management. The use of the classification embedded in metadata, as in the GERHARD system or as a basis for subject trees is discussed. Its application as a gazetteer is another Web application to which it is put. The range of up to date editions in many languages and the availability of a Web-based version make its use as a switching language increasingly valuable.
- Source
- Subject retrieval in a networked environment: Proceedings of the IFLA Satellite Meeting held in Dublin, OH, 14-16 August 2001 and sponsored by the IFLA Classification and Indexing Section, the IFLA Information Technology Section and OCLC. Ed.: I.C. McIlwaine
-
Denton, W.: Putting facets on the Web : an annotated bibliography (2003)
0.02
0.01612761 = product of:
0.06451044 = sum of:
0.03495819 = weight(_text_:web in 2467) [ClassicSimilarity], result of:
0.03495819 = score(doc=2467,freq=24.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.3122631 = fieldWeight in 2467, product of:
4.8989797 = tf(freq=24.0), with freq of:
24.0 = termFreq=24.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.01953125 = fieldNorm(doc=2467)
0.006529261 = weight(_text_:information in 2467) [ClassicSimilarity], result of:
0.006529261 = score(doc=2467,freq=10.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.10842399 = fieldWeight in 2467, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.01953125 = fieldNorm(doc=2467)
0.023022989 = weight(_text_:system in 2467) [ClassicSimilarity], result of:
0.023022989 = score(doc=2467,freq=12.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.21309318 = fieldWeight in 2467, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.01953125 = fieldNorm(doc=2467)
0.25 = coord(3/12)
- Abstract
- This is a classified, annotated bibliography about how to design faceted classification systems and make them usable on the World Wide Web. It is the first of three works I will be doing. The second, based on the material here and elsewhere, will discuss how to actually make the faceted system and put it online. The third will be a report of how I did just that, what worked, what didn't, and what I learned. Almost every article or book listed here begins with an explanation of what a faceted classification system is, so I won't (but see Steckel in Background below if you don't already know). They all agree that faceted systems are very appropriate for the web. Even pre-web articles (such as Duncan's in Background, below) assert that hypertext and facets will go together well. Combined, it is possible to take a set of documents and classify them or apply subject headings to describe what they are about, then build a navigational structure so that any user, no matter how he or she approaches the material, no matter what his or her goals, can move and search in a way that makes sense to them, but still get to the same useful results as someone else following a different path to the same goal. There is no one way that everyone will always use when looking for information. The more flexible the organization of the information, the more accommodating it is. Facets are more flexible for hypertext browsing than any enumerative or hierarchical system.
Consider movie listings in newspapers. Most Canadian newspapers list movie showtimes in two large blocks, for the two major theatre chains. The listings are ordered by region (in large cities), then theatre, then movie, and finally by showtime. Anyone wondering where and when a particular movie is playing must scan the complete listings. Determining what movies are playing in the next half hour is very difficult. When movie listings went onto the web, most sites used a simple faceted organization, always with movie name and theatre, and perhaps with region or neighbourhood (thankfully, theatre chains were left out). They make it easy to pick a theatre and see what movies are playing there, or to pick a movie and see what theatres are showing it. To complete the system, the sites should allow users to browse by neighbourhood and showtime, and to order the results in any way they desired. Thus could people easily find answers to such questions as, "Where is the new James Bond movie playing?" "What's showing at the Roxy tonight?" "I'm going to be out in in Little Finland this afternoon with three hours to kill starting at 2 ... is anything interesting playing?" A hypertext, faceted classification system makes more useful information more easily available to the user. Reading the books and articles below in chronological order will show a certain progression: suggestions that faceting and hypertext might work well, confidence that facets would work well if only someone would make such a system, and finally the beginning of serious work on actually designing, building, and testing faceted web sites. There is a solid basis of how to make faceted classifications (see Vickery in Recommended), but their application online is just starting. Work on XFML (see Van Dijck's work in Recommended) the Exchangeable Faceted Metadata Language, will make this easier. If it follows previous patterns, parts of the Internet community will embrace the idea and make open source software available for others to reuse. It will be particularly beneficial if professionals in both information studies and computer science can work together to build working systems, standards, and code. Each can benefit from the other's expertise in what can be a very complicated and technical area. One particularly nice thing about this area of research is that people interested in combining facets and the web often have web sites where they post their writings.
This bibliography is not meant to be exhaustive, but unfortunately it is not as complete as I wanted. Some books and articles are not be included, but they may be used in my future work. (These include two books and one article by B.C. Vickery: Faceted Classification Schemes (New Brunswick, NJ: Rutgers, 1966), Classification and Indexing in Science, 3rd ed. (London: Butterworths, 1975), and "Knowledge Representation: A Brief Review" (Journal of Documentation 42 no. 3 (September 1986): 145-159; and A.C. Foskett's "The Future of Faceted Classification" in The Future of Classification, edited by Rita Marcella and Arthur Maltby (Aldershot, England: Gower, 2000): 69-80). Nevertheless, I hope this bibliography will be useful for those both new to or familiar with faceted hypertext systems. Some very basic resources are listed, as well as some very advanced ones. Some example web sites are mentioned, but there is no detailed technical discussion of any software. The user interface to any web site is extremely important, and this is briefly mentioned in two or three places (for example the discussion of lawforwa.org (see Example Web Sites)). The larger question of how to display information graphically and with hypertext is outside the scope of this bibliography. There are five sections: Recommended, Background, Not Relevant, Example Web Sites, and Mailing Lists. Background material is either introductory, advanced, or of peripheral interest, and can be read after the Recommended resources if the reader wants to know more. The Not Relevant category contains articles that may appear in bibliographies but are not relevant for my purposes.
-
Gnoli, C.; Mei, H.: Freely faceted classification for Web-based information retrieval (2006)
0.02
0.015954414 = product of:
0.06381766 = sum of:
0.03425189 = weight(_text_:web in 534) [ClassicSimilarity], result of:
0.03425189 = score(doc=534,freq=4.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.3059541 = fieldWeight in 534, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=534)
0.0070079383 = weight(_text_:information in 534) [ClassicSimilarity], result of:
0.0070079383 = score(doc=534,freq=2.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.116372846 = fieldWeight in 534, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=534)
0.02255783 = weight(_text_:system in 534) [ClassicSimilarity], result of:
0.02255783 = score(doc=534,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.20878783 = fieldWeight in 534, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=534)
0.25 = coord(3/12)
- Abstract
- In free classification, each concept is expressed by a constant notation, and classmarks are formed by free combinations of them, allowing the retrieval of records from a database by searching any of the component concepts. A refinement of free classification is freely faceted classification, where notation can include facets, expressing the kind of relations held between the concepts. The Integrative Level Classification project aims at testing free and freely faceted classification by applying them to small bibliographical samples in various domains. A sample, called the Dandelion Bibliography of Facet Analysis, is described here. Experience was gained using this system to classify 300 specialized papers dealing with facet analysis itself recorded on a MySQL database and building a Web interface exploiting freely faceted notation. The interface is written in PHP and uses string functions to process the queries and to yield relevant results selected and ordered according to the principles of integrative levels.
-
Devadason, F.J.; Intaraksa, N.; Patamawongjariya, P.; Desai, K.: Faceted indexing based system for organizing and accessing Internet resources (2002)
0.02
0.015432579 = product of:
0.09259547 = sum of:
0.03996054 = weight(_text_:web in 97) [ClassicSimilarity], result of:
0.03996054 = score(doc=97,freq=16.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.35694647 = fieldWeight in 97, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02734375 = fieldNorm(doc=97)
0.052634936 = weight(_text_:system in 97) [ClassicSimilarity], result of:
0.052634936 = score(doc=97,freq=32.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.4871716 = fieldWeight in 97, product of:
5.656854 = tf(freq=32.0), with freq of:
32.0 = termFreq=32.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.02734375 = fieldNorm(doc=97)
0.16666667 = coord(2/12)
- Abstract
- Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the World Wide Web. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing system of Ranganathan. A prototype Software System has been designed to create a database of records specifying Web documents according to the Dublin Core and to input a faceted subject heading according to DSIS. Synonymous terms are added to the Standard terms in the heading using appropriate symbols. Once the data are entered along with a description and the URL of the web document, the record is stored in the System. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The System stores the Surrogates and keeps the faceted subject headings separately after establishing a link. The search is carried out an index entries derived from the faceted subject heading using the chain indexing technique. If a single term is Input, the System searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved Keadings is too large (running into more than a page) the user has the option of entering another search term to be searched in combination. The System searches subject headings already retrieved and looks for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL, the original document an the web can be accessed. The prototype system developed in a Windows NT environment using ASP and a web server is under rigorous testing. The database and Index management routines need further development.
An interesting but somewhat confusing article telling how the writers described web pages with Dublin Core metadata, including a faceted classification, and built a system that lets users browse the collection through the facets. They seem to want to cover too much in a short article, and unnecessary space is given over to screen shots showing how Dublin Core metadata was entered. The screen shots of the resulting browsable system are, unfortunately, not as enlightening as one would hope, and there is no discussion of how the system was actually written or the technology behind it. Still, it could be worth reading as an example of such a system and how it is treated in journals.
- Footnote
- Vgl. auch: Devadason, F.J.: Facet analysis and Semantic Web: musings of a student of Ranganathan. Unter: http://www.geocities.com/devadason.geo/FASEMWEB.html#FacetedIndex.
-
Dack, D.: Australian attends conference on Dewey (1989)
0.01
0.014734071 = product of:
0.058936283 = sum of:
0.016351856 = weight(_text_:information in 2509) [ClassicSimilarity], result of:
0.016351856 = score(doc=2509,freq=8.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.27153665 = fieldWeight in 2509, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=2509)
0.026317468 = weight(_text_:system in 2509) [ClassicSimilarity], result of:
0.026317468 = score(doc=2509,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.2435858 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=2509)
0.016266957 = product of:
0.032533914 = sum of:
0.032533914 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
0.032533914 = score(doc=2509,freq=2.0), product of:
0.120126344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03430388 = queryNorm
0.2708308 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=2509)
0.5 = coord(1/2)
0.25 = coord(3/12)
- Abstract
- Edited version of a report to the Australian Library and Information Association on the Conference on classification theory in the computer age, Albany, New York, 18-19 Nov 88, and on the meeting of the Dewey Editorial Policy Committee which preceded it. The focus of the Editorial Policy Committee Meeting lay in the following areas: browsing; potential for improved subject access; system design; potential conflict between shelf location and information retrieval; and users. At the Conference on classification theory in the computer age the following papers were presented: Applications of artificial intelligence to bibliographic classification, by Irene Travis; Automation and classification, By Elaine Svenonious; Subject classification and language processing for retrieval in large data bases, by Diana Scott; Implications for information processing, by Carol Mandel; and implications for information science education, by Richard Halsey.
- Date
- 8.11.1995 11:52:22
-
Vizine-Goetz, D.: OCLC investigates using classification tools to organize Internet data (1998)
0.01
0.014186387 = product of:
0.056745548 = sum of:
0.014161124 = weight(_text_:information in 2342) [ClassicSimilarity], result of:
0.014161124 = score(doc=2342,freq=6.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.23515764 = fieldWeight in 2342, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=2342)
0.026317468 = weight(_text_:system in 2342) [ClassicSimilarity], result of:
0.026317468 = score(doc=2342,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.2435858 = fieldWeight in 2342, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=2342)
0.016266957 = product of:
0.032533914 = sum of:
0.032533914 = weight(_text_:22 in 2342) [ClassicSimilarity], result of:
0.032533914 = score(doc=2342,freq=2.0), product of:
0.120126344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03430388 = queryNorm
0.2708308 = fieldWeight in 2342, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=2342)
0.5 = coord(1/2)
0.25 = coord(3/12)
- Abstract
- The knowledge structures that form traditional library classification schemes hold great potential for improving resource description and discovery on the Internet and for organizing electronic document collections. The advantages of assigning subject tokens (classes) to documents from a scheme like the DDC system are well documented
- Date
- 22. 9.1997 19:16:05
- Imprint
- Urbana-Champaign, IL : Illinois University at Urbana-Champaign, Graduate School of Library and Information Science
- Source
- Visualizing subject access for 21st century information resources: Papers presented at the 1997 Clinic on Library Applications of Data Processing, 2-4 Mar 1997, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign. Ed.: P.A. Cochrane et al
-
Bar-Ilan, J.; Belous, Y.: Children as architects of Web directories : an exploratory study (2007)
0.01
0.013900092 = product of:
0.055600367 = sum of:
0.028543243 = weight(_text_:web in 289) [ClassicSimilarity], result of:
0.028543243 = score(doc=289,freq=4.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.25496176 = fieldWeight in 289, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=289)
0.008258934 = weight(_text_:information in 289) [ClassicSimilarity], result of:
0.008258934 = score(doc=289,freq=4.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.13714671 = fieldWeight in 289, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=289)
0.018798191 = weight(_text_:system in 289) [ClassicSimilarity], result of:
0.018798191 = score(doc=289,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.17398985 = fieldWeight in 289, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=289)
0.25 = coord(3/12)
- Abstract
- Children are increasingly using the Web. Cognitive theory tells us that directory structures are especially suited for information retrieval by children; however, empirical results show that they prefer keyword searching. One of the reasons for these findings could be that the directory structures and terminology are created by grown-ups. Using a card-sorting method and an enveloping system, we simulated the structure of a directory. Our goal was to try to understand what browsable, hierarchical subject categories children create when suggested terms are supplied and they are free to add or delete terms. Twelve groups of four children each (fourth and fifth graders) participated in our exploratory study. The initial terminology presented to the children was based on names of categories used in popular directories, in the sections on Arts, Television, Music, Cinema, and Celebrities. The children were allowed to introduce additional cards and change the terms appearing on the 61 cards. Findings show that the different groups reached reasonable consensus; the majority of the category names used by existing directories were acceptable by them and only a small minority of the terms caused confusion. Our recommendation is to include children in the design process of directories, not only in designing the interface but also in designing the content structure as well.
- Source
- Journal of the American Society for Information Science and Technology. 58(2007) no.6, S.895-907
-
Peereboom, M.: Dwerg tussen reuzen? : het Nederlandse basisclassificatie Web (1997)
0.01
0.013805035 = product of:
0.082830206 = sum of:
0.05651274 = weight(_text_:web in 515) [ClassicSimilarity], result of:
0.05651274 = score(doc=515,freq=8.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.50479853 = fieldWeight in 515, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=515)
0.026317468 = weight(_text_:system in 515) [ClassicSimilarity], result of:
0.026317468 = score(doc=515,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.2435858 = fieldWeight in 515, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=515)
0.16666667 = coord(2/12)
- Abstract
- Developments in electronic communication technology have meda online databases a normal part of library collections. To provide users with direct access to Internet resources the Dutch Royal Library has cooperated with several university libraries in the Netherlands to develop the Nederlandse Basisclassificatie Web. Subject specialists select sources, add English summaries and NBW code, and input them to the online database. A Web desk and training workshops have been provided to assist users, and improvements to the system will simplify search procedures
- Footnote
- Übers. d. Titels: A dwarf amongst giants?: the Dutch Basic classification of Web resources
-
Koch, T.; Golub, K.; Ardö, A.: Users browsing behaviour in a DDC-based Web service : a log analysis (2006)
0.01
0.013390179 = product of:
0.08034107 = sum of:
0.048439488 = weight(_text_:web in 2234) [ClassicSimilarity], result of:
0.048439488 = score(doc=2234,freq=8.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.43268442 = fieldWeight in 2234, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=2234)
0.031901587 = weight(_text_:system in 2234) [ClassicSimilarity], result of:
0.031901587 = score(doc=2234,freq=4.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.29527056 = fieldWeight in 2234, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=2234)
0.16666667 = coord(2/12)
- Abstract
- This study explores the navigation behaviour of all users of a large web service, Renardus, using web log analysis. Renardus provides integrated searching and browsing access to quality-controlled web resources from major individual subject gateway services. The main navigation feature is subject browsing through the Dewey Decimal Classification (DDC) based on mapping of classes of resources from the distributed gateways to the DDC structure. Among the more surprising results are the hugely dominant share of browsing activities, the good use of browsing support features like the graphical fish-eye overviews, rather long and varied navigation sequences, as well as extensive hierarchical directory-style browsing through the large DDC system.
- Footnote
- Beitrag in einem Themenheft "Moving beyond the presentation layer: content and context in the Dewey Decimal Classification (DDC) System"
-
Broughton, V.; Lane, H.: Classification schemes revisited : applications to Web indexing and searching (2000)
0.01
0.013295346 = product of:
0.053181384 = sum of:
0.028543243 = weight(_text_:web in 2476) [ClassicSimilarity], result of:
0.028543243 = score(doc=2476,freq=4.0), product of:
0.111951075 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03430388 = queryNorm
0.25496176 = fieldWeight in 2476, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=2476)
0.0058399485 = weight(_text_:information in 2476) [ClassicSimilarity], result of:
0.0058399485 = score(doc=2476,freq=2.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.09697737 = fieldWeight in 2476, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0390625 = fieldNorm(doc=2476)
0.018798191 = weight(_text_:system in 2476) [ClassicSimilarity], result of:
0.018798191 = score(doc=2476,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.17398985 = fieldWeight in 2476, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=2476)
0.25 = coord(3/12)
- Content
- A short discussion of using classification systems to organize the web, one of many such. The authors are both involved with BC2 and naturally think it is the best system for organizing information online. They list reasons why faceted classifications are best (e.g. no theoretical limits to specificity or exhaustivity; easier to handle complex subjects; flexible enough to accommodate different user needs) and take a brief look at how BC2 works. They conclude with a discussion of how and why it should be applied to online resources, and a plea for recognition of the importance of classification and subject analysis skills, even when full-text searching is available and databases respond instantly.
-
Oberhauser, O.: Praktische Lösungen für lokale Systematiken (2) : Ein einfaches Interface für den Online-Katalog (2007)
0.01
0.013220275 = product of:
0.079321645 = sum of:
0.056763813 = weight(_text_:suche in 724) [ClassicSimilarity], result of:
0.056763813 = score(doc=724,freq=2.0), product of:
0.17138755 = queryWeight, product of:
4.996156 = idf(docFreq=812, maxDocs=44218)
0.03430388 = queryNorm
0.3312015 = fieldWeight in 724, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.996156 = idf(docFreq=812, maxDocs=44218)
0.046875 = fieldNorm(doc=724)
0.02255783 = weight(_text_:system in 724) [ClassicSimilarity], result of:
0.02255783 = score(doc=724,freq=2.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.20878783 = fieldWeight in 724, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=724)
0.16666667 = coord(2/12)
- Abstract
- Der Beitrag berichtet über die Erstellung eines hierarchischen Browse- und Abfrage-Interfaces für die lokale Systematik der Bibliothek der Sigmund Freud Privatstiftung (Wien), deren Online-Katalog an der Zentrale des Österreichischen Bibliothekenverbundes (OBVSG) unter Aleph 500 geführt wird. Da dieses System selbst keinerlei Features für die klassifikatorische Recherche vorsieht, wurden 25 HTLM-Seiten in den OPAC integriert, die eine hierarchische Navigation auf den drei Ebenen der Systematik ermöglichen. Mittels eines wöchentlich automatisch eingesetzten Perl-Programms wird dabei auch angezeigt, mit welchen Treffermengen in der jeweiligen Klasse bzw. den zugehörigen Unterklassen (in etwa) zu rechnen ist; diese Anzeige ist ausserdem mit der unmittelbaren Suche nach den betreffenden Titeln verlinkt. Da vonseiten der Bibliothek lediglich die Notationen katalogisiert werden, erfolgt bei der Titel-Vollanzeige mittels einer JavaScript-basierten Umnutzung der Aleph-Funktion "Suchdienste" ebenfalls ein Link auf das hierarchische Interface, um die Bedeutung der jeweiligen Notation im systematischen Kontext zu veranschaulichen.
-
Chandler, A.; LeBlanc, J.: Exploring the potential of a virtual undergraduate library collection based on the hierarchical interface to LC Classification (2006)
0.01
0.013213158 = product of:
0.05285263 = sum of:
0.0070079383 = weight(_text_:information in 769) [ClassicSimilarity], result of:
0.0070079383 = score(doc=769,freq=2.0), product of:
0.060219705 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.03430388 = queryNorm
0.116372846 = fieldWeight in 769, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=769)
0.031901587 = weight(_text_:system in 769) [ClassicSimilarity], result of:
0.031901587 = score(doc=769,freq=4.0), product of:
0.10804188 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03430388 = queryNorm
0.29527056 = fieldWeight in 769, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=769)
0.013943106 = product of:
0.027886212 = sum of:
0.027886212 = weight(_text_:22 in 769) [ClassicSimilarity], result of:
0.027886212 = score(doc=769,freq=2.0), product of:
0.120126344 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03430388 = queryNorm
0.23214069 = fieldWeight in 769, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=769)
0.5 = coord(1/2)
0.25 = coord(3/12)
- Abstract
- The Hierarchical Interface to Library of Congress Classification (HILCC) is a system developed by the Columbia University Library to leverage call number data from the MARC holdings records in Columbia's online catalog to create a structured, hierarchical menuing system that provides subject access to the library's electronic resources. In this paper, the authors describe a research initiative at the Cornell University Library to discover if the Columbia HILCC scheme can be used as developed or in modified form to create a virtual undergraduate print collection outside the context of the traditional online catalog. Their results indicate that, with certain adjustments, an HILCC model can indeed, be used to represent the holdings of a large research library's undergraduate collection of approximately 150,000 titles, but that such a model is not infinitely scalable and may require a new approach to browsing such a large information space.
- Date
- 10. 9.2000 17:38:22
