Search (71 results, page 1 of 4)

  • × language_ss:"e"
  • × theme_ss:"Automatisches Klassifizieren"
  • × year_i:[2000 TO 2010}
  1. Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004) 0.27 
    0.2656926 = product of:
  0.5313852 = sum of:
    0.03902899 = product of:
      0.11708697 = sum of:
        0.11708697 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
          0.11708697 = score(doc=562,freq=2.0), product of:
            0.20833312 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.024573348 = queryNorm
            0.56201804 = fieldWeight in 562, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.046875 = fieldNorm(doc=562)
      0.33333334 = coord(1/3)
    0.017349645 = weight(_text_:web in 562) [ClassicSimilarity], result of:
      0.017349645 = score(doc=562,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.21634221 = fieldWeight in 562, 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=562)
    0.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = queryNorm
        0.56201804 = fieldWeight in 562, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=562)
    0.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = queryNorm
        0.56201804 = fieldWeight in 562, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=562)
    0.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = queryNorm
        0.56201804 = fieldWeight in 562, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=562)
    0.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = queryNorm
        0.56201804 = fieldWeight in 562, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=562)
    0.006658699 = product of:
      0.019976096 = sum of:
        0.019976096 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
          0.019976096 = score(doc=562,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = queryNorm
            0.23214069 = fieldWeight in 562, 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=562)
      0.33333334 = coord(1/3)
  0.5 = coord(7/14)
    Content
    Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.
    Date
    8. 1.2013 10:22:32
  2. Classification, automation, and new media : Proceedings of the 24th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Passau, March 15 - 17, 2000 (2002) 0.04 
    0.04205236 = product of:
  0.19624433 = sum of:
    0.025042059 = weight(_text_:web in 5997) [ClassicSimilarity], result of:
      0.025042059 = score(doc=5997,freq=6.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.3122631 = fieldWeight in 5997, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5997)
    0.005916231 = weight(_text_:information in 5997) [ClassicSimilarity], result of:
      0.005916231 = score(doc=5997,freq=4.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.13714671 = fieldWeight in 5997, 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=5997)
    0.16528603 = weight(_text_:kongress in 5997) [ClassicSimilarity], result of:
      0.16528603 = score(doc=5997,freq=16.0), product of:
        0.16122791 = queryWeight, product of:
          6.5610886 = idf(docFreq=169, maxDocs=44218)
          0.024573348 = queryNorm
        1.0251701 = fieldWeight in 5997, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          6.5610886 = idf(docFreq=169, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5997)
  0.21428572 = coord(3/14)
    Abstract
    Given the huge amount of information in the internet and in practically every domain of knowledge that we are facing today, knowledge discovery calls for automation. The book deals with methods from classification and data analysis that respond effectively to this rapidly growing challenge. The interested reader will find new methodological insights as well as applications in economics, management science, finance, and marketing, and in pattern recognition, biology, health, and archaeology.
    Content
    Data Analysis, Statistics, and Classification.- Pattern Recognition and Automation.- Data Mining, Information Processing, and Automation.- New Media, Web Mining, and Automation.- Applications in Management Science, Finance, and Marketing.- Applications in Medicine, Biology, Archaeology, and Others.- Author Index.- Subject Index.
    RSWK
    Datenanalyse / Kongress / Passau <2000>
    Automatische Klassifikation / Kongress / Passau <2000>
    Data Mining / Kongress / Passau <2000>
    World Wide Web / Wissensorganisation / Kongress / Passau <2000>
    Subject
    Datenanalyse / Kongress / Passau <2000>
    Automatische Klassifikation / Kongress / Passau <2000>
    Data Mining / Kongress / Passau <2000>
    World Wide Web / Wissensorganisation / Kongress / Passau <2000>
  3. Calado, P.; Cristo, M.; Gonçalves, M.A.; Moura, E.S. de; Ribeiro-Neto, B.; Ziviani, N.: Link-based similarity measures for the classification of Web documents (2006) 0.01 
    0.013749042 = product of:
  0.064162195 = sum of:
    0.043374117 = weight(_text_:web in 4921) [ClassicSimilarity], result of:
      0.043374117 = score(doc=4921,freq=18.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.5408555 = fieldWeight in 4921, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4921)
    0.008366814 = weight(_text_:information in 4921) [ClassicSimilarity], result of:
      0.008366814 = score(doc=4921,freq=8.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.19395474 = fieldWeight in 4921, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4921)
    0.012421262 = weight(_text_:retrieval in 4921) [ClassicSimilarity], result of:
      0.012421262 = score(doc=4921,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.16710453 = fieldWeight in 4921, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4921)
  0.21428572 = coord(3/14)
    Abstract
    Traditional text-based document classifiers tend to perform poorly an the Web. Text in Web documents is usually noisy and often does not contain enough information to determine their topic. However, the Web provides a different source that can be useful to document classification: its hyperlink structure. In this work, the authors evaluate how the link structure of the Web can be used to determine a measure of similarity appropriate for document classification. They experiment with five different similarity measures and determine their adequacy for predicting the topic of a Web page. Tests performed an a Web directory Show that link information alone allows classifying documents with an average precision of 86%. Further, when combined with a traditional textbased classifier, precision increases to values of up to 90%, representing gains that range from 63 to 132% over the use of text-based classification alone. Because the measures proposed in this article are straightforward to compute, they provide a practical and effective solution for Web classification and related information retrieval tasks. Further, the authors provide an important set of guidelines an how link structure can be used effectively to classify Web documents.
    Source
    Journal of the American Society for Information Science and Technology. 57(2006) no.2, S.208-221
  4. Shen, D.; Chen, Z.; Yang, Q.; Zeng, H.J.; Zhang, B.; Lu, Y.; Ma, W.Y.: Web page classification through summarization (2004) 0.01 
    0.013312589 = product of:
  0.062125415 = sum of:
    0.02891608 = weight(_text_:web in 4132) [ClassicSimilarity], result of:
      0.02891608 = score(doc=4132,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.36057037 = fieldWeight in 4132, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.078125 = fieldNorm(doc=4132)
    0.008366814 = weight(_text_:information in 4132) [ClassicSimilarity], result of:
      0.008366814 = score(doc=4132,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.19395474 = fieldWeight in 4132, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.078125 = fieldNorm(doc=4132)
    0.024842525 = weight(_text_:retrieval in 4132) [ClassicSimilarity], result of:
      0.024842525 = score(doc=4132,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.33420905 = fieldWeight in 4132, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.078125 = fieldNorm(doc=4132)
  0.21428572 = coord(3/14)
    Source
    SIGIR'04: Proceedings of the 27th Annual International ACM-SIGIR Conference an Research and Development in Information Retrieval. Ed.: K. Järvelin, u.a
  5. Miyamoto, S.: Information clustering based an fuzzy multisets (2003) 0.01 
    0.012681471 = product of:
  0.059180196 = sum of:
    0.020241255 = weight(_text_:web in 1071) [ClassicSimilarity], result of:
      0.020241255 = score(doc=1071,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.25239927 = fieldWeight in 1071, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1071)
    0.014346098 = weight(_text_:information in 1071) [ClassicSimilarity], result of:
      0.014346098 = score(doc=1071,freq=12.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.3325631 = fieldWeight in 1071, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1071)
    0.024592843 = weight(_text_:retrieval in 1071) [ClassicSimilarity], result of:
      0.024592843 = score(doc=1071,freq=4.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.33085006 = fieldWeight in 1071, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1071)
  0.21428572 = coord(3/14)
    Abstract
    A fuzzy multiset model for information clustering is proposed with application to information retrieval on the World Wide Web. Noting that a search engine retrieves multiple occurrences of the same subjects with possibly different degrees of relevance, we observe that fuzzy multisets provide an appropriate model of information retrieval on the WWW. Information clustering which means both term clustering and document clustering is considered. Three methods of the hard c-means, fuzzy c-means, and an agglomerative method using cluster centers are proposed. Two distances between fuzzy multisets and algorithms for calculating cluster centers are defined. Theoretical properties concerning the clustering algorithms are studied. Illustrative examples are given to show how the algorithms work.
    Source
    Information processing and management. 39(2003) no.2, S.195-213
  6. Khoo, C.S.G.; Ng, K.; Ou, S.: ¬An exploratory study of human clustering of Web pages (2003) 0.01 
    0.010779243 = product of:
  0.05030313 = sum of:
    0.040067296 = weight(_text_:web in 2741) [ClassicSimilarity], result of:
      0.040067296 = score(doc=2741,freq=24.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.49962097 = fieldWeight in 2741, product of:
          4.8989797 = tf(freq=24.0), with freq of:
            24.0 = termFreq=24.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=2741)
    0.0057966993 = weight(_text_:information in 2741) [ClassicSimilarity], result of:
      0.0057966993 = score(doc=2741,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.1343758 = fieldWeight in 2741, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=2741)
    0.0044391328 = product of:
      0.013317398 = sum of:
        0.013317398 = weight(_text_:22 in 2741) [ClassicSimilarity], result of:
          0.013317398 = score(doc=2741,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = queryNorm
            0.15476047 = fieldWeight in 2741, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=2741)
      0.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    Abstract
    This study seeks to find out how human beings cluster Web pages naturally. Twenty Web pages retrieved by the Northem Light search engine for each of 10 queries were sorted by 3 subjects into categories that were natural or meaningful to them. lt was found that different subjects clustered the same set of Web pages quite differently and created different categories. The average inter-subject similarity of the clusters created was a low 0.27. Subjects created an average of 5.4 clusters for each sorting. The categories constructed can be divided into 10 types. About 1/3 of the categories created were topical. Another 20% of the categories relate to the degree of relevance or usefulness. The rest of the categories were subject-independent categories such as format, purpose, authoritativeness and direction to other sources. The authors plan to develop automatic methods for categorizing Web pages using the common categories created by the subjects. lt is hoped that the techniques developed can be used by Web search engines to automatically organize Web pages retrieved into categories that are natural to users. 1. Introduction The World Wide Web is an increasingly important source of information for people globally because of its ease of access, the ease of publishing, its ability to transcend geographic and national boundaries, its flexibility and heterogeneity and its dynamic nature. However, Web users also find it increasingly difficult to locate relevant and useful information in this vast information storehouse. Web search engines, despite their scope and power, appear to be quite ineffective. They retrieve too many pages, and though they attempt to rank retrieved pages in order of probable relevance, often the relevant documents do not appear in the top-ranked 10 or 20 documents displayed. Several studies have found that users do not know how to use the advanced features of Web search engines, and do not know how to formulate and re-formulate queries. Users also typically exert minimal effort in performing, evaluating and refining their searches, and are unwilling to scan more than 10 or 20 items retrieved (Jansen, Spink, Bateman & Saracevic, 1998). This suggests that the conventional ranked-list display of search results does not satisfy user requirements, and that better ways of presenting and summarizing search results have to be developed. One promising approach is to group retrieved pages into clusters or categories to allow users to navigate immediately to the "promising" clusters where the most useful Web pages are likely to be located. This approach has been adopted by a number of search engines (notably Northem Light) and search agents.
    Date
    12. 9.2004 9:56:22
  7. Golub, K.: Automated subject classification of textual web documents (2006) 0.01 
    0.010410689 = product of:
  0.048583213 = sum of:
    0.02891608 = weight(_text_:web in 5600) [ClassicSimilarity], result of:
      0.02891608 = score(doc=5600,freq=8.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.36057037 = fieldWeight in 5600, 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=5600)
    0.007245874 = weight(_text_:information in 5600) [ClassicSimilarity], result of:
      0.007245874 = score(doc=5600,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.16796975 = fieldWeight in 5600, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5600)
    0.012421262 = weight(_text_:retrieval in 5600) [ClassicSimilarity], result of:
      0.012421262 = score(doc=5600,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.16710453 = fieldWeight in 5600, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5600)
  0.21428572 = coord(3/14)
    Abstract
    Purpose - To provide an integrated perspective to similarities and differences between approaches to automated classification in different research communities (machine learning, information retrieval and library science), and point to problems with the approaches and automated classification as such. Design/methodology/approach - A range of works dealing with automated classification of full-text web documents are discussed. Explorations of individual approaches are given in the following sections: special features (description, differences, evaluation), application and characteristics of web pages. Findings - Provides major similarities and differences between the three approaches: document pre-processing and utilization of web-specific document characteristics is common to all the approaches; major differences are in applied algorithms, employment or not of the vector space model and of controlled vocabularies. Problems of automated classification are recognized. Research limitations/implications - The paper does not attempt to provide an exhaustive bibliography of related resources. Practical implications - As an integrated overview of approaches from different research communities with application examples, it is very useful for students in library and information science and computer science, as well as for practitioners. Researchers from one community have the information on how similar tasks are conducted in different communities. Originality/value - To the author's knowledge, no review paper on automated text classification attempted to discuss more than one community's approach from an integrated perspective.
  8. Yao, H.; Etzkorn, L.H.; Virani, S.: Automated classification and retrieval of reusable software components (2008) 0.01 
    0.009317994 = product of:
  0.043483973 = sum of:
    0.01445804 = weight(_text_:web in 1382) [ClassicSimilarity], result of:
      0.01445804 = score(doc=1382,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.18028519 = fieldWeight in 1382, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1382)
    0.004183407 = weight(_text_:information in 1382) [ClassicSimilarity], result of:
      0.004183407 = score(doc=1382,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.09697737 = fieldWeight in 1382, 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=1382)
    0.024842525 = weight(_text_:retrieval in 1382) [ClassicSimilarity], result of:
      0.024842525 = score(doc=1382,freq=8.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.33420905 = fieldWeight in 1382, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1382)
  0.21428572 = coord(3/14)
    Abstract
    The authors describe their research which improves software reuse by using an automated approach to semantically search for and retrieve reusable software components in large software component repositories and on the World Wide Web (WWW). Using automation and smart (semantic) techniques, their approach speeds up the search and retrieval of reusable software components, while retaining good accuracy, and therefore improves the affordability of software reuse. A program understanding of software components and natural language understanding of user queries was employed. Then the software component descriptions were compared by matching the resulting semantic representations of the user queries to the semantic representations of the software components to search for software components that best match the user queries. A proof of concept system was developed to test the authors' approach. The results of this proof of concept system were compared to human experts, and statistical analysis was performed on the collected experimental data. The results from these experiments demonstrate that this automated semantic-based approach for software reusable component classification and retrieval is successful when compared to the labor-intensive results from the experts, thus showing that this approach can significantly benefit software reuse classification and retrieval.
    Source
    Journal of the American Society for Information Science and Technology. 59(2008) no.4, S.613-627
  9. Denoyer, L.; Gallinari, P.: Bayesian network model for semi-structured document classification (2004) 0.01 
    0.009317232 = product of:
  0.04348042 = sum of:
    0.017349645 = weight(_text_:web in 995) [ClassicSimilarity], result of:
      0.017349645 = score(doc=995,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.21634221 = fieldWeight in 995, 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=995)
    0.01122526 = weight(_text_:information in 995) [ClassicSimilarity], result of:
      0.01122526 = score(doc=995,freq=10.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.2602176 = fieldWeight in 995, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=995)
    0.014905514 = weight(_text_:retrieval in 995) [ClassicSimilarity], result of:
      0.014905514 = score(doc=995,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.20052543 = fieldWeight in 995, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=995)
  0.21428572 = coord(3/14)
    Abstract
    Recently, a new community has started to emerge around the development of new information research methods for searching and analyzing semi-structured and XML like documents. The goal is to handle both content and structural information, and to deal with different types of information content (text, image, etc.). We consider here the task of structured document classification. We propose a generative model able to handle both structure and content which is based on Bayesian networks. We then show how to transform this generative model into a discriminant classifier using the method of Fisher kernel. The model is then extended for dealing with different types of content information (here text and images). The model was tested on three databases: the classical webKB corpus composed of HTML pages, the new INEX corpus which has become a reference in the field of ad-hoc retrieval for XML documents, and a multimedia corpus of Web pages.
    Source
    Information processing and management. 40(2004) no.5, S.807-827
  10. Mengle, S.; Goharian, N.: Passage detection using text classification (2009) 0.01 
    0.008933682 = product of:
  0.041690517 = sum of:
    0.008366814 = weight(_text_:information in 2765) [ClassicSimilarity], result of:
      0.008366814 = score(doc=2765,freq=8.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.19395474 = fieldWeight in 2765, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2765)
    0.027774787 = weight(_text_:retrieval in 2765) [ClassicSimilarity], result of:
      0.027774787 = score(doc=2765,freq=10.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.37365708 = fieldWeight in 2765, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2765)
    0.0055489163 = product of:
      0.016646748 = sum of:
        0.016646748 = weight(_text_:22 in 2765) [ClassicSimilarity], result of:
          0.016646748 = score(doc=2765,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = queryNorm
            0.19345059 = fieldWeight in 2765, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2765)
      0.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    Abstract
    Passages can be hidden within a text to circumvent their disallowed transfer. Such release of compartmentalized information is of concern to all corporate and governmental organizations. Passage retrieval is well studied; we posit, however, that passage detection is not. Passage retrieval is the determination of the degree of relevance of blocks of text, namely passages, comprising a document. Rather than determining the relevance of a document in its entirety, passage retrieval determines the relevance of the individual passages. As such, modified traditional information-retrieval techniques compare terms found in user queries with the individual passages to determine a similarity score for passages of interest. In passage detection, passages are classified into predetermined categories. More often than not, passage detection techniques are deployed to detect hidden paragraphs in documents. That is, to hide information, documents are injected with hidden text into passages. Rather than matching query terms against passages to determine their relevance, using text-mining techniques, the passages are classified. Those documents with hidden passages are defined as infected. Thus, simply stated, passage retrieval is the search for passages relevant to a user query, while passage detection is the classification of passages. That is, in passage detection, passages are labeled with one or more categories from a set of predetermined categories. We present a keyword-based dynamic passage approach (KDP) and demonstrate that KDP outperforms statistically significantly (99% confidence) the other document-splitting approaches by 12% to 18% in the passage detection and passage category-prediction tasks. Furthermore, we evaluate the effects of the feature selection, passage length, ambiguous passages, and finally training-data category distribution on passage-detection accuracy.
    Date
    22. 3.2009 19:14:43
    Source
    Journal of the American Society for Information Science and Technology. 60(2009) no.4, S.814-825
  11. Montesi, M.; Navarrete, T.: Classifying web genres in context : A case study documenting the web genres used by a software engineer (2008) 0.01 
    0.008677713 = product of:
  0.060743988 = sum of:
    0.05204894 = weight(_text_:web in 2100) [ClassicSimilarity], result of:
      0.05204894 = score(doc=2100,freq=18.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.64902663 = fieldWeight in 2100, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2100)
    0.008695048 = weight(_text_:information in 2100) [ClassicSimilarity], result of:
      0.008695048 = score(doc=2100,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.20156369 = fieldWeight in 2100, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2100)
  0.14285715 = coord(2/14)
    Abstract
    This case study analyzes the Internet-based resources that a software engineer uses in his daily work. Methodologically, we studied the web browser history of the participant, classifying all the web pages he had seen over a period of 12 days into web genres. We interviewed him before and after the analysis of the web browser history. In the first interview, he spoke about his general information behavior; in the second, he commented on each web genre, explaining why and how he used them. As a result, three approaches allow us to describe the set of 23 web genres obtained: (a) the purposes they serve for the participant; (b) the role they play in the various work and search phases; (c) and the way they are used in combination with each other. Further observations concern the way the participant assesses quality of web-based resources, and his information behavior as a software engineer.
    Source
    Information processing and management. 44(2008) no.4, S.1410-1430
  12. Kwon, O.W.; Lee, J.H.: Text categorization based on k-nearest neighbor approach for web site classification (2003) 0.01 
    0.008597023 = product of:
  0.060179155 = sum of:
    0.055995747 = weight(_text_:web in 1070) [ClassicSimilarity], result of:
      0.055995747 = score(doc=1070,freq=30.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.69824153 = fieldWeight in 1070, product of:
          5.477226 = tf(freq=30.0), with freq of:
            30.0 = termFreq=30.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1070)
    0.004183407 = weight(_text_:information in 1070) [ClassicSimilarity], result of:
      0.004183407 = score(doc=1070,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.09697737 = fieldWeight in 1070, 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=1070)
  0.14285715 = coord(2/14)
    Abstract
    Automatic categorization is a viable method to deal with the scaling problem on the World Wide Web. For Web site classification, this paper proposes the use of Web pages linked with the home page in a different manner from the sole use of home pages in previous research. To implement our proposed method, we derive a scheme for Web site classification based on the k-nearest neighbor (k-NN) approach. It consists of three phases: Web page selection (connectivity analysis), Web page classification, and Web site classification. Given a Web site, the Web page selection chooses several representative Web pages using connectivity analysis. The k-NN classifier next classifies each of the selected Web pages. Finally, the classified Web pages are extended to a classification of the entire Web site. To improve performance, we supplement the k-NN approach with a feature selection method and a term weighting scheme using markup tags, and also reform its document-document similarity measure. In our experiments on a Korean commercial Web directory, the proposed system, using both a home page and its linked pages, improved the performance of micro-averaging breakeven point by 30.02%, compared with an ordinary classification which uses a home page only.
    Source
    Information processing and management. 39(2003) no.1, S.25-44
  13. Hagedorn, K.; Chapman, S.; Newman, D.: Enhancing search and browse using automated clustering of subject metadata (2007) 0.01 
    0.007987553 = product of:
  0.037275247 = sum of:
    0.017349645 = weight(_text_:web in 1168) [ClassicSimilarity], result of:
      0.017349645 = score(doc=1168,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.21634221 = fieldWeight in 1168, 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=1168)
    0.0050200885 = weight(_text_:information in 1168) [ClassicSimilarity], result of:
      0.0050200885 = score(doc=1168,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.116372846 = fieldWeight in 1168, 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=1168)
    0.014905514 = weight(_text_:retrieval in 1168) [ClassicSimilarity], result of:
      0.014905514 = score(doc=1168,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.20052543 = fieldWeight in 1168, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=1168)
  0.21428572 = coord(3/14)
    Abstract
    The Web puzzle of online information resources often hinders end-users from effective and efficient access to these resources. Clustering resources into appropriate subject-based groupings may help alleviate these difficulties, but will it work with heterogeneous material? The University of Michigan and the University of California Irvine joined forces to test automatically enhancing metadata records using the Topic Modeling algorithm on the varied OAIster corpus. We created labels for the resulting clusters of metadata records, matched the clusters to an in-house classification system, and developed a prototype that would showcase methods for search and retrieval using the enhanced records. Results indicated that while the algorithm was somewhat time-intensive to run and using a local classification scheme had its drawbacks, precise clustering of records was achieved and the prototype interface proved that faceted classification could be powerful in helping end-users find resources.
  14. Choi, B.; Peng, X.: Dynamic and hierarchical classification of Web pages (2004) 0.01 
    0.006784292 = product of:
  0.04749004 = sum of:
    0.038794994 = weight(_text_:web in 2555) [ClassicSimilarity], result of:
      0.038794994 = score(doc=2555,freq=10.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.48375595 = fieldWeight in 2555, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2555)
    0.008695048 = weight(_text_:information in 2555) [ClassicSimilarity], result of:
      0.008695048 = score(doc=2555,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.20156369 = fieldWeight in 2555, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2555)
  0.14285715 = coord(2/14)
    Abstract
    Automatic classification of Web pages is an effective way to organise the vast amount of information and to assist in retrieving relevant information from the Internet. Although many automatic classification systems have been proposed, most of them ignore the conflict between the fixed number of categories and the growing number of Web pages being added into the systems. They also require searching through all existing categories to make any classification. This article proposes a dynamic and hierarchical classification system that is capable of adding new categories as required, organising the Web pages into a tree structure, and classifying Web pages by searching through only one path of the tree. The proposed single-path search technique reduces the search complexity from (n) to (log(n)). Test results show that the system improves the accuracy of classification by 6 percent in comparison to related systems. The dynamic-category expansion technique also achieves satisfying results for adding new categories into the system as required.
    Source
    Online information review. 28(2004) no.2, S.139-147
  15. Wu, M.; Fuller, M.; Wilkinson, R.: Using clustering and classification approaches in interactive retrieval (2001) 0.01 
    0.006641868 = product of:
  0.046493076 = sum of:
    0.01171354 = weight(_text_:information in 2666) [ClassicSimilarity], result of:
      0.01171354 = score(doc=2666,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.27153665 = fieldWeight in 2666, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.109375 = fieldNorm(doc=2666)
    0.034779534 = weight(_text_:retrieval in 2666) [ClassicSimilarity], result of:
      0.034779534 = score(doc=2666,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.46789268 = fieldWeight in 2666, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.109375 = fieldNorm(doc=2666)
  0.14285715 = coord(2/14)
    Source
    Information processing and management. 37(2001) no.3, S.459-484
  16. Lim, C.S.; Lee, K.J.; Kim, G.C.: Multiple sets of features for automatic genre classification of web documents (2005) 0.01 
    0.0064997505 = product of:
  0.045498252 = sum of:
    0.038252376 = weight(_text_:web in 1048) [ClassicSimilarity], result of:
      0.038252376 = score(doc=1048,freq=14.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.47698978 = fieldWeight in 1048, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1048)
    0.007245874 = weight(_text_:information in 1048) [ClassicSimilarity], result of:
      0.007245874 = score(doc=1048,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.16796975 = fieldWeight in 1048, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1048)
  0.14285715 = coord(2/14)
    Abstract
    With the increase of information on the Web, it is difficult to find desired information quickly out of the documents retrieved by a search engine. One way to solve this problem is to classify web documents according to various criteria. Most document classification has been focused on a subject or a topic of a document. A genre or a style is another view of a document different from a subject or a topic. The genre is also a criterion to classify documents. In this paper, we suggest multiple sets of features to classify genres of web documents. The basic set of features, which have been proposed in the previous studies, is acquired from the textual properties of documents, such as the number of sentences, the number of a certain word, etc. However, web documents are different from textual documents in that they contain URL and HTML tags within the pages. We introduce new sets of features specific to web documents, which are extracted from URL and HTML tags. The present work is an attempt to evaluate the performance of the proposed sets of features, and to discuss their characteristics. Finally, we conclude which is an appropriate set of features in automatic genre classification of web documents.
    Source
    Information processing and management. 41(2005) no.5, S.1263-1276
  17. Golub, K.: Automated subject classification of textual Web pages, based on a controlled vocabulary : challenges and recommendations (2006) 0.01 
    0.0059712525 = product of:
  0.041798767 = sum of:
    0.03469929 = weight(_text_:web in 5897) [ClassicSimilarity], result of:
      0.03469929 = score(doc=5897,freq=8.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.43268442 = fieldWeight in 5897, 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=5897)
    0.007099477 = weight(_text_:information in 5897) [ClassicSimilarity], result of:
      0.007099477 = score(doc=5897,freq=4.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.16457605 = fieldWeight in 5897, 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=5897)
  0.14285715 = coord(2/14)
    Abstract
    The primary objective of this study was to identify and address problems of applying a controlled vocabulary in automated subject classification of textual Web pages, in the area of engineering. Web pages have special characteristics such as structural information, but are at the same time rather heterogeneous. The classification approach used comprises string-to-string matching between words in a term list extracted from the Ei (Engineering Information) thesaurus and classification scheme, and words in the text to be classified. Based on a sample of 70 Web pages, a number of problems with the term list are identified. Reasons for those problems are discussed and improvements proposed. Methods for implementing the improvements are also specified, suggesting further research.
  18. Yu, W.; Gong, Y.: Document clustering by concept factorization (2004) 0.01 
    0.005693029 = product of:
  0.039851204 = sum of:
    0.010040177 = weight(_text_:information in 4084) [ClassicSimilarity], result of:
      0.010040177 = score(doc=4084,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.23274569 = fieldWeight in 4084, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=4084)
    0.029811028 = weight(_text_:retrieval in 4084) [ClassicSimilarity], result of:
      0.029811028 = score(doc=4084,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.40105087 = fieldWeight in 4084, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.09375 = fieldNorm(doc=4084)
  0.14285715 = coord(2/14)
    Source
    SIGIR'04: Proceedings of the 27th Annual International ACM-SIGIR Conference an Research and Development in Information Retrieval. Ed.: K. Järvelin, u.a
  19. Chung, Y.-M.; Noh, Y.-H.: Developing a specialized directory system by automatically classifying Web documents (2003) 0.01 
    0.0056741973 = product of:
  0.03971938 = sum of:
    0.03469929 = weight(_text_:web in 1566) [ClassicSimilarity], result of:
      0.03469929 = score(doc=1566,freq=8.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.43268442 = fieldWeight in 1566, 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=1566)
    0.0050200885 = weight(_text_:information in 1566) [ClassicSimilarity], result of:
      0.0050200885 = score(doc=1566,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.116372846 = fieldWeight in 1566, 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=1566)
  0.14285715 = coord(2/14)
    Abstract
    This study developed a specialized directory system using an automatic classification technique. Economics was selected as the subject field for the classification experiments with Web documents. The classification scheme of the directory follows the DDC, and subject terms representing each class number or subject category were selected from the DDC table to construct a representative term dictionary. In collecting and classifying the Web documents, various strategies were tested in order to find the optimal thresholds. In the classification experiments, Web documents in economics were classified into a total of 757 hierarchical subject categories built from the DDC scheme. The first and second experiments using the representative term dictionary resulted in relatively high precision ratios of 77 and 60%, respectively. The third experiment employing a machine learning-based k-nearest neighbours (kNN) classifier in a closed experimental setting achieved a precision ratio of 96%. This implies that it is possible to enhance the classification performance by applying a hybrid method combining a dictionary-based technique and a kNN classifier
    Source
    Journal of information science. 29(2003) no.2, S.117-126
  20. Guerrero-Bote, V.P.; Moya Anegón, F. de; Herrero Solana, V.: Document organization using Kohonen's algorithm (2002) 0.01 
    0.005671358 = product of:
  0.039699506 = sum of:
    0.011593399 = weight(_text_:information in 2564) [ClassicSimilarity], result of:
      0.011593399 = score(doc=2564,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.2687516 = fieldWeight in 2564, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=2564)
    0.028106106 = weight(_text_:retrieval in 2564) [ClassicSimilarity], result of:
      0.028106106 = score(doc=2564,freq=4.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.37811437 = fieldWeight in 2564, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=2564)
  0.14285715 = coord(2/14)
    Abstract
    The classification of documents from a bibliographic database is a task that is linked to processes of information retrieval based on partial matching. A method is described of vectorizing reference documents from LISA which permits their topological organization using Kohonen's algorithm. As an example a map is generated of 202 documents from LISA, and an analysis is made of the possibilities of this type of neural network with respect to the development of information retrieval systems based on graphical browsing.
    Source
    Information processing and management. 38(2002) no.1, S.79-89

Authors

Types

  • a 66
  • el 6
  • m 1
  • s 1
  • More… Less…

Themes

Subjects