Session 7: Early Case Assessment LBSC 708X/INFM 718X Seminar on E-Discovery Jason R. Baron Adjunct Faculty University of Maryland March 8, 2012.

Slides:

Advertisements

Similar presentations

Microarray Data Analysis (Lecture for CS397-CXZ Algorithms in Bioinformatics) March 19, 2004 ChengXiang Zhai Department of Computer Science University.

Advertisements

Webinar Sponsorship Partner. Jason Velasco Jason Velasco is an electronic discovery industry veteran with more than 15 years of experience in electronic.

Cache La Poudre Feeds, LLC v. Land O’Lakes, Inc.  Motion Hearing before a Magistrate Judge in Federal Court  District of Colorado  Decided in 2007.

Project Planning and Management in E-Discovery DAVID A. ELLIS – MAYER BROWN BROWNING E. MAREAN – DLA PIPER.

1 Best Practices in Legal Holds Effectively Managing the e-Discovery Process and Associated Costs.

April 11-13, Session Title Presenters {Name} April 11-13, PRESENTED BY THE Managing E-Discovery in Small to.

What is missing? Reasons that ideal effectiveness hard to achieve: 1. Users’ inability to describe queries precisely. 2. Document representation loses.

IVITA Workshop Summary Session 1: interactive text analytics (Session chair: Professor Huamin Qu) a) HARVEST: An Intelligent Visual Analytic Tool for the.

90% U.S. corporations currently engaged in litigation 147 Average number of active lawsuits for $1B+ companies $1M Average per case cost of eDiscovery.

Copyright © hutchinson associates 2005 The Knowledge is in the Network Patti Anklam June Holley Valdis Krebs Using Network Analysis to Understand and Improve.

Latent Semantic Indexing via a Semi-discrete Matrix Decomposition.

SLIDE 1IS 240 – Spring 2010 Logistic Regression The logistic function: The logistic function is useful because it can take as an input any.

TFIDF-space  An obvious way to combine TF-IDF: the coordinate of document in axis is given by  General form of consists of three parts: Local weight.

IR Models: Latent Semantic Analysis. IR Model Taxonomy Non-Overlapping Lists Proximal Nodes Structured Models U s e r T a s k Set Theoretic Fuzzy Extended.

Vector Space Model CS 652 Information Extraction and Integration.

E.G.M. PetrakisDimensionality Reduction1  Given N vectors in n dims, find the k most important axes to project them  k is user defined (k < n)  Applications:

IR Models: Review Vector Model and Probabilistic.

Other IR Models Non-Overlapping Lists Proximal Nodes Structured Models Retrieval: Adhoc Filtering Browsing U s e r T a s k Classic Models boolean vector.

The LINDI Project Linking Information for New Discoveries UIs for building and reusing hypothesis seeking strategies. Statistical language analysis techniques.

Finding Your Way around the Courthouse. Court Records Online – PACER - Public Access to Court Electronic Records – Case Management: CM/ECF – State Courts.

Get Off of My I-Cloud: Role of Technology in Construction Practice Sanjay Kurian, Esq. Trent Walton, CTO U.S. Legal Support.

Session 12: Receiving a Production LBSC 708X/INFM 718X Seminar on E-Discovery Jason R. Baron Adjunct Faculty University of Maryland April 12, 2012.

In class exercise You have been appointed Records Officer for a large cabinet Department in the Obama Administration. A lawsuit against the Department.

1 Vector Space Model Rong Jin. 2 Basic Issues in A Retrieval Model How to represent text objects What similarity function should be used? How to refine.

Session 8: Cooperation in E-Discovery Search LBSC 708X/INFM 718X Seminar on E-Discovery Jason R. Baron Adjunct Faculty University of Maryland March 15,

A Framework for Examning Topical Locality in Object- Oriented Software 2012 IEEE International Conference on Computer Software and Applications p

Attorney-Client Privilege and Privacy Considerations Between US Corporations & Foreign Affiliates General Counsel Conference, Washington, D.C. October.

Discovery III Expert Witness Disclosure And Discovery Motions & Sanctions.

Marco Nasca Senior Director, Client Solutions TRANSFORMING DISCOVERY THROUGH DATA MANAGEMENT.

Analysis 360: Blurring the line between EDA and PC Andrea Gibson, Product Director, Kroll Ontrack March 27, 2014.

Bayesian networks Classification, segmentation, time series prediction and more. Website: Twitter:

Nathan Walker building an ediscovery framework. armasv.org Objective Present an IT-centric perspective to consider when building an eDiscovery framework.

Indices Tomasz Bartoszewski. Inverted Index Search Construction Compression.

P RINCIPLES 1-7 FOR E LECTRONIC D OCUMENT P RODUCTION Maryanne Post.

The Challenge of Rule 26(f) Magistrate Judge Craig B. Shaffer July 15, 2011.

Cache La Poudre Feeds, LLC v. Land O’Lakes, Inc. 224 F.R.D. 614 (D. Colo. 2007) By: Sara Alsaleh Case starts on page 136 of the book!

June 5, 2006University of Trento1 Latent Semantic Indexing for the Routing Problem Doctorate course “Web Information Retrieval” PhD Student Irina Veredina.

EDiscovery Preservation, Spoliation, Litigation Holds, Adverse Inferences. September 15, 2008.

Balancing Transparent Access to KM with Client Security, Confidentiality, Risk and Compliance #INFO14 August 25, 2011.

RIM in the Age of E-Discovery RIM in the Age of E-Discovery FIRM Summer Program June 23, 2009 Christina Ayiotis, Esq., CRM Group Counsel– E-Discovery &

Join the conference call by dialing the conference number in your Invitation or Reminder s. Please put your phone on mute. Please stand by! The webinar.

Collocations and Information Management Applications Gregor Erbach Saarland University Saarbrücken.

Conducting Modern Investigations Analytics & Predictive Coding for Investigations & Regulatory Matters.

Graphical Representations of Knowledge and Its Distribution Cliff Behrens Information Analysis Applied Research Telcordia Technologies, Inc

Gene Clustering by Latent Semantic Indexing of MEDLINE Abstracts Ramin Homayouni, Kevin Heinrich, Lai Wei, and Michael W. Berry University of Tennessee.

Records Management for Paper and ESI Document Retention Policies addressing creation, management and disposition Minimize the risk and exposure Information.

A pTree organization for text mining... Position are April apple and an always. all again a... Term (Vocab)

Symantec Archiving & eDiscovery 1 Randy Law, Symantec Andy Becker, Trace3 Introducing the Clearwell eDiscovery Platform.

ELI ANNUAL MEETING TUESDAY, FEBRUARY 10 TH, 2015 LINDSAY PINEDA, UNICON MIKE SHARKEY, BLUE CANARY Retention Analytics for Student Success: An Interactive.

Defensible Quality Control for E-Discovery Geoff Black and Albert Barsocchini.

10.0 Latent Semantic Analysis for Linguistic Processing References : 1. “Exploiting Latent Semantic Information in Statistical Language Modeling”, Proceedings.

© 2014, TERIS, Applying Analytics: Effective & Efficient Data Management in Litigation and Beyond.

Natural Language Processing Topics in Information Retrieval August, 2002.

Complex legal requirements in electronic discovery search and retrieval: A NARA case study NSF Collaborative Expedition Workshop # 45 Advancing Information.

The Development of a search engine & Comparison according to algorithms Sung-soo Kim The final report.

1 CS 430 / INFO 430 Information Retrieval Lecture 12 Query Refinement and Relevance Feedback.

Managing Project Risk – A simplified approach Presented by : Damian Leonard.

Women in Products Liability 2016 Annual Regional CLE November 3, 2016

Best pTree organization? level-1 gives te, tf (term level)

Background: The Big Data era

Data Minimization Framework

6/22/2018 2:09 PM BRK3102 How Microsoft Legal drives down eDiscovery costs with machine learning in Office 365 Rachi Messing Senior Program Manager, O365.

The Office Is Out: Preservation And Collection In The Merry Old Land Of Office 365 June 26, v1.

Author(s): Rahul Sami, 2009 License: Unless otherwise noted, this material is made available under the terms of the Creative Commons Attribution Noncommercial.

Search Techniques and Advanced tools for Researchers

Design open relay based DNS blacklist system

Introduction to Information Retrieval

I. Hypothetical A. Case Background: Relator, a former employee of Defendant, brought a case in federal court against a large defense contractor (Relator’s.

CS 430: Information Discovery

Presentation transcript:

Session 7: Early Case Assessment LBSC 708X/INFM 718X Seminar on E-Discovery Jason R. Baron Adjunct Faculty University of Maryland March 8, 2012

How much does counsel know? About the nature and scope of the relevant evidence existing in custody and control of the opposing party? Same question re the relevant evidence existing in one’s own client’s custody and control – how much is known? How much is know-able? Have the answers changed in past decade of practice?

Early Case Assessment Early case assessment refers to estimating risk (cost of time and money) to prosecute or defend a legal case. Human expertise Technology

Why ECA? -- Most cases settle prior to trial -- Exposure (likelihood of negative outcome in litigation) --Discovery and document review in particular are costly, burdensome --Protecting against sanctions (spoliation should preservation obligations not be carried out with due diligence) --Speed --Insight into case (readings this week) --Establishing a budget

ECA lifecycle Risk/benefit analysis Putting into place legal hold Collecting/culling info for attorney review Processing relevant info using filtering, search terms, predictive coding, etc. Producing info (in discovery) Re-using info, KM, BI

ECA Downsides Up front costs False negatives (example case)

Software approaches to ECA Keywords Relevance ranking Clustering Predictive Coding Sentiment detection Social network analysis Visual analytics

Bayesian Statistical Models Based on mathematical models of Statistical Probability to recognize documents of similar content. Learns passively from the document content Position, frequency and proximity of terms (language independent) combine to create a mathematical “thumbprint” of concepts contained in documents. Useful to “cluster” documents by content Can “learn” to build clusters from exemplar sets Requires re-indexing and assessment can change

Latent Semantic Indexing (LSI) x y z 1.SVD (Singular Value Decomposition) assigns each record to a place creating “clusters” 2.“Query” documents are SVD analyzed and placed in the matrix 3.“Hits” and rankings are determined by the distance from clusters Vector length = relevance ranking

Improved review and case assessment: cluster docs thru use of software with minimal human intervention at front end to code “seeded” data set Slide adapted from Gartner Conference June 23, 2010 Washington, D.C. Emerging New Strategies: “Predictive Analytics”

Visual Analysis Examples (Presentation by Dr. Victoria Lemieux, Univ. British Columbia, at Society of American Archivist Annual Mtg. 2010, Washington, D.C.) With acknowledgments to Jeffrey Heer, Exploring Enron, Adam Perer, Contrasting Portraits, and Fernanda Viegas, Conversations,

15 Social Networking/Links Analysis Example From Marc Smith Posted on Flickr Under Creative Commons License