Search (24 results, page 1 of 2)

  • × theme_ss:"Automatisches Klassifizieren"
  1. Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004) 0.23 
    0.22707656 = product of:
  0.30276874 = sum of:
    0.071140714 = product of:
      0.21342213 = sum of:
        0.21342213 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
          0.21342213 = score(doc=562,freq=2.0), product of:
            0.3797425 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.04479146 = 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.21342213 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.21342213 = score(doc=562,freq=2.0), product of:
        0.3797425 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.04479146 = 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.018205874 = product of:
      0.036411747 = sum of:
        0.036411747 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
          0.036411747 = score(doc=562,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = 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.5 = coord(1/2)
  0.75 = coord(3/4)
    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. Khoo, C.S.G.; Ng, K.; Ou, S.: ¬An exploratory study of human clustering of Web pages (2003) 0.06 
    0.057169482 = product of:
  0.114338964 = sum of:
    0.102201715 = weight(_text_:engines in 2741) [ClassicSimilarity], result of:
      0.102201715 = score(doc=2741,freq=8.0), product of:
        0.22757743 = queryWeight, product of:
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.04479146 = queryNorm
        0.44908544 = fieldWeight in 2741, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.03125 = fieldNorm(doc=2741)
    0.012137249 = product of:
      0.024274498 = sum of:
        0.024274498 = weight(_text_:22 in 2741) [ClassicSimilarity], result of:
          0.024274498 = score(doc=2741,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = 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.5 = coord(1/2)
  0.5 = coord(2/4)
    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
  3. Krellenstein, M.: Document classification at Northern Light (1999) 0.04 
    0.03832564 = product of:
  0.15330257 = sum of:
    0.15330257 = weight(_text_:engines in 4435) [ClassicSimilarity], result of:
      0.15330257 = score(doc=4435,freq=2.0), product of:
        0.22757743 = queryWeight, product of:
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.04479146 = queryNorm
        0.67362815 = fieldWeight in 4435, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.09375 = fieldNorm(doc=4435)
  0.25 = coord(1/4)
    Footnote
    Vortrag bei: Search engines and beyond: developing efficient knowledge management systems; 1999 Search engine Meeting, Boston, MA, April 19-20 1999
  4. Search Engines and Beyond : Developing efficient knowledge management systems, April 19-20 1999, Boston, Mass (1999) 0.03 
    0.02856625 = product of:
  0.114265 = sum of:
    0.114265 = weight(_text_:engines in 2596) [ClassicSimilarity], result of:
      0.114265 = score(doc=2596,freq=10.0), product of:
        0.22757743 = queryWeight, product of:
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.04479146 = queryNorm
        0.50209284 = fieldWeight in 2596, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.03125 = fieldNorm(doc=2596)
  0.25 = coord(1/4)
    Abstract
    This series of meetings originated in Albuquerque, New Mexico in 1995. This inaugural meeting (part of an ASIDIC series) was transplanted to Bath in England (1996 and 1997) and then to Boston, Massachusetts (1998 and 1999). The Search Engines Meetings bring together commercial search engine developers, academics and corporate professionals to learn from each other. Infonortics, sponsor of meetings post-1995 with Ev Brenner, plans to continue the same success in Boston in 2000.
    Content
    Ramana Rao (Inxight, Palo Alto, CA) 7 ± 2 Insights on achieving Effective Information Access Session One: Updates and a twelve month perspective Danny Sullivan (Search Engine Watch, US / England) Portalization and other search trends Carol Tenopir (University of Tennessee) Search realities faced by end users and professional searchers Session Two: Today's search engines and beyond Daniel Hoogterp (Retrieval Technologies, McLean, VA) Effective presentation and utilization of search techniques Rick Kenny (Fulcrum Technologies, Ontario, Canada) Beyond document clustering: The knowledge impact statement Gary Stock (Ingenius, Kalamazoo, MI) Automated change monitoring Gary Culliss (Direct Hit, Wellesley Hills, MA) User popularity ranked search engines Byron Dom (IBM, CA) Automatically finding the best pages on the World Wide Web (CLEVER) Peter Tomassi (LookSmart, San Francisco, CA) Adding human intellect to search technology Session Three: Panel discussion: Human v automated categorization and editing Ev Brenner (New York, NY)- Chairman James Callan (University of Massachusetts, MA) Marc Krellenstein (Northern Light Technology, Cambridge, MA) Dan Miller (Ask Jeeves, Berkeley, CA) Session Four: Updates and a twelve month perspective Steve Arnold (AIT, Harrods Creek, KY) Review: The leading edge in search and retrieval software Ellen Voorhees (NIST, Gaithersburg, MD) TREC update Session Five: Search engines now and beyond Intelligent Agents John Snyder (Muscat, Cambridge, England) Practical issues behind intelligent agents Text summarization Therese Firmin, (Dept of Defense, Ft George G. Meade, MD) The TIPSTER/SUMMAC evaluation of automatic text summarization systems Cross language searching Elizabeth Liddy (TextWise, Syracuse, NY) A conceptual interlingua approach to cross-language retrieval. Video search and retrieval Armon Amir (IBM, Almaden, CA) CueVideo: Modular system for automatic indexing and browsing of video/audio Speech recognition Michael Witbrock (Lycos, Waltham, MA) Retrieval of spoken documents Visualization James A. Wise (Integral Visuals, Richland, WA) Information visualization in the new millennium: Emerging science or passing fashion? Text mining David Evans (Claritech, Pittsburgh, PA) Text mining - towards decision support
  5. Yilmaz, T.; Ozcan, R.; Altingovde, I.S.; Ulusoy, Ö.: Improving educational web search for question-like queries through subject classification (2019) 0.02 
    0.022583602 = product of:
  0.09033441 = sum of:
    0.09033441 = weight(_text_:engines in 5041) [ClassicSimilarity], result of:
      0.09033441 = score(doc=5041,freq=4.0), product of:
        0.22757743 = queryWeight, product of:
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.04479146 = queryNorm
        0.39693922 = fieldWeight in 5041, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.080822 = idf(docFreq=746, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5041)
  0.25 = coord(1/4)
    Abstract
    Students use general web search engines as their primary source of research while trying to find answers to school-related questions. Although search engines are highly relevant for the general population, they may return results that are out of educational context. Another rising trend; social community question answering websites are the second choice for students who try to get answers from other peers online. We attempt discovering possible improvements in educational search by leveraging both of these information sources. For this purpose, we first implement a classifier for educational questions. This classifier is built by an ensemble method that employs several regular learning algorithms and retrieval based approaches that utilize external resources. We also build a query expander to facilitate classification. We further improve the classification using search engine results and obtain 83.5% accuracy. Although our work is entirely based on the Turkish language, the features could easily be mapped to other languages as well. In order to find out whether search engine ranking can be improved in the education domain using the classification model, we collect and label a set of query results retrieved from a general web search engine. We propose five ad-hoc methods to improve search ranking based on the idea that the query-document category relation is an indicator of relevance. We evaluate these methods for overall performance, varying query length and based on factoid and non-factoid queries. We show that some of the methods significantly improve the rankings in the education domain.
  6. Dang, E.K.F.; Luk, R.W.P.; Ho, K.S.; Chan, S.C.F.; Lee, D.L.: ¬A new measure of clustering effectiveness : algorithms and experimental studies (2008) 0.02 
    0.018607298 = product of:
  0.07442919 = sum of:
    0.07442919 = product of:
      0.14885838 = sum of:
        0.14885838 = weight(_text_:programming in 1367) [ClassicSimilarity], result of:
          0.14885838 = score(doc=1367,freq=2.0), product of:
            0.29361802 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.04479146 = queryNorm
            0.5069797 = fieldWeight in 1367, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1367)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    We propose a new optimal clustering effectiveness measure, called CS1, based on a combination of clusters rather than selecting a single optimal cluster as in the traditional MK1 measure. For hierarchical clustering, we present an algorithm to compute CS1, defined by seeking the optimal combinations of disjoint clusters obtained by cutting the hierarchical structure at a certain similarity level. By reformulating the optimization to a 0-1 linear fractional programming problem, we demonstrate that an exact solution can be obtained by a linear time algorithm. We further discuss how our approach can be generalized to more general problems involving overlapping clusters, and we show how optimal estimates can be obtained by greedy algorithms.
  7. Malo, P.; Sinha, A.; Wallenius, J.; Korhonen, P.: Concept-based document classification using Wikipedia and value function (2011) 0.02 
    0.015949111 = product of:
  0.063796446 = sum of:
    0.063796446 = product of:
      0.12759289 = sum of:
        0.12759289 = weight(_text_:programming in 4948) [ClassicSimilarity], result of:
          0.12759289 = score(doc=4948,freq=2.0), product of:
            0.29361802 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.04479146 = queryNorm
            0.43455404 = fieldWeight in 4948, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.046875 = fieldNorm(doc=4948)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    In this article, we propose a new concept-based method for document classification. The conceptual knowledge associated with the words is drawn from Wikipedia. The purpose is to utilize the abundant semantic relatedness information available in Wikipedia in an efficient value function-based query learning algorithm. The procedure learns the value function by solving a simple linear programming problem formulated using the training documents. The learning involves a step-wise iterative process that helps in generating a value function with an appropriate set of concepts (dimensions) chosen from a collection of concepts. Once the value function is formulated, it is utilized to make a decision between relevance and irrelevance. The value assigned to a particular document from the value function can be further used to rank the documents according to their relevance. Reuters newswire documents have been used to evaluate the efficacy of the procedure. An extensive comparison with other frameworks has been performed. The results are promising.
  8. Piros, A.: Automatic interpretation of complex UDC numbers : towards support for library systems (2015) 0.01 
    0.010632741 = product of:
  0.042530965 = sum of:
    0.042530965 = product of:
      0.08506193 = sum of:
        0.08506193 = weight(_text_:programming in 2301) [ClassicSimilarity], result of:
          0.08506193 = score(doc=2301,freq=2.0), product of:
            0.29361802 = queryWeight, product of:
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.04479146 = queryNorm
            0.28970268 = fieldWeight in 2301, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.5552235 = idf(docFreq=170, maxDocs=44218)
              0.03125 = fieldNorm(doc=2301)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Analytico-synthetic and faceted classifications, such as Universal Decimal Classification (UDC) express content of documents with complex, pre-combined classification codes. Without classification authority control that would help manage and access structured notations, the use of UDC codes in searching and browsing is limited. Existing UDC parsing solutions are usually created for a particular database system or a specific task and are not widely applicable. The approach described in this paper provides a solution by which the analysis and interpretation of UDC notations would be stored into an intermediate format (in this case, in XML) by automatic means without any data or information loss. Due to its richness, the output file can be converted into different formats, such as standard mark-up and data exchange formats or simple lists of the recommended entry points of a UDC number. The program can also be used to create authority records containing complex UDC numbers which can be comprehensively analysed in order to be retrieved effectively. The Java program, as well as the corresponding schema definition it employs, is under continuous development. The current version of the interpreter software is now available online for testing purposes at the following web site: http://interpreter-eto.rhcloud.com. The future plan is to implement conversion methods for standard formats and to create standard online interfaces in order to make it possible to use the features of software as a service. This would result in the algorithm being able to be employed both in existing and future library systems to analyse UDC numbers without any significant programming effort.
  9. Subramanian, S.; Shafer, K.E.: Clustering (2001) 0.01 
    0.009102937 = product of:
  0.036411747 = sum of:
    0.036411747 = product of:
      0.072823495 = sum of:
        0.072823495 = weight(_text_:22 in 1046) [ClassicSimilarity], result of:
          0.072823495 = score(doc=1046,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.46428138 = fieldWeight in 1046, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=1046)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    5. 5.2003 14:17:22
  10. Reiner, U.: Automatische DDC-Klassifizierung von bibliografischen Titeldatensätzen (2009) 0.01 
    0.007585781 = product of:
  0.030343125 = sum of:
    0.030343125 = product of:
      0.06068625 = sum of:
        0.06068625 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
          0.06068625 = score(doc=611,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.38690117 = fieldWeight in 611, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=611)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 8.2009 12:54:24
  11. HaCohen-Kerner, Y. et al.: Classification using various machine learning methods and combinations of key-phrases and visual features (2016) 0.01 
    0.007585781 = product of:
  0.030343125 = sum of:
    0.030343125 = product of:
      0.06068625 = sum of:
        0.06068625 = weight(_text_:22 in 2748) [ClassicSimilarity], result of:
          0.06068625 = score(doc=2748,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.38690117 = fieldWeight in 2748, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=2748)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    1. 2.2016 18:25:22
  12. Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989) 0.01 
    0.0053100465 = product of:
  0.021240186 = sum of:
    0.021240186 = product of:
      0.042480372 = sum of:
        0.042480372 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
          0.042480372 = score(doc=141,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.2708308 = fieldWeight in 141, 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=141)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Pages
    S.1-22
  13. Dubin, D.: Dimensions and discriminability (1998) 0.01 
    0.0053100465 = product of:
  0.021240186 = sum of:
    0.021240186 = product of:
      0.042480372 = sum of:
        0.042480372 = weight(_text_:22 in 2338) [ClassicSimilarity], result of:
          0.042480372 = score(doc=2338,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.2708308 = fieldWeight in 2338, 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=2338)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 9.1997 19:16:05
  14. Automatic classification research at OCLC (2002) 0.01 
    0.0053100465 = product of:
  0.021240186 = sum of:
    0.021240186 = product of:
      0.042480372 = sum of:
        0.042480372 = weight(_text_:22 in 1563) [ClassicSimilarity], result of:
          0.042480372 = score(doc=1563,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.2708308 = fieldWeight in 1563, 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=1563)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    5. 5.2003 9:22:09
  15. Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998) 0.01 
    0.0053100465 = product of:
  0.021240186 = sum of:
    0.021240186 = product of:
      0.042480372 = sum of:
        0.042480372 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
          0.042480372 = score(doc=1673,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = 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(1/4)
    Date
    1. 8.1996 22:08:06
  16. Yoon, Y.; Lee, C.; Lee, G.G.: ¬An effective procedure for constructing a hierarchical text classification system (2006) 0.01 
    0.0053100465 = product of:
  0.021240186 = sum of:
    0.021240186 = product of:
      0.042480372 = sum of:
        0.042480372 = weight(_text_:22 in 5273) [ClassicSimilarity], result of:
          0.042480372 = score(doc=5273,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.2708308 = fieldWeight in 5273, 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=5273)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 7.2006 16:24:52
  17. Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007) 0.01 
    0.0053100465 = product of:
  0.021240186 = sum of:
    0.021240186 = product of:
      0.042480372 = sum of:
        0.042480372 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
          0.042480372 = score(doc=2560,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.2708308 = fieldWeight in 2560, 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=2560)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 9.2008 18:31:54
  18. Liu, R.-L.: Context recognition for hierarchical text classification (2009) 0.00 
    0.0045514684 = product of:
  0.018205874 = sum of:
    0.018205874 = product of:
      0.036411747 = sum of:
        0.036411747 = weight(_text_:22 in 2760) [ClassicSimilarity], result of:
          0.036411747 = score(doc=2760,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.23214069 = fieldWeight in 2760, 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=2760)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 3.2009 19:11:54
  19. Pfeffer, M.: Automatische Vergabe von RVK-Notationen mittels fallbasiertem Schließen (2009) 0.00 
    0.0045514684 = product of:
  0.018205874 = sum of:
    0.018205874 = product of:
      0.036411747 = sum of:
        0.036411747 = weight(_text_:22 in 3051) [ClassicSimilarity], result of:
          0.036411747 = score(doc=3051,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.23214069 = fieldWeight in 3051, 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=3051)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 8.2009 19:51:28
  20. Zhu, W.Z.; Allen, R.B.: Document clustering using the LSI subspace signature model (2013) 0.00 
    0.0045514684 = product of:
  0.018205874 = sum of:
    0.018205874 = product of:
      0.036411747 = sum of:
        0.036411747 = weight(_text_:22 in 690) [ClassicSimilarity], result of:
          0.036411747 = score(doc=690,freq=2.0), product of:
            0.15685207 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04479146 = queryNorm
            0.23214069 = fieldWeight in 690, 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=690)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    23. 3.2013 13:22:36

Authors

Years

Languages

  • e 19
  • d 4

Types

Themes