Visualização Multi-dimensional: Mineração Visual de Dados multidimensionais e aplicações Parte II Variações e Aplicações. Rosane Minghim
|
|
|
- Barrie Bennett
- 5 years ago
- Views:
Transcription
1 Visualização Multi-dimensional: Mineração Visual de Dados multidimensionais e aplicações Parte II Variações e Aplicações Rosane Minghim Basic Concepts Text Preprocessing Data and text mining Projection techniques Point Placement Strategies 2 1
2 Text Preprocessing 1. Stopwords elimination 2. Extraction of words radicals (stemming) 3. Creation of n-grams 4. Frequency count and Luhn s lower cut (ngrams appearing less then x times are ignored) 5. Weighting process (term-frequency inverse document-frequency - (tfidf)) 3 Result is a Vector Model Attributes: terms (n-grams) Value: term weight Table Data 4 2
3 Vector Representation term weighting tf term frequency tfidf tf x idf = tf x inverse document frequency 5 Vector Representation term 1 term 2 term 3 term 4... term m Doc Doc Doc Doc n
4 Vector Representation Similarity calculatin EUCLIDEAN MANHATAN COSINE 7 Alternative to Vector Representation Similarity Calculation text against text Ex: NCD Normalized Compression Distance Approximation of Kolmogorov Complexity 8 4
5 Visual representations: graphs, surfaces, volumes, triangulations
6 IN-SPIRE Spatial Paradigm for Information Retrieval - Pacific Nortwest National Laboratories Two Visualization Metaphors: Galaxies dimensional reduction Themescape 11 InfoSky Granitzer (Granitzer et al., 2004) also employs galaxy metaphor 12 6
7 13 VxInsight Sandia National Laboratories, mountain metaphor (Boyack et al., 2002). 14 7
8 HIVE (Ross and Chalmers 2003) Interconnected components: Import Transform Render multi-dim data 15 Projection Explorer (PEx) Projection and Point placement Precision Graphs and surfaces (Super Spider) 16 8
9 Mapping Text Collections via Projections and Point Placement Positioning and labeling
10 Detailing topics
11 Finding Relationships
12 Building a mesh
13 Coloring by degree of proximity
14 Coordinating
15 Building a Surface
16 31 Exemplos de Mapas 32 16
17 Exemplos de Mapas 33 RSS News Flash Bird and Flu 34 17
18 Palestinian 35 Bush Iraq 36 18
19 Bush Iraq
20 Curvas de Nível 39 Séries Temporais Vazão em Hidrelétricas 40 20
21 Further Example - patents 41 Images 42 21
22 Images 43 Exercícios Download Pex Usar os conjuntos de dados presentes no site e explorá-los. Registrar as conclusões Download Pex-Image Fazer o mesmo Infoserver.lcad.icmc.usp.br/infovis
23 Referências Cuadros, A. M, Paulovich, F. V., Minghim, R., Telles, G. P - Point Placement by Phylogenetic Trees and its Application to Visual Analysis of Document Collections IEEE VAST 2007, Sacramento, CA, USA, IEEE CS Press, pp Paulovih, F. V., Oliveira, M.C.F., Minghim, R. - The Projection Explorer: A Flexible Tool for Projection-based Multidimensional Visualization, IEEE Sibgrapi 2007, IEEE CS Press, Belo Horizonte, Brazil,pp Lopes, A. A., Minghim, R., Melo, V., Paulovich, F.V.; Mapping texts through dimensionality reduction and visualization techniques for interactive exploration of document collections, SPIE Conference on Visualization and Data Analysis, San Jose, CA, USA Jan. 2006, 6060T-11. Minghim, R., Paulovich, F.V., Lopes, A. A.; Content-based text mapping using multidimensional projections for exploration of document collections, SPIE Conference on Visualization and Data Analysis, San Jose, CA, USA Jan. 2006, 6060T Referências Pinho, R. D. ; Oliveira, M. C. F. ; Minghim, R. ; Andrade, M. G.. Voromap: A Voronoi-based Tool for Visual Exploration of Multidimensional Data. In: 10th International Conference on Information Visualization, 2006, Londres. Proceedings of Information Visualisation 2006, v. 1. p Paulovich, F. V. ; Minghim, R.. Text Map Explorer: a Tool to Create and Explore Document Maps. In: Information Visualisation 2006 (IV06) 10th International Conference on Information Visualisation, 2006, Londres. Proceedings of Information Visualisation 2006, v. 1. p Paulovich, F. V. ; Nonato, L. G. ; MINGHIM, R. ; Levkowitz, H.. Least Square Projection: a fast high precision multidimensional projection technique and its application to document mapping. IEEE Transactions on Visualization and Computer Graphics, Minghim, R. ; Levkowitz, H. ; Nonato, L. G. ; Watanabe, L. S. ; Salvador, V. C. L. ; Lopes, H. ; Pesco, S. ; Tavares, G.. Spider Cursor: A simple versatile interaction tool for data visualization and exploration. In: ACM GRAPHITE'05-3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia, 2005, Dunedin. Proceedings of Graphite 2005, p
1 Information retrieval fundamentals
CS 630 Lecture 1: 01/26/2006 Lecturer: Lillian Lee Scribes: Asif-ul Haque, Benyah Shaparenko This lecture focuses on the following topics Information retrieval fundamentals Vector Space Model (VSM) Deriving
What is Text mining? To discover the useful patterns/contents from the large amount of data that can be structured or unstructured.
What is Text mining? To discover the useful patterns/contents from the large amount of data that can be structured or unstructured. Text mining What can be used for text mining?? Classification/categorization
Boolean and Vector Space Retrieval Models
Boolean and Vector Space Retrieval Models Many slides in this section are adapted from Prof. Joydeep Ghosh (UT ECE) who in turn adapted them from Prof. Dik Lee (Univ. of Science and Tech, Hong Kong) 1
Natural Language Processing. Topics in Information Retrieval. Updated 5/10
Natural Language Processing Topics in Information Retrieval Updated 5/10 Outline Introduction to IR Design features of IR systems Evaluation measures The vector space model Latent semantic indexing Background
Text Analytics (Text Mining)
http://poloclub.gatech.edu/cse6242 CSE6242 / CX4242: Data & Visual Analytics Text Analytics (Text Mining) Concepts, Algorithms, LSI/SVD Duen Horng (Polo) Chau Assistant Professor Associate Director, MS
Mapping of Science. Bart Thijs ECOOM, K.U.Leuven, Belgium
Mapping of Science Bart Thijs ECOOM, K.U.Leuven, Belgium Introduction Definition: Mapping of Science is the application of powerful statistical tools and analytical techniques to uncover the structure
Boolean and Vector Space Retrieval Models CS 290N Some of slides from R. Mooney (UTexas), J. Ghosh (UT ECE), D. Lee (USTHK).
Boolean and Vector Space Retrieval Models 2013 CS 290N Some of slides from R. Mooney (UTexas), J. Ghosh (UT ECE), D. Lee (USTHK). 1 Table of Content Boolean model Statistical vector space model Retrieval
Assessing the Consequences of Text Preprocessing Decisions
Assessing the Consequences of Text Preprocessing Decisions Matthew J. Denny 1 Penn State University Arthur Spirling New York University October 15, 20016 1 Work supported by NSF Grant: DGE-1144860 Common
Exploring Large Digital Library Collections using a Map-based Visualisation
Exploring Large Digital Library Collections using a Map-based Visualisation Dr Mark Hall Research Seminar, Department of Computing, Edge Hill University 7.11.2013 http://www.flickr.com/photos/carlcollins/199792939/
Fall 2018: Introduction to Data Science GIRI NARASIMHAN, SCIS, FIU
Fall 2018: Introduction to Data Science GIRI NARASIMHAN, SCIS, FIU !2 Data Wrangling !3 Database Join (Python merge) unames = ['user_id', 'gender', 'age', 'occupation', 'zip'] users = pd.read_table('data/ml-1m/users.dat',
Information Retrival Ranking. tf-idf. Eddie Aronovich. October 30, 2012
October 30, 2012 Table of contents 1 2 Term Frequency tf idf Inforamation Retrival the techniques of storing and recovering and often disseminating recorded data especially through the use of a computerized
Text Analytics (Text Mining)
http://poloclub.gatech.edu/cse6242 CSE6242 / CX4242: Data & Visual Analytics Text Analytics (Text Mining) Concepts, Algorithms, LSI/SVD Duen Horng (Polo) Chau Assistant Professor Associate Director, MS
CS276A Text Information Retrieval, Mining, and Exploitation. Lecture 4 15 Oct 2002
CS276A Text Information Retrieval, Mining, and Exploitation Lecture 4 15 Oct 2002 Recap of last time Index size Index construction techniques Dynamic indices Real world considerations 2 Back of the envelope
Lecture 16-17: Bayesian Nonparametrics I. STAT 6474 Instructor: Hongxiao Zhu
Lecture 16-17: Bayesian Nonparametrics I STAT 6474 Instructor: Hongxiao Zhu Plan for today Why Bayesian Nonparametrics? Dirichlet Distribution and Dirichlet Processes. 2 Parameter and Patterns Reference:
N-gram N-gram Language Model for Large-Vocabulary Continuous Speech Recognition
2010 11 5 N-gram N-gram Language Model for Large-Vocabulary Continuous Speech Recognition 1 48-106413 Abstract Large-Vocabulary Continuous Speech Recognition(LVCSR) system has rapidly been growing today.
Variable Latent Semantic Indexing
Variable Latent Semantic Indexing Prabhakar Raghavan Yahoo! Research Sunnyvale, CA November 2005 Joint work with A. Dasgupta, R. Kumar, A. Tomkins. Yahoo! Research. Outline 1 Introduction 2 Background
Information Retrieval
Introduction to Information Retrieval CS276: Information Retrieval and Web Search Christopher Manning and Prabhakar Raghavan Lecture 6: Scoring, Term Weighting and the Vector Space Model This lecture;
Topics Covered in Math 115
Topics Covered in Math 115 Basic Concepts Integer Exponents Use bases and exponents. Evaluate exponential expressions. Apply the product, quotient, and power rules. Polynomial Expressions Perform addition
5 Systems of Equations
Systems of Equations Concepts: Solutions to Systems of Equations-Graphically and Algebraically Solving Systems - Substitution Method Solving Systems - Elimination Method Using -Dimensional Graphs to Approximate
1. Ignoring case, extract all unique words from the entire set of documents.
CS 378 Introduction to Data Mining Spring 29 Lecture 2 Lecturer: Inderjit Dhillon Date: Jan. 27th, 29 Keywords: Vector space model, Latent Semantic Indexing(LSI), SVD 1 Vector Space Model The basic idea
Latent Semantic Analysis. Hongning Wang
Latent Semantic Analysis Hongning Wang CS@UVa Recap: vector space model Represent both doc and query by concept vectors Each concept defines one dimension K concepts define a high-dimensional space Element
Data preprocessing. DataBase and Data Mining Group 1. Data set types. Tabular Data. Document Data. Transaction Data. Ordered Data
Elena Baralis and Tania Cerquitelli Politecnico di Torino Data set types Record Tables Document Data Transaction Data Graph World Wide Web Molecular Structures Ordered Spatial Data Temporal Data Sequential
Mapping Interdisciplinary Research Domains
Mapping Interdisciplinary Research Domains Katy Börner School of Library and Information Science katy@indiana.edu Presentation at the Parmenides Center for the Study of Thinking, Island of Elba, Italy
Part I: Web Structure Mining Chapter 1: Information Retrieval and Web Search
Part I: Web Structure Mining Chapter : Information Retrieval an Web Search The Web Challenges Crawling the Web Inexing an Keywor Search Evaluating Search Quality Similarity Search The Web Challenges Tim
Language as a Stochastic Process
CS769 Spring 2010 Advanced Natural Language Processing Language as a Stochastic Process Lecturer: Xiaojin Zhu jerryzhu@cs.wisc.edu 1 Basic Statistics for NLP Pick an arbitrary letter x at random from any
Outline for today. Information Retrieval. Cosine similarity between query and document. tf-idf weighting
Outline for today Information Retrieval Efficient Scoring and Ranking Recap on ranked retrieval Jörg Tiedemann jorg.tiedemann@lingfil.uu.se Department of Linguistics and Philology Uppsala University Efficient
Slide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University.
Slide source: Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University http://www.mmds.org #1: C4.5 Decision Tree - Classification (61 votes) #2: K-Means - Clustering
Motivation. User. Retrieval Model Result: Query. Document Collection. Information Need. Information Retrieval / Chapter 3: Retrieval Models
3. Retrieval Models Motivation Information Need User Retrieval Model Result: Query 1. 2. 3. Document Collection 2 Agenda 3.1 Boolean Retrieval 3.2 Vector Space Model 3.3 Probabilistic IR 3.4 Statistical
Scoring (Vector Space Model) CE-324: Modern Information Retrieval Sharif University of Technology
Scoring (Vector Space Model) CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2016 Most slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276, Stanford)
Text classification II CE-324: Modern Information Retrieval Sharif University of Technology
Text classification II CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2017 Some slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276, Stanford)
Scoring (Vector Space Model) CE-324: Modern Information Retrieval Sharif University of Technology
Scoring (Vector Space Model) CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2017 Most slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276, Stanford)
Vector Space Model. Yufei Tao KAIST. March 5, Y. Tao, March 5, 2013 Vector Space Model
Vector Space Model Yufei Tao KAIST March 5, 2013 In this lecture, we will study a problem that is (very) fundamental in information retrieval, and must be tackled by all search engines. Let S be a set
CS145: INTRODUCTION TO DATA MINING
CS145: INTRODUCTION TO DATA MINING Text Data: Topic Model Instructor: Yizhou Sun yzsun@cs.ucla.edu December 4, 2017 Methods to be Learnt Vector Data Set Data Sequence Data Text Data Classification Clustering
PARTICLE SWARM OPTIMISATION (PSO)
PARTICLE SWARM OPTIMISATION (PSO) Perry Brown Alexander Mathews Image: http://www.cs264.org/2009/projects/web/ding_yiyang/ding-robb/pso.jpg Introduction Concept first introduced by Kennedy and Eberhart
Classification. Team Ravana. Team Members Cliffton Fernandes Nikhil Keswaney
Email Classification Team Ravana Team Members Cliffton Fernandes Nikhil Keswaney Hello! Cliffton Fernandes MS-CS Nikhil Keswaney MS-CS 2 Topic Area Email Classification Spam: Unsolicited Junk Mail Ham
Generative Models. CS4780/5780 Machine Learning Fall Thorsten Joachims Cornell University
Generative Models CS4780/5780 Machine Learning Fall 2012 Thorsten Joachims Cornell University Reading: Mitchell, Chapter 6.9-6.10 Duda, Hart & Stork, Pages 20-39 Bayes decision rule Bayes theorem Generative
Scoring (Vector Space Model) CE-324: Modern Information Retrieval Sharif University of Technology
Scoring (Vector Space Model) CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2014 Most slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276, Stanford)
Dealing with Text Databases
Dealing with Text Databases Unstructured data Boolean queries Sparse matrix representation Inverted index Counts vs. frequencies Term frequency tf x idf term weights Documents as vectors Cosine similarity
Recap of the last lecture. CS276A Information Retrieval. This lecture. Documents as vectors. Intuition. Why turn docs into vectors?
CS276A Information Retrieval Recap of the last lecture Parametric and field searches Zones in documents Scoring documents: zone weighting Index support for scoring tf idf and vector spaces Lecture 7 This
RETRIEVAL MODELS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
RETRIEVAL MODELS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Boolean model Vector space model Probabilistic
Today s topics. Example continued. FAQs. Using n-grams. 2/15/2017 Week 5-B Sangmi Pallickara
Spring 2017 W5.B.1 CS435 BIG DATA Today s topics PART 1. LARGE SCALE DATA ANALYSIS USING MAPREDUCE FAQs Minhash Minhash signature Calculating Minhash with MapReduce Locality Sensitive Hashing Sangmi Lee
Information Retrieval and Topic Models. Mausam (Based on slides of W. Arms, Dan Jurafsky, Thomas Hofmann, Ata Kaban, Chris Manning, Melanie Martin)
Information Retrieval and Topic Models Mausam (Based on slides of W. Arms, Dan Jurafsky, Thomas Hofmann, Ata Kaban, Chris Manning, Melanie Martin) Sec. 1.1 Unstructured data in 1620 Which plays of Shakespeare
Vector Space Scoring Introduction to Information Retrieval Informatics 141 / CS 121 Donald J. Patterson
Vector Space Scoring Introduction to Information Retrieval Informatics 141 / CS 121 Donald J. Patterson Content adapted from Hinrich Schütze http://www.informationretrieval.org Querying Corpus-wide statistics
Machine Learning for natural language processing
Machine Learning for natural language processing Classification: k nearest neighbors Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 28 Introduction Classification = supervised method
Geometry A & Geometry B & Honors Geometry Summer Packet
Geometry A & Geometry B & Honors Geometry Summer Packet RADICALS Radical expressions contain numbers and/or variables under a radical sign,. A radical sign tells you to take the square root of the value
WordSpace Visual Summary of Text Corpora
WordSpace Visual Summary of Text Corpora Ulrik Brandes, Martin Hoefer, Jürgen Lerner Dept. of Computer & Information Science, Konstanz Univ.,Box D 67, 78457 Konstanz, Germany ABSTRACT In recent years several
Characteristics of Linear Functions (pp. 1 of 8)
Characteristics of Linear Functions (pp. 1 of 8) Algebra 2 Parent Function Table Linear Parent Function: x y y = Domain: Range: What patterns do you observe in the table and graph of the linear parent
Text Mining. Dr. Yanjun Li. Associate Professor. Department of Computer and Information Sciences Fordham University
Text Mining Dr. Yanjun Li Associate Professor Department of Computer and Information Sciences Fordham University Outline Introduction: Data Mining Part One: Text Mining Part Two: Preprocessing Text Data
Prediction of Citations for Academic Papers
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
Gaussian Models
Gaussian Models ddebarr@uw.edu 2016-04-28 Agenda Introduction Gaussian Discriminant Analysis Inference Linear Gaussian Systems The Wishart Distribution Inferring Parameters Introduction Gaussian Density
Generative Models for Classification
Generative Models for Classification CS4780/5780 Machine Learning Fall 2014 Thorsten Joachims Cornell University Reading: Mitchell, Chapter 6.9-6.10 Duda, Hart & Stork, Pages 20-39 Generative vs. Discriminative
ALGEBRA I CURRICULUM OUTLINE
ALGEBRA I CURRICULUM OUTLINE 2013-2014 OVERVIEW: 1. Operations with Real Numbers 2. Equation Solving 3. Word Problems 4. Inequalities 5. Graphs of Functions 6. Linear Functions 7. Scatterplots and Lines
Section 4.5 Graphs of Logarithmic Functions
6 Chapter 4 Section 4. Graphs of Logarithmic Functions Recall that the eponential function f ( ) would produce this table of values -3 - -1 0 1 3 f() 1/8 ¼ ½ 1 4 8 Since the arithmic function is an inverse
Appendix A. Common Mathematical Operations in Chemistry
Appendix A Common Mathematical Operations in Chemistry In addition to basic arithmetic and algebra, four mathematical operations are used frequently in general chemistry: manipulating logarithms, using
RADICAL AND RATIONAL FUNCTIONS REVIEW
RADICAL AND RATIONAL FUNCTIONS REVIEW Name: Block: Date: Total = % 2 202 Page of 4 Unit 2 . Sketch the graph of the following functions. State the domain and range. y = 2 x + 3 Domain: Range: 2. Identify
Similarity and Dissimilarity
1//015 Similarity and Dissimilarity COMP 465 Data Mining Similarity of Data Data Preprocessing Slides Adapted From : Jiawei Han, Micheline Kamber & Jian Pei Data Mining: Concepts and Techniques, 3 rd ed.
CSC2524 L0101 TOPICS IN INTERACTIVE COMPUTING: INFORMATION VISUALISATION DATA MODELS. Fanny CHEVALIER
CSC2524 L0101 TOPICS IN INTERACTIVE COMPUTING: INFORMATION VISUALISATION DATA MODELS Fanny CHEVALIER VISUALISATION DATA MODELS AND REPRESENTATIONS Source: http://www.hotbutterstudio.com/ THE INFOVIS
Name: Class Period: Due Date: Unit 2 What are we made of? Unit 2.2 Test Review
Name: Class Period: Due Date: TEKS covered: Unit 2 What are we made of? Unit 2.2 Test Review 8.5D recognize that chemical formulas are used to identify substances and determine the number of atoms of each
Pivoted Length Normalization I. Summary idf II. Review
2 Feb 2006 1/11 COM S/INFO 630: Representing and Accessing [Textual] Digital Information Lecturer: Lillian Lee Lecture 3: 2 February 2006 Scribes: Siavash Dejgosha (sd82) and Ricardo Hu (rh238) Pivoted
Text classification II CE-324: Modern Information Retrieval Sharif University of Technology
Text classification II CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2016 Some slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276, Stanford)
Information Retrieval and Web Search
Information Retrieval and Web Search IR models: Vector Space Model IR Models Set Theoretic Classic Models Fuzzy Extended Boolean U s e r T a s k Retrieval: Adhoc Filtering Brosing boolean vector probabilistic
Visualizing the Evolution of a Subject Domain: A Case Study
Visualizing the Evolution of a Subject Domain: A Case Study Chaomei Chen Brunel University Leslie Carr Southampton University Abstract We explore the potential of information visualization techniques in
In order to compare the proteins of the phylogenomic matrix, we needed a similarity
Similarity Matrix Generation In order to compare the proteins of the phylogenomic matrix, we needed a similarity measure. Hamming distances between phylogenetic profiles require the use of thresholds for
Linear Spectral Hashing
Linear Spectral Hashing Zalán Bodó and Lehel Csató Babeş Bolyai University - Faculty of Mathematics and Computer Science Kogălniceanu 1., 484 Cluj-Napoca - Romania Abstract. assigns binary hash keys to
Vector Space Scoring Introduction to Information Retrieval INF 141 Donald J. Patterson
Vector Space Scoring Introduction to Information Retrieval INF 141 Donald J. Patterson Content adapted from Hinrich Schütze http://www.informationretrieval.org Querying Corpus-wide statistics Querying
Electrical thunderstorm nowcasting using lightning data mining
Data Mining VII: Data, Text and Web Mining and their Business Applications 161 Electrical thunderstorm nowcasting using lightning data mining C. A. M. Vasconcellos 1, C. L. Curotto 2, C. Benetti 1, F.
Applications Of Spatial Data Structures: Computer Graphics, Image Processing And Gis (Addison-Wesley Series In Computer Science) By Hanan Samet
Applications Of Spatial Data Structures: Computer Graphics, Image Processing And Gis (Addison-Wesley Series In Computer Science) By Hanan Samet READ ONLINE If searching for the book Applications of Spatial
Understanding Interlinked Data
Understanding Interlinked Data Visualising, Exploring, and Analysing Ontologies Olaf Noppens and Thorsten Liebig (Ulm University, Germany olaf.noppens@uni-ulm.de, thorsten.liebig@uni-ulm.de) Abstract Companies
Parameter Free Bursty Events Detection in Text Streams
Parameter Free Bursty Events Detection in Text Streams Gabriel Pui Cheong Fung Jeffrey Xu Yu Philip S. Yu Hongjun Lu The Chinese University of Hong Kong, Hong Kong, China, {pcfung,yu}@se.cuhk.edu.hk T.
Retrieval by Content. Part 2: Text Retrieval Term Frequency and Inverse Document Frequency. Srihari: CSE 626 1
Retrieval by Content Part 2: Text Retrieval Term Frequency and Inverse Document Frequency Srihari: CSE 626 1 Text Retrieval Retrieval of text-based information is referred to as Information Retrieval (IR)
²Austrian Center of Competence for Tribology, AC2T research GmbH, Viktor-Kaplan-Straße 2-C, A Wiener Neustadt, Austria
Bibliometric field delineation with heat maps of bibliographically coupled publications using core documents and a cluster approach - the case of multiscale simulation and modelling (research in progress)
ADVANCED PLACEMENT PHYSICS 1
ADVANCED PLACEMENT PHYSICS 1 MS. LAWLESS ALAWLESS@SOMERVILLESCHOOLS.ORG Purpose of Assignments: This assignment is broken into 8 Skills. Skills 1-6, and 8 are review of science and math literacy. Skill
Ranked Retrieval (2)
Text Technologies for Data Science INFR11145 Ranked Retrieval (2) Instructor: Walid Magdy 31-Oct-2017 Lecture Objectives Learn about Probabilistic models BM25 Learn about LM for IR 2 1 Recall: VSM & TFIDF
Chap 2: Classical models for information retrieval
Chap 2: Classical models for information retrieval Jean-Pierre Chevallet & Philippe Mulhem LIG-MRIM Sept 2016 Jean-Pierre Chevallet & Philippe Mulhem Models of IR 1 / 81 Outline Basic IR Models 1 Basic
CPSC 340: Machine Learning and Data Mining. Data Exploration Fall 2016
CPSC 340: Machine Learning and Data Mining Data Exploration Fall 2016 Admin Assignment 1 is coming over the weekend: Start soon. Sign up for the course page on Piazza. www.piazza.com/ubc.ca/winterterm12016/cpsc340/home
SCIE 4101 Fall Math Review Packet #2 Notes Patterns and Algebra I Topics
SCIE 4101 Fall 014 Math Review Packet # Notes Patterns and Algebra I Topics I consider Algebra and algebraic thought to be the heart of mathematics everything else before that is arithmetic. The first
Term Weighting and Vector Space Model. Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze
Term Weighting and Vector Space Model Reference: Introduction to Information Retrieval by C. Manning, P. Raghavan, H. Schutze 1 Ranked retrieval Thus far, our queries have all been Boolean. Documents either
Data Mining: Data. Lecture Notes for Chapter 2. Introduction to Data Mining
Data Mining: Data Lecture Notes for Chapter 2 Introduction to Data Mining by Tan, Steinbach, Kumar Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 1 10 What is Data? Collection of data objects
TOPIC 3: READING AND REPORTING NUMERICAL DATA
Page 1 TOPIC 3: READING AND REPORTING NUMERICAL DATA NUMERICAL DATA 3.1: Significant Digits; Honest Reporting of Measured Values Why report uncertainty? That is how you tell the reader how confident to
Descriptive Data Summarization
Descriptive Data Summarization Descriptive data summarization gives the general characteristics of the data and identify the presence of noise or outliers, which is useful for successful data cleaning
Information Retrieval
Introduction to Information Retrieval CS276: Information Retrieval and Web Search Pandu Nayak and Prabhakar Raghavan Lecture 6: Scoring, Term Weighting and the Vector Space Model This lecture; IIR Sections
GUIDED NOTES 4.1 LINEAR FUNCTIONS
GUIDED NOTES 4.1 LINEAR FUNCTIONS LEARNING OBJECTIVES In this section, you will: Represent a linear function. Determine whether a linear function is increasing, decreasing, or constant. Interpret slope
Topic Models and Applications to Short Documents
Topic Models and Applications to Short Documents Dieu-Thu Le Email: dieuthu.le@unitn.it Trento University April 6, 2011 1 / 43 Outline Introduction Latent Dirichlet Allocation Gibbs Sampling Short Text
Visualizing Temporal Semantic Relations in Dynamic Information Landscapes
Visualizing Temporal Semantic Relations in Dynamic Information Landscapes Vedran Sabol vsabol@know center.at Know Center Graz Graz, Austria Arno Scharl scharl@modul.ac.at MODUL University Vienna Vienna,
ESCONDIDO UNION HIGH SCHOOL DISTRICT COURSE OF STUDY OUTLINE AND INSTRUCTIONAL OBJECTIVES
ESCONDIDO UNION HIGH SCHOOL DISTRICT COURSE OF STUDY OUTLINE AND INSTRUCTIONAL OBJECTIVES COURSE TITLE: Algebra II A/B COURSE NUMBERS: (P) 7241 / 2381 (H) 3902 / 3903 (Basic) 0336 / 0337 (SE) 5685/5686
The Accuracy of Network Visualizations. Kevin W. Boyack SciTech Strategies, Inc.
The Accuracy of Network Visualizations Kevin W. Boyack SciTech Strategies, Inc. kboyack@mapofscience.com Overview Science mapping history Conceptual Mapping Early Bibliometric Maps Recent Bibliometric
Information Retrieval. Lecture 6
Information Retrieval Lecture 6 Recap of the last lecture Parametric and field searches Zones in documents Scoring documents: zone weighting Index support for scoring tf idf and vector spaces This lecture
Data Mining: Data. Lecture Notes for Chapter 2. Introduction to Data Mining
Data Mining: Data Lecture Notes for Chapter 2 Introduction to Data Mining by Tan, Steinbach, Kumar Similarity and Dissimilarity Similarity Numerical measure of how alike two data objects are. Is higher
Ranked IR. Lecture Objectives. Text Technologies for Data Science INFR Learn about Ranked IR. Implement: 10/10/2018. Instructor: Walid Magdy
Text Technologies for Data Science INFR11145 Ranked IR Instructor: Walid Magdy 10-Oct-2018 Lecture Objectives Learn about Ranked IR TFIDF VSM SMART notation Implement: TFIDF 2 1 Boolean Retrieval Thus
LG #16 Solving Systems by Graphing & Algebra
LG #16 Solving Systems by Graphing & Algebra Agenda: Topic 1 Example 1 Relate a System of Equations to a Context A springboard diver practices her dives from a 3-m springboard. Her coach uses video analysis
Hennig, B.D. and Dorling, D. (2014) Mapping Inequalities in London, Bulletin of the Society of Cartographers, 47, 1&2,
Hennig, B.D. and Dorling, D. (2014) Mapping Inequalities in London, Bulletin of the Society of Cartographers, 47, 1&2, 21-28. Pre- publication draft without figures Mapping London using cartograms The
Term Weighting and the Vector Space Model. borrowing from: Pandu Nayak and Prabhakar Raghavan
Term Weighting and the Vector Space Model borrowing from: Pandu Nayak and Prabhakar Raghavan IIR Sections 6.2 6.4.3 Ranked retrieval Scoring documents Term frequency Collection statistics Weighting schemes
Visualizing Correlation Networks
Visualizing Correlation Networks Jürgen Lerner University of Konstanz Workshop on Networks in Finance Barcelona, 4 May 2012 From correlation matrices to network visualization. correlation distance coordinates
CS47300: Web Information Search and Management
CS47300: Web Information Search and Management Prof. Chris Clifton 6 September 2017 Material adapted from course created by Dr. Luo Si, now leading Alibaba research group 1 Vector Space Model Disadvantages:
Bridging the Practices of Two Communities
Educational Knowledge Domain Visualizations: Tools to Navigate, Understand, and Internalize the Structure of Scholarly Knowledge and Expertise Peter A. Hook http://ella.slis.indiana.edu/~pahook Mapping
Chapter 10: Information Retrieval. See corresponding chapter in Manning&Schütze
Chapter 10: Information Retrieval See corresponding chapter in Manning&Schütze Evaluation Metrics in IR 2 Goal In IR there is a much larger variety of possible metrics For different tasks, different metrics
Shared Segmentation of Natural Scenes. Dependent Pitman-Yor Processes
Shared Segmentation of Natural Scenes using Dependent Pitman-Yor Processes Erik Sudderth & Michael Jordan University of California, Berkeley Parsing Visual Scenes sky skyscraper sky dome buildings trees
5.1 Extreme Values of Functions
5.1 Extreme Values of Functions Lesson Objective To be able to find maximum and minimum values (extrema) of functions. To understand the definition of extrema on an interval. This is called optimization
CS 154 Formal Languages and Computability Assignment #2 Solutions
CS 154 Formal Languages and Computability Assignment #2 Solutions Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak www.cs.sjsu.edu/~mak Assignment #2: Question 1
Chapter 5: Data Transformation
Chapter 5: Data Transformation The circle of transformations The x-squared transformation The log transformation The reciprocal transformation Regression analysis choosing the best transformation TEXT: