{"paper":{"title":"Exploring term-document matrices from matrix models in text mining","arxiv_id":"cs/0602076","primary_cat":"cs.IR","submitted_at":"2006-02-21T16:14:16+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13-20260917 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":0.73,"id":"s0","own":true,"role":"contribution","text":"We explore a matrix-space model, that is a natural extension to the vector space model for Information Retrieval.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.64,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.12,"role_probabilities":{"gap":0.0,"method":0.12,"result":0.0,"background":0.15,"limitation":0.0,"future_work":0.0,"contribution":0.73,"interpretation":0.0}},{"i":1,"p":0.89,"id":"s1","own":false,"role":"method","text":"Each document can be represented by a matrix that is based on document extracts (e.g. sentences, paragraphs, sections).","hedge":{"p":0.99,"label":"asserted"},"own_p":0.2,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.89,"result":0.0,"background":0.03,"limitation":0.0,"future_work":0.0,"contribution":0.08,"interpretation":0.0}},{"i":2,"p":0.54,"id":"s2","own":false,"role":"contribution","text":"We focus on the performance of this model for the specific case in which documents are originally represented as term-by-sentence matrices.","hedge":{"p":0.82,"label":"asserted"},"own_p":0.49,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.39,"result":0.0,"background":0.02,"limitation":0.05,"future_work":0.0,"contribution":0.54,"interpretation":0.0}},{"i":3,"p":0.99,"id":"s3","own":true,"role":"method","text":"We use the singular value decomposition to approximate the term-by-sentence matrices and assemble these results to form the pseudo-``term-document'' matrix that forms the basis of a text mining method alternative to traditional VSM and LSI.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.94,"main_claim_p":0.1,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.0,"method":0.99,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":4,"p":0.88,"id":"s4","own":true,"role":"result","text":"We investigate the singular values of this matrix and provide experimental evidence suggesting that the method can be particularly effective in terms of accuracy for text collections with multi-topic documents, such as web pages with news.","hedge":{"p":1.0,"label":"hedged_possibility"},"own_p":0.95,"main_claim_p":0.76,"quantitative":false,"quantitative_p":0.22,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.88,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.11}}]},"compiled":{"main_claim":{"p":1.0,"text":"We investigate the singular values of this matrix and provide experimental evidence suggesting that the method can be particularly effective in terms of accuracy for text collections with multi-topic documents, such as web pages with news.","location":"abstract s4","hedge_strength":{"p":1.0,"label":"hedged possibility"}},"provenance":{"route":{"via":"OpenRouter","model":"classifier-1.13","endpoint":"https://openrouter.ai/api/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":4278,"cost_usd_reported":0.00018},"compiled_at":"2026-09-23","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13-20260917","abstract_states":{"claims_first":0.04,"states_limitation":0.23,"human_participants":0.03,"controlled_comparison":0.22,"randomized_assignment":0.01,"states_quantitative_result":0.05,"compares_with_prior_results":0.47,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":0.95,"value":"observation or experiment","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.01,"observation_or_experiment":0.95,"simulation_or_computation":0.04}},"contribution_type":{"p":0.98,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.98,"empirical_study":0.02,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.95,"text":"We use the singular value decomposition to approximate the term-by-sentence matrices and assemble these results to form the pseudo-``term-document'' matrix that forms the basis of a text mining method alternative to traditional VSM and LSI.","location":"abstract s3"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":5,"sentences_in_abstract":5},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448}}