# Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig

Save this PDF as:

Size: px
Start display at page:

Download "Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs."

## Transcription

1 Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig

2 14 Previous Lecture 13 Indexes for Multimedia Data 13.1 R-Trees 13.2 M-Trees Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 2

3 14 Indexes for Multimedia Data 2 14 Indexes for Multimedia Data Curse of Dimensionality 14.2 Dimension Reduction 14.3 GEMINI Indexing Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 3

4 14.1 Curse of Dimensionality Curse of Dimensionality Why are traditional index structures useless in multidimensional spaces? For (approx.) uniformly distributed data: all known index trees start failing at about15-20 dimensions Their use leads to higher costs than a linear scan Is it possible to create an efficient high-dimensional tree structure? What structure do high-dimensional spaces have anyway? Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 4

5 14.1 Basic Geometry Relationship between high-dimensional cubes and spheres in the R d (Hyper-) cube: Edge length 1 Center c = (½, ½,, ½) (Hyper-) sphere: Radius 1 Center o = (0, 0,..., 0) Is the center of the cube always inside the sphere? o c Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 5

6 14.1 Basic Geometry Calculating the Euclidean distance between the two centers: For d = 4 the center of the cube is on the edge of the sphere For d 5 the center of the cube is outside the sphere Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 6

7 14.1 Basic Geometry Where are points in high-dimensional space located? Inside or on the surface of a cube? Consider cube A = [0,1] d Cut out smaller cube B with edge length (1-2ε) The volume of A is 1, the volume of B is (1 2ε) d A B (1-2 ) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 7

8 14.1 Basic Geometry In high-dimensional spaces, almost all points lie near the surface of A What is the volume of the inner cube? ε / d ,1 0,64 1, , , ,05 0,81 0,01 2, , , ,01 0,96 0,36 0,13 4, , If a point is positioned randomly (uniformly) in the outer cube, for large d it is with very low probability in the inner cube Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 8

9 14.1 Basic Geometry How big is the volume of spheres inscribed in cubes? Again cube A = [0,1] d and an inscribed sphere S For even d, S has volume 0.5 Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 9

10 14.1 Basic Geometry How big is the volume of S? How many randomly distributed points in the cube are needed, to ensure on average that at least one lies within the sphere? The number of points grows exponentially in d d Volume Nr. Points 2 0, , , , , , , , Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 10

11 14.1 Basic Geometry How far away is the nearest neighbor from the center of the sphere? 1,000,000 uniformly distributed points in the cube Even the closest neighbors are far away! The maximum distance is d 1/2 (diagonal) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 11

12 14.1 Basic Geometry How many points are there at exactly distance s from the center? d s: As the distance increases, the variance is lower! For large d, almost all points have the same distance from the query (Beyer et al, 1998) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 12

13 14.1 Conclusion High-dimensional spaces are different In high-dimensional spaces, the sequential search through the objects is often better than using some index structure On the other hand, our analysis was focused on uniformly distributed points in Euclidean spaces Real-world data may have an intrinsic lower dimensionality Example: dimensions price and maximal speed in a vehicle database Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 13

14 14.1 Speeding up Sequential Search Vector Approximation Files (Weber et al, 1998) Partition each dimension into intervals Dimension i is divided into 2 b i intervals Represented by b i bits E.g., splitting some dimension in 4 intervals Representation of these intervals by 00, 01, 10 and 11 The i-th coordinate of each data point can thus approximately be represented by b i bits Thus, each point can be approximated by b = b 1 + b b d bits Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 14

15 14.1 VA Files Points and their encoding in a VA-File Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 15

16 14.1 VA Files Advantages of VA Files If b is large enough, there are significantly more partitions of space into hyper-cubes as there are data points Thus, collisions are nearly impossible, and every bit vector represents just one point It is much faster to perform bit-wise operations on fixed-length bit vectors, than performing calculations on the original representation of the data Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 16

17 14.1 VA Files Query processing: filter & refine e.g., region queries: Sequentially scan over all partitions For partitions that intersect with the search region Check all contained points using their exact coordinates Actual results False drops Excluded points Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 17

18 14.2 Dimensionality Reduction Indexing of high dimensional data is problematic, but does every dimension contain essential information? Strongly correlated dimensions can be combined e.g., price in Euro and price in Dollars If in some dimensions the objects differ more, then these dimensions also carry more information than others Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 18

19 14.2 Principal Component Analysis Principal Component Analysis (PCA), also known as Karhunen-Loève transform Detection of linear dependencies between features, so-called axes The most pronounced axis is called the main axis The correlation is always subject to a certain variation Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 19

20 14.2 Principal Component Analysis Linear dependence is a sign of redundancy A dimension may be represented as a linear combination of other dimensions Idea Rotate (and shift) the axes such that there is no linear dependence between them Remove all axes with low variance, to keep the error introduced by omission of information minimal Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 20

21 14.2 Principal Component Analysis Example: rotate the basis of a coordinate system Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 21

22 14.2 Principal Component Analysis The covariance matrix determines linear dependencies between different data dimensions Let X = (X 1,..., X d ) be a random vector which is uniformly distributed on the set of (d-dimensional) data points Center the coordinate system around the mean:, with Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 22

23 14.2 Principal Component Analysis The covariance between X i and X j is The covariance is positive, if X j always tends to have large values whenever X i does (and vice versa) The covariance is negative, if X j always tends to have large values whenever X i has small values (and vice versa) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 23

24 14.2 Principal Component Analysis The covariance matrix contains all pair-wise covariances between the dimensions Dimensions with nonzero covariance are interdependent and thus carry redundant information Idea: rotate the centered data around the origin such that all covariances have value 0 The dimensions are then linearly independent from each other Distances between data points are preserved, since it is only a rotation Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 24

25 14.2 Principal Component Analysis Linear Algebra: Any symmetric matrix A can be diagonalized This means that there are matrices Q and D with A = Q D Q 1 Where Q is orthogonal, therefore Q T = Q 1 D is diagonal, i.e., besides the main diagonal it contains only 0 s The orthogonal matrices belonging to linear mappings are always just reflections and rotations Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 25

26 14.2 Principal Component Analysis The covariance matrix is symmetric If the covariance matrix is diagonalized and the transformation corresponding to matrix Q is applied to the data, then the covariance between the new data dimensions is always 0 The properties of the transformation are transferred to the covariance! Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 26

27 14.2 Principal Component Analysis The diagonal matrix D contains the eigenvalues of the covariance matrix eigenvalue decomposition Dimensions with low variance of the data (small corresponding eigenvalues) can be removed after the transformations The resulting error is small and can be generally neglected Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 27

28 14.2 Example Data points: Center m= Covariance matrix Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 28

29 14.2 Example Transformation of the data: Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 29

30 14.2 Example x-axis is the main axis (since it has the largest eigenvalue) Variance on the y axis is small compared with variance on the x-axis (0.8 vs. 2.83) y-axis can therefore be omitted without much loss of information (dimensionality reduction) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 30

31 14.2 Latent Semantic Indexing A similar method to principal component analysis is Latent Semantic Indexing (LSI) In principal component analysis, the covariance matrix is decomposed, while in LSI the feature matrix F is decomposed The feature matrix contains the feature vectors as columns Note, this matrix is usually not quadratic and symmetric In this case: F = U D V T with diagonal matrix D and matrices U and V with orthonormal column vectors Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 31

32 14.2 Latent Semantic Indexing The decomposition of the feature matrix is a transformation on minimal concepts that are scaled by the eigenvalues in D Each concept is an artificial dimension of a vector space, which expresses the latent semantics of the feature vectors LSI is used in information retrieval, to represent synonyms by a common concept and to split ambiguous terms into different concepts Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 32

33 14.2 Latent Semantic Indexing Through the decomposition of the feature matrix, the semantics of feature vectors (the columns of the feature matrix) is contained in matrix V T feature dimensions (the rows of the feature matrix) is contained in matrix U They can be used as in the principal component analysis for extracting dependencies Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 33

34 14.2 Latent Semantic Indexing According to the eigenvalue decomposition, D indicates the importance of the new dimensions Irrelevant dimensions (particularly those with eigenvalue 0) can be deleted with minimal error Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 34

35 14.2 Latent Semantic Indexing The decomposition of the feature matrix for the previous example yields: = Two latent dimensions with weights 7.95 and 1.8 Weights of these dimensions in point 1: 0.17 and U and V transform the original axes, respectively the data points in the new space Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 35

36 14.2 Dimension Reduction Principle component analysis and LSI, however, are difficult to use when there are frequent changes in the data Data changes could drastically affect the feature values and their respective variances and covariances For this reason, they are usually only calculated for a representative portion of the data and used for all objects Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 36

37 14.3 GEMINI Indexing GEMINI - GEneric Multimedia Object INdexIng (Faloutsos, 1996) Can be used for hard to calculate distance functions between objects (e.g., edit distances) Only useful, if there are no directly usable efficient search algorithms Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 37

38 14.3 GEMINI Indexing Idea: use a distance function which is easy to compute as an estimate for the complex distance function and immediately prune some objects, i.e. a quick and dirty test E.g., use the distance regarding average colors for the exclusion of certain histograms from the comparison A histogram with avg. color red will be more similar to a histogram with avg. color orange, than to one with avg. color blue Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 38

39 14.3 GEMINI Indexing Assume we have to calculate a complex distance function d(a, B) on the set of objects O Choose a function (transformation) f on O and a simple distance function δ with the property A, B O : δ(f(a), f(b)) d(a, B) ( lower bounding property ) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 39

40 14.3 Example Comparison of time series for stock quotes The comparison of two curves with the Euclidean distance (d) on a discrete grid (e.g., closing prices) is very complicated Transforming each curve with DFT and comparing the coefficients yields the same result, but is just as expensive (Parseval's Theorem) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 40

41 14.3 Example But comparing only the first few coefficients corresponds to a dimension reduction (f) The Euclidean distance of only the first coefficient is faster to compute (δ) Since the Euclidean distance is calculated as a sum of non-negative terms (square), the distance δ of the first term always underestimates the distance d of all the terms (lower bounding) Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 41

42 14.3 Algorithm Preparation Transform all the database objects with function f Pruning To answer a region query (Q, r) exclude all objects A with δ(a, Q)> r from the search Query processing Compute d(b, Q) for all remaining objects B and exclude all objects with d(b, Q) > r Return all the remaining elements Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 42

43 14.3 Algorithm By using estimations false positives may occur, but never false negatives Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 43

44 14.3 Nearest Neighbors Nearest-neighbor queries can be performed using the index, too Attention: the nearest neighbor according to δ is not always the nearest neighbor according to d Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 44

45 14.3 Nearest Neighbors However, if A is the nearest neighbor of Q regarding δ, then the nearest neighbor of Q regarding d can have at most distance d(a, Q) Therefore: Find the nearest neighbors A of Q regarding δ Determine d(a, Q) Create an area query with radius d(a, Q) The nearest neighbor of Q regarding d is guaranteed to be among the results Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 45

46 14.3 Fast Map How can complicated distance functions be simplified (respecting the lower bounding)? Fast Map represents all database objects as points in R k, on the basis of some random distance function d (Faloutsos and Lin, 1995) The Euclidean distance then allows an approximation of the original distance Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 46

47 14.3 Fast Map Fast Map represents the objects in the k-dimensional space, where k is a pre-selected constant The higher the k, the more accurate is the respective approximation The lower the k, the more efficient is the search process Solution: find a suitable compromise depending on the application Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 47

48 14.3 Fast Map Requirements Efficient mapping (if possible only linear effort) Good distance approximation when regarding the original distances Efficient mapping of new objects independent of all other objects Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 48

49 14.3 Fast Map Idea: consider all the objects as already in k- dimensional Euclidean space, however without knowing their coordinates Find k orthogonal coordinate axes based on the distances between the points Project the points on the axes and compute the feature values in Euclidean space Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 49

50 14.3 Fast Map Projection (of a point C) on an axis given by pivot points A and B C A Considering the law of cosines: X B Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 50

51 14.3 Fast Map In this way, each point C can be projected onto the coordinate axis given by A and B No coordinates of the involved points are required for this, but only the distances from each other On this axis C has coordinate value d(a, X) C A X B Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 51

52 14.3 Fast Map After a new axis was added: Project all data points on the (k-1)-dimensional hyperplane, whose normal vector is the new axis We again have a data set with a total of k dimensions including the newly created one The coordinates of the remaining (k-1) dimensions are unknown We can however calculate the distances of the points in the hyperplane Arbitrary points A and B in the hyperplane have distance d'(a, B) with where x(a) and x(b) are the coordinates of A and B, on the newly added axis Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 52

53 14.3 Fast Map Repeat this steps k times In this way, we create k new (orthogonal) dimensions, which describe the data This allows us to approximate objects with complex distance function by points in the standard space For this, only the distance matrix is needed Afterwards, we can also apply standard algorithms Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 53

54 14.3 Fast Map Problem: which objects should we choose as pivot elements? The two objects that are farthest apart provide the least loss of accuracy They can be found with quadratic cost and with some heuristics, even within linear time Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 54

55 14.3 Example Calculate the pairwise dissimilarities in a set of words based on the edit distance To allow for indexing, all words should be mapped as multidimensional points in Euclidean space The Euclidean distance can then be used instead of the more complicated editing distance Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 55

56 14.3 Example Edit distance between words O = {Medium, Database, Multimedia, System, Object} =: {w 1,, w 5 } Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 56

57 14.3 Fast Map Mapping on 4-dimensional points: Original: Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 57

58 14 Next Semester Lectures Relational Database Systems II Data Warehousing and Data Mining Techniques Distributed Database Systems and Peer-to-Peer Data Management Seminar Master Seminar Linked Open Data Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 58

59 Data Warehousing Featuring new and exciting ways to store your data state enormous queries mine your Data in seconds learn stuff which is important for industry Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 59

60 Data Warehousing Combining several Data Sources! Data Sources Staging Area Warehouse Data Marts Users Operational System Purchasing Analysis Operational System Summary Data Metadata Raw Data Sales Reporting Flat files Inventory Mining Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 60

61 Data Warehousing Exciting new OLAP Operations! Slice Product Product Laptops CellP. Time Laptops CellP. Time Geography Geography Dice Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 61

62 Data Warehousing Classification and Clustering! Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 62

63 Distributed Data Management Featuring Distributed Query/ Transaction Processing Unstructured P2P Networks Distributed Hash Tables Concepts of Cloud Storage Amazon Dynamo Hadoop Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 63

64 Distributed Data Management Different Distributed Architectures! CPU Memory Disk Disk Memory CPU Network CPU CPU CPU CPU Memory CPU CPU Memory Memory Disk Disk Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 64

65 Distributed Data Management Distributed Data Storage! Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig

66 Distributed Data Management Everything as a Service! Individuals Corporations Non-Commercial? CLOUD Storage Provisioning OS Provisioning Cloud Middle Ware Network Provisioning Service(apps) Provisioning SLA(monitor), Security, Billing, Payment Resources Services Storage Network OS Relational Database Systems 1 Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 66

67 Relational Databases 2 Featuring the architecture of a DBMS storing data on hard disks indexing query evaluation and optimization transactions and ACID recovery Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 67

68 Relational Databases 2 Data structures for indexes! Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 68

69 Relational Databases 2 Query optimization! Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 69

70 Relational Databases 2 Implementing transactions! Transaction Manager Scheduler Storage Manager Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 70

71 Master Seminar Linked Open Data (LOD) Named Entity Recognition and Disambiguation Querying Linked Data & Federated Query Processing Entity Reconciliation Ontology Alignment RDF Stores Data Quality in LOD Relation Mining Programming with LOD Multimedia Databases Wolf-Tilo Balke Institut für Informationssysteme TU Braunschweig 71

### Going Big in Data Dimensionality:

LUDWIG- MAXIMILIANS- UNIVERSITY MUNICH DEPARTMENT INSTITUTE FOR INFORMATICS DATABASE Going Big in Data Dimensionality: Challenges and Solutions for Mining High Dimensional Data Peer Kröger Lehrstuhl für

### Review Jeopardy. Blue vs. Orange. Review Jeopardy

Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round \$200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?

### Data Warehousing. Jens Teubner, TU Dortmund jens.teubner@cs.tu-dortmund.de. Winter 2015/16. Jens Teubner Data Warehousing Winter 2015/16 1

Jens Teubner Data Warehousing Winter 2015/16 1 Data Warehousing Jens Teubner, TU Dortmund jens.teubner@cs.tu-dortmund.de Winter 2015/16 Jens Teubner Data Warehousing Winter 2015/16 13 Part II Overview

### CS 5614: (Big) Data Management Systems. B. Aditya Prakash Lecture #18: Dimensionality Reduc7on

CS 5614: (Big) Data Management Systems B. Aditya Prakash Lecture #18: Dimensionality Reduc7on Dimensionality Reduc=on Assump=on: Data lies on or near a low d- dimensional subspace Axes of this subspace

### Data Warehousing und Data Mining

Data Warehousing und Data Mining Multidimensionale Indexstrukturen Ulf Leser Wissensmanagement in der Bioinformatik Content of this Lecture Multidimensional Indexing Grid-Files Kd-trees Ulf Leser: Data

### EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set

EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set Amhmed A. Bhih School of Electrical and Electronic Engineering Princy Johnson School of Electrical and Electronic Engineering Martin

### Efficient visual search of local features. Cordelia Schmid

Efficient visual search of local features Cordelia Schmid Visual search change in viewing angle Matches 22 correct matches Image search system for large datasets Large image dataset (one million images

### The Scientific Data Mining Process

Chapter 4 The Scientific Data Mining Process When I use a word, Humpty Dumpty said, in rather a scornful tone, it means just what I choose it to mean neither more nor less. Lewis Carroll [87, p. 214] In

### CS 591.03 Introduction to Data Mining Instructor: Abdullah Mueen

CS 591.03 Introduction to Data Mining Instructor: Abdullah Mueen LECTURE 3: DATA TRANSFORMATION AND DIMENSIONALITY REDUCTION Chapter 3: Data Preprocessing Data Preprocessing: An Overview Data Quality Major

### Similarity Search in a Very Large Scale Using Hadoop and HBase

Similarity Search in a Very Large Scale Using Hadoop and HBase Stanislav Barton, Vlastislav Dohnal, Philippe Rigaux LAMSADE - Universite Paris Dauphine, France Internet Memory Foundation, Paris, France

### Text Analytics (Text Mining)

CSE 6242 / CX 4242 Apr 3, 2014 Text Analytics (Text Mining) LSI (uses SVD), Visualization Duen Horng (Polo) Chau Georgia Tech Some lectures are partly based on materials by Professors Guy Lebanon, Jeffrey

### Clustering and Data Mining in R

Clustering and Data Mining in R Workshop Supplement Thomas Girke December 10, 2011 Introduction Data Preprocessing Data Transformations Distance Methods Cluster Linkage Hierarchical Clustering Approaches

### Data Clustering. Dec 2nd, 2013 Kyrylo Bessonov

Data Clustering Dec 2nd, 2013 Kyrylo Bessonov Talk outline Introduction to clustering Types of clustering Supervised Unsupervised Similarity measures Main clustering algorithms k-means Hierarchical Main

### Dimensionality Reduction: Principal Components Analysis

Dimensionality Reduction: Principal Components Analysis In data mining one often encounters situations where there are a large number of variables in the database. In such situations it is very likely

### α = u v. In other words, Orthogonal Projection

Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

### Nonlinear Iterative Partial Least Squares Method

Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for

### Introduction to Principal Components and FactorAnalysis

Introduction to Principal Components and FactorAnalysis Multivariate Analysis often starts out with data involving a substantial number of correlated variables. Principal Component Analysis (PCA) is a

### Multi-dimensional index structures Part I: motivation

Multi-dimensional index structures Part I: motivation 144 Motivation: Data Warehouse A definition A data warehouse is a repository of integrated enterprise data. A data warehouse is used specifically for

### A Introduction to Matrix Algebra and Principal Components Analysis

A Introduction to Matrix Algebra and Principal Components Analysis Multivariate Methods in Education ERSH 8350 Lecture #2 August 24, 2011 ERSH 8350: Lecture 2 Today s Class An introduction to matrix algebra

### Medical Information Management & Mining. You Chen Jan,15, 2013 You.chen@vanderbilt.edu

Medical Information Management & Mining You Chen Jan,15, 2013 You.chen@vanderbilt.edu 1 Trees Building Materials Trees cannot be used to build a house directly. How can we transform trees to building materials?

### Data Preprocessing. Week 2

Data Preprocessing Week 2 Topics Data Types Data Repositories Data Preprocessing Present homework assignment #1 Team Homework Assignment #2 Read pp. 227 240, pp. 250 250, and pp. 259 263 the text book.

### Social Media Mining. Data Mining Essentials

Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customers

### SYMMETRIC EIGENFACES MILI I. SHAH

SYMMETRIC EIGENFACES MILI I. SHAH Abstract. Over the years, mathematicians and computer scientists have produced an extensive body of work in the area of facial analysis. Several facial analysis algorithms

### Information Retrieval and Web Search Engines

Information Retrieval and Web Search Engines Lecture 7: Document Clustering December 10 th, 2013 Wolf-Tilo Balke and Kinda El Maarry Institut für Informationssysteme Technische Universität Braunschweig

### Module II: Multimedia Data Mining

ALMA MATER STUDIORUM - UNIVERSITÀ DI BOLOGNA Module II: Multimedia Data Mining Laurea Magistrale in Ingegneria Informatica University of Bologna Multimedia Data Retrieval Home page: http://www-db.disi.unibo.it/courses/dm/

### Principal Component Analysis Application to images

Principal Component Analysis Application to images Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception http://cmp.felk.cvut.cz/

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Chapter 3 Linear Least Squares Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction

### Component Ordering in Independent Component Analysis Based on Data Power

Component Ordering in Independent Component Analysis Based on Data Power Anne Hendrikse Raymond Veldhuis University of Twente University of Twente Fac. EEMCS, Signals and Systems Group Fac. EEMCS, Signals

### Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.

Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 0 Organizational Issues Lecture 21.10.2014 03.02.2015

### An Adaptive Index Structure for High-Dimensional Similarity Search

An Adaptive Index Structure for High-Dimensional Similarity Search Abstract A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with

### Soft Clustering with Projections: PCA, ICA, and Laplacian

1 Soft Clustering with Projections: PCA, ICA, and Laplacian David Gleich and Leonid Zhukov Abstract In this paper we present a comparison of three projection methods that use the eigenvectors of a matrix

### Face Recognition using Principle Component Analysis

Face Recognition using Principle Component Analysis Kyungnam Kim Department of Computer Science University of Maryland, College Park MD 20742, USA Summary This is the summary of the basic idea about PCA

### TOOLS FOR 3D-OBJECT RETRIEVAL: KARHUNEN-LOEVE TRANSFORM AND SPHERICAL HARMONICS

TOOLS FOR 3D-OBJECT RETRIEVAL: KARHUNEN-LOEVE TRANSFORM AND SPHERICAL HARMONICS D.V. Vranić, D. Saupe, and J. Richter Department of Computer Science, University of Leipzig, Leipzig, Germany phone +49 (341)

### Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

### BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES

BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES 123 CHAPTER 7 BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES 7.1 Introduction Even though using SVM presents

### Face Recognition using SIFT Features

Face Recognition using SIFT Features Mohamed Aly CNS186 Term Project Winter 2006 Abstract Face recognition has many important practical applications, like surveillance and access control.

### Manifold Learning Examples PCA, LLE and ISOMAP

Manifold Learning Examples PCA, LLE and ISOMAP Dan Ventura October 14, 28 Abstract We try to give a helpful concrete example that demonstrates how to use PCA, LLE and Isomap, attempts to provide some intuition

### Knowledge Discovery and Data Mining. Structured vs. Non-Structured Data

Knowledge Discovery and Data Mining Unit # 2 1 Structured vs. Non-Structured Data Most business databases contain structured data consisting of well-defined fields with numeric or alphanumeric values.

### Redundant Bit Vectors for the Audio Fingerprinting Server. John Platt Jonathan Goldstein Chris Burges

Redundant Bit Vectors for the Audio Fingerprinting Server John Platt Jonathan Goldstein Chris Burges Structure of Talk. Problem Statement 2. Problems with Existing Techniques 3. Bit Vectors 4. Partitioning

### Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data

CMPE 59H Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data Term Project Report Fatma Güney, Kübra Kalkan 1/15/2013 Keywords: Non-linear

### Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

### Environmental Remote Sensing GEOG 2021

Environmental Remote Sensing GEOG 2021 Lecture 4 Image classification 2 Purpose categorising data data abstraction / simplification data interpretation mapping for land cover mapping use land cover class

### Data, Measurements, Features

Data, Measurements, Features Middle East Technical University Dep. of Computer Engineering 2009 compiled by V. Atalay What do you think of when someone says Data? We might abstract the idea that data are

### IMPROVING DATA INTEGRATION FOR DATA WAREHOUSE: A DATA MINING APPROACH

IMPROVING DATA INTEGRATION FOR DATA WAREHOUSE: A DATA MINING APPROACH Kalinka Mihaylova Kaloyanova St. Kliment Ohridski University of Sofia, Faculty of Mathematics and Informatics Sofia 1164, Bulgaria

### RANDOM PROJECTIONS FOR SEARCH AND MACHINE LEARNING

= + RANDOM PROJECTIONS FOR SEARCH AND MACHINE LEARNING Stefan Savev Berlin Buzzwords June 2015 KEYWORD-BASED SEARCH Document Data 300 unique words per document 300 000 words in vocabulary Data sparsity:

### Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches

Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches PhD Thesis by Payam Birjandi Director: Prof. Mihai Datcu Problematic

### Similarity Search on Time Series Data. Presented by Zhe Wang

Similarity Search on Time Series Data Presented by Zhe Wang Motivations Fast searching for time-series of real numbers. ( data mining ) Scientific database: weather, geological, astrophysics, etc. find

### Text Mining in JMP with R Andrew T. Karl, Senior Management Consultant, Adsurgo LLC Heath Rushing, Principal Consultant and Co-Founder, Adsurgo LLC

Text Mining in JMP with R Andrew T. Karl, Senior Management Consultant, Adsurgo LLC Heath Rushing, Principal Consultant and Co-Founder, Adsurgo LLC 1. Introduction A popular rule of thumb suggests that

### APPM4720/5720: Fast algorithms for big data. Gunnar Martinsson The University of Colorado at Boulder

APPM4720/5720: Fast algorithms for big data Gunnar Martinsson The University of Colorado at Boulder Course objectives: The purpose of this course is to teach efficient algorithms for processing very large

### Data Mining Cluster Analysis: Advanced Concepts and Algorithms. ref. Chapter 9. Introduction to Data Mining

Data Mining Cluster Analysis: Advanced Concepts and Algorithms ref. Chapter 9 Introduction to Data Mining by Tan, Steinbach, Kumar 1 Outline Prototype-based Fuzzy c-means Mixture Model Clustering Density-based

### Factor analysis. Angela Montanari

Factor analysis Angela Montanari 1 Introduction Factor analysis is a statistical model that allows to explain the correlations between a large number of observed correlated variables through a small number

### Common factor analysis

Common factor analysis This is what people generally mean when they say "factor analysis" This family of techniques uses an estimate of common variance among the original variables to generate the factor

### Lecture Data Warehouse Systems

Lecture Data Warehouse Systems Eva Zangerle SS 2013 PART A: Architecture Chapter 1: Motivation and Definitions Motivation Goal: to build an operational general view on a company to support decisions in

### SPATIAL DATA CLASSIFICATION AND DATA MINING

, pp.-40-44. Available online at http://www. bioinfo. in/contents. php?id=42 SPATIAL DATA CLASSIFICATION AND DATA MINING RATHI J.B. * AND PATIL A.D. Department of Computer Science & Engineering, Jawaharlal

### Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,

### Clustering & Visualization

Chapter 5 Clustering & Visualization Clustering in high-dimensional databases is an important problem and there are a number of different clustering paradigms which are applicable to high-dimensional data.

### 521493S Computer Graphics. Exercise 2 & course schedule change

521493S Computer Graphics Exercise 2 & course schedule change Course Schedule Change Lecture from Wednesday 31th of March is moved to Tuesday 30th of March at 16-18 in TS128 Question 2.1 Given two nonparallel,

### DATA MINING CLUSTER ANALYSIS: BASIC CONCEPTS

DATA MINING CLUSTER ANALYSIS: BASIC CONCEPTS 1 AND ALGORITHMS Chiara Renso KDD-LAB ISTI- CNR, Pisa, Italy WHAT IS CLUSTER ANALYSIS? Finding groups of objects such that the objects in a group will be similar

### (Week 10) A04. Information System for CRM. Electronic Commerce Marketing

(Week 10) A04. Information System for CRM Electronic Commerce Marketing Course Code: 166186-01 Course Name: Electronic Commerce Marketing Period: Autumn 2015 Lecturer: Prof. Dr. Sync Sangwon Lee Department:

### Clustering. Chapter 7. 7.1 Introduction to Clustering Techniques. 7.1.1 Points, Spaces, and Distances

240 Chapter 7 Clustering Clustering is the process of examining a collection of points, and grouping the points into clusters according to some distance measure. The goal is that points in the same cluster

### The Benefits of Data Modeling in Business Intelligence

WHITE PAPER: THE BENEFITS OF DATA MODELING IN BUSINESS INTELLIGENCE The Benefits of Data Modeling in Business Intelligence DECEMBER 2008 Table of Contents Executive Summary 1 SECTION 1 2 Introduction 2

### FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

### CSE 494 CSE/CBS 598 (Fall 2007): Numerical Linear Algebra for Data Exploration Clustering Instructor: Jieping Ye

CSE 494 CSE/CBS 598 Fall 2007: Numerical Linear Algebra for Data Exploration Clustering Instructor: Jieping Ye 1 Introduction One important method for data compression and classification is to organize

### Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

### Database Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No.

Database Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No. # 31 Introduction to Data Warehousing and OLAP Part 2 Hello and

### Chapter 6 FOUNDATIONS OF BUSINESS INTELLIGENCE: DATABASES AND INFORMATION MANAGEMENT Learning Objectives

Chapter 6 FOUNDATIONS OF BUSINESS INTELLIGENCE: DATABASES AND INFORMATION MANAGEMENT Learning Objectives Describe how the problems of managing data resources in a traditional file environment are solved

### KINGS COLLEGE OF ENGINEERING

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING ACADEMIC YEAR 2011-2012 / ODD SEMESTER SUBJECT CODE\NAME: CS1011-DATA WAREHOUSE AND DATA MINING YEAR / SEM: IV / VII UNIT I BASICS

### Chapter 20: Data Analysis

Chapter 20: Data Analysis Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Chapter 20: Data Analysis Decision Support Systems Data Warehousing Data Mining Classification

### D-optimal plans in observational studies

D-optimal plans in observational studies Constanze Pumplün Stefan Rüping Katharina Morik Claus Weihs October 11, 2005 Abstract This paper investigates the use of Design of Experiments in observational

### PCA to Eigenfaces. CS 510 Lecture #16 March 23 th A 9 dimensional PCA example

PCA to Eigenfaces CS 510 Lecture #16 March 23 th 2015 A 9 dimensional PCA example is dark around the edges and bright in the middle. is light with dark vertical bars. is light with dark horizontal bars.

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### Linear Algebra Review. Vectors

Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

### Notes for STA 437/1005 Methods for Multivariate Data

Notes for STA 437/1005 Methods for Multivariate Data Radford M. Neal, 26 November 2010 Random Vectors Notation: Let X be a random vector with p elements, so that X = [X 1,..., X p ], where denotes transpose.

### Principles of Data Mining by Hand&Mannila&Smyth

Principles of Data Mining by Hand&Mannila&Smyth Slides for Textbook Ari Visa,, Institute of Signal Processing Tampere University of Technology October 4, 2010 Data Mining: Concepts and Techniques 1 Differences

### Topics in basic DBMS course

Topics in basic DBMS course Database design Transaction processing Relational query languages (SQL), calculus, and algebra DBMS APIs Database tuning (physical database design) Basic query processing (ch

### New Approach of Computing Data Cubes in Data Warehousing

International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 14 (2014), pp. 1411-1417 International Research Publications House http://www. irphouse.com New Approach of

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

### Ins+tuto Superior Técnico Technical University of Lisbon. Big Data. Bruno Lopes Catarina Moreira João Pinho

Ins+tuto Superior Técnico Technical University of Lisbon Big Data Bruno Lopes Catarina Moreira João Pinho Mo#va#on 2 220 PetaBytes Of data that people create every day! 2 Mo#va#on 90 % of Data UNSTRUCTURED

### Introduction to Matrix Algebra

Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary

### Advanced Techniques for Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz

Advanced Techniques for Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz Vectors Arrays of numbers Vectors represent a point in a n dimensional

### Cheng Soon Ong & Christfried Webers. Canberra February June 2016

c Cheng Soon Ong & Christfried Webers Research Group and College of Engineering and Computer Science Canberra February June (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 31 c Part I

### Foundations of Business Intelligence: Databases and Information Management

Foundations of Business Intelligence: Databases and Information Management Content Problems of managing data resources in a traditional file environment Capabilities and value of a database management

### Mario Guarracino. Data warehousing

Data warehousing Introduction Since the mid-nineties, it became clear that the databases for analysis and business intelligence need to be separate from operational. In this lecture we will review the

### Unsupervised and supervised dimension reduction: Algorithms and connections

Unsupervised and supervised dimension reduction: Algorithms and connections Jieping Ye Department of Computer Science and Engineering Evolutionary Functional Genomics Center The Biodesign Institute Arizona

### Chapter 5 Business Intelligence: Data Warehousing, Data Acquisition, Data Mining, Business Analytics, and Visualization

Turban, Aronson, and Liang Decision Support Systems and Intelligent Systems, Seventh Edition Chapter 5 Business Intelligence: Data Warehousing, Data Acquisition, Data Mining, Business Analytics, and Visualization

### The Benefits of Data Modeling in Business Intelligence. www.erwin.com

The Benefits of Data Modeling in Business Intelligence Table of Contents Executive Summary...... 3 Introduction.... 3 Why Data Modeling for BI Is Unique...... 4 Understanding the Meaning of Information.....

### Factor Rotations in Factor Analyses.

Factor Rotations in Factor Analyses. Hervé Abdi 1 The University of Texas at Dallas Introduction The different methods of factor analysis first extract a set a factors from a data set. These factors are

### Linear algebra and the geometry of quadratic equations. Similarity transformations and orthogonal matrices

MATH 30 Differential Equations Spring 006 Linear algebra and the geometry of quadratic equations Similarity transformations and orthogonal matrices First, some things to recall from linear algebra Two

### 1 2 3 1 1 2 x = + x 2 + x 4 1 0 1

(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which

### SPECIAL PERTURBATIONS UNCORRELATED TRACK PROCESSING

AAS 07-228 SPECIAL PERTURBATIONS UNCORRELATED TRACK PROCESSING INTRODUCTION James G. Miller * Two historical uncorrelated track (UCT) processing approaches have been employed using general perturbations

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Tangent and normal lines to conics

4.B. Tangent and normal lines to conics Apollonius work on conics includes a study of tangent and normal lines to these curves. The purpose of this document is to relate his approaches to the modern viewpoints

### The Benefits of Data Modeling in Business Intelligence

WHITE PAPER: THE BENEFITS OF DATA MODELING IN BUSINESS INTELLIGENCE The Benefits of Data Modeling in Business Intelligence DECEMBER 2008 Table of Contents Executive Summary 1 SECTION 1 2 Introduction 2

### We call this set an n-dimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.

Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to

### Relational Database Systems 2 1. System Architecture

Relational Database Systems 2 1. System Architecture Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 1 Organizational Issues

### Distance Metric Learning in Data Mining (Part I) Fei Wang and Jimeng Sun IBM TJ Watson Research Center

Distance Metric Learning in Data Mining (Part I) Fei Wang and Jimeng Sun IBM TJ Watson Research Center 1 Outline Part I - Applications Motivation and Introduction Patient similarity application Part II

### Fluency With Information Technology CSE100/IMT100

Fluency With Information Technology CSE100/IMT100 ),7 Larry Snyder & Mel Oyler, Instructors Ariel Kemp, Isaac Kunen, Gerome Miklau & Sean Squires, Teaching Assistants University of Washington, Autumn 1999

### Efficient Iceberg Query Evaluation for Structured Data using Bitmap Indices

Proc. of Int. Conf. on Advances in Computer Science, AETACS Efficient Iceberg Query Evaluation for Structured Data using Bitmap Indices Ms.Archana G.Narawade a, Mrs.Vaishali Kolhe b a PG student, D.Y.Patil