Published on

  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide


  1. 1. ETL & Basic OLAP OperationsCSE – 590 Data Mining Prof. Anita Wasilewska SUNY Stony Brook<br />Presented By :<br /> -> Preeti Kudva (106887833)<br /> -> Kinjal Khandhar(106878039)<br />
  2. 2. REFERENCES :<br /><ul><li>Data Mining: Concepts & Techniques by Jiawei Han and MichelineKamber.
  3. 3. Presentation Slides of Prof. Anita Wasilewska.
  4. 4.,_transform,_load
  5. 5. Ralph Kimball, Joe Caserta, The Data Warehouse ETL Toolkit: Practical Techniques for Extracting, Cleaning, Conforming and Delivering Data
  6. 6. Conceptual modeling for ETL processes by Panos Vassiliadis,Alkis Simitsis,Spiros Skiadopoulos.
  7. 7.
  8. 8.
  9. 9.
  10. 10. http://www.computerworld. com/databasetopics/data/story/0,10801,80222,00. html </li></li></ul><li> Overview<br />What is ETL?<br />ETL In the Architecture.<br />General ETL issues<br /> - Extract<br /> - Transformations/cleansing<br /> - Load<br />ETL Example<br />
  11. 11. What is ETL? <br /> Extract<br /> - Extract relevant data.<br />Transform<br /> - Transform data to DW format.<br /> - Build DW keys, etc.<br /> - Cleansing of data.<br />Load<br /> - Load data into DW.<br /> - Build aggregates, etc.<br /><br />
  12. 12. Other<br />sources<br />Extract<br />Transform<br />Load<br />Refresh<br />Operational <br />DBs<br />Metadata<br />Analysis<br />Query<br />Reports<br />Data mining<br />Serve<br />Data<br />Warehouse<br />Data Marts<br />Data Sources<br />Front-End Tools<br />Data Storage<br />Data Warehouse Architecture<br /><br />
  13. 13. Extract<br />
  14. 14. Extract<br /><ul><li>Goal: fast extract of relevant data
  15. 15. Extract data from different data source formats like flat files, Relational Database Systems,etc.
  16. 16. Convert data into a specific format for transformation processing.
  17. 17. Parse extracted data.
  18. 18. Result in a check if data meets expected pattern/structure.</li></ul>,_transform,_load<br />
  19. 19. Types of Data Sources<br /><ul><li>Non-cooperative sources</li></ul> - Snapshot sources – provides only full copy of source, e.g., files<br /> - Specific sources – each is different, e.g., legacy systems<br /> - Logged sources – writes change log, e.g., DB log<br /> - Queryable sources – provides query interface, e.g., RDBMS<br /><ul><li>Cooperative sources</li></ul> - Replicated sources – publish/subscribe mechanism<br /> - Call back sources – calls external code (ETL) when changes occur<br /> - Internal action sources – only internal actions when changes triggers.<br /><ul><li>Extract strategy depends on the source types.</li></ul><br />
  20. 20. Extract from Operational System<br /><ul><li>Design Time</li></ul> – Create/Import Data Sources definition<br /> – Define Stage or Work Areas()<br /> – Validate Connectivity<br /> – Preview/Analyze Sources<br /> – Define Extraction Scheduling<br /> Determine Extract Windows for source system<br /> Batch Extract (Overnight, weekly, monthly)<br /> Continuous extracts (Trigger on Source Table)<br /><ul><li>Run Time</li></ul> – Connect to the predefined Data Sources as scheduled<br /> – Get raw data save locally in workspace DB<br />
  21. 21. Transform<br />
  22. 22. Transformation – a series of rules/functions.<br />Common Transformations are:<br /><ul><li>Convert data into a consistent, standardized form.
  23. 23. Cleanse(Automated)
  24. 24. Synonym Substitutions.
  25. 25. Spelling Corrections.
  26. 26. Encoding free-form values(map Male to 1 & Mr to M)
  27. 27. Merge/Purge(join data from multiple sources).
  28. 28. Aggregate(eg.rollup)
  29. 29. Calculate(sale_amt = qty * price)
  30. 30. Data type conversion
  31. 31. Data content audit
  32. 32. Null value handling(null = not to load)
  33. 33. Customized transformation(based on user).</li></ul><br />
  34. 34. Common Transformations..contd<br /><ul><li>Data type conversions</li></ul>-EBCDIC ASCII/UniCode.<br /> -String manipulations.<br /> -Date/time format conversions.<br /> -- E.g., unix time 1201928400 = what time?<br /><ul><li>Normalization/Denormalization</li></ul>- To the desired DW format.<br /> - Depending on source format.<br /><ul><li>Building keys</li></ul>- Table matches production keys to surrogate DW keys.<br /> - Correct handling of history - especially for total reload.<br /><br />
  35. 35. Cleansing <br /><ul><li>Why cleansing? Garbage In Garbage Out.
  36. 36. BI does not work on “raw” data</li></ul> - Pre-processing necessary for BI analysis.<br /><ul><li>Handle inconsistent data formats</li></ul> - Spellings, codings, …<br /><ul><li> Remove unnecessary attributes</li></ul> - Production keys, comments,…<br /><ul><li>Replace codes with text [for easy understanding]</li></ul> - City name instead of ZIP code, e.g., Aalborg Centrum vs. DK-9000<br /><ul><li>Combine data from multiple sources with common key</li></ul> - E.g., customer data from customer address, customer name, …<br />Aalborg University 2009 - DWML course<br />
  37. 37. Cleansing <br /><ul><li>Don’t use “special” values (e.g., 0, -1) in your data.</li></ul> -They are hard to understand in query/analysis operations.<br /><ul><li> Mark facts with Data Status dimension</li></ul> - Normal, abnormal, outside bounds, impossible,…<br /> - Facts can be taken in/out of analyses.<br /><ul><li>Uniform treatment of NULL</li></ul> - Use NULLs only for measure values (estimates instead?)<br /> - Use special dimension key (i.e., surrogate key value) for<br /> NULL dimension values E.g., for the time dimension, instead of NULL, use special key values to represent “Date not known”, “Soon to happen”.<br /><ul><li>Avoid problems in joins, since NULL is not equal to NULL</li></ul>Aalborg University 2009 - DWML course<br />
  38. 38. Data Quality – most imp<br /><ul><li>Data almost never has decent quality
  39. 39. Data in DW must be:</li></ul>1] Precise<br /> - DW data must match known numbers - or explanation needed.<br />2] Complete<br /> - DW has all relevant data and the users know.<br />3] Consistent<br /> - No contradictory data: aggregates fit with detail data.<br />4] Unique<br /> - The same things is called the same and has the same key(customers).<br />5] Timely<br /> - Data is updated ”frequently enough” and the users know when.<br />
  40. 40. Improving Data Quality<br /><ul><li>Appoint “data quality administrator”</li></ul> -Responsibility for data quality.<br /> -Includes manual inspections and corrections!<br /><ul><li>Source-controlled improvements.
  41. 41. Construct programs that check data quality</li></ul> - Are totals as expected?<br /> -Do results agree with alternative source?<br /> -Number of NULL values?<br />
  42. 42. Transformation in Operational System<br /><ul><li>Design Time</li></ul> – Specify Criteria/Filter for aggregation.<br /> – Define operators (Mostly Set/SQL based).<br /> – Map columns using operators/Lookups.<br /> – Define other transformation rules.<br /> – Define mappings and/or add new fields.<br /><ul><li>Run Time</li></ul> – Transform (Cleanse, consolidate, Apply Business Rule, De-Normalize/Normalize) Extracted Data by applying the operators mapped in design time.<br /> – Aggregate (create & populate raw table).<br /> – Create & populate Staging table.<br />
  43. 43. Load<br />
  44. 44. Load<br /><ul><li>Goal:fast loading into end target(DW).</li></ul>-Loading chunks is much faster than total load.<br /><ul><li>SQL-based update is slow.</li></ul>- Large overhead (optimization, locking, etc.) for every SQL call.<br /> -DB load tools are much faster.<br /><ul><li> Index on tables slows load a lot.</li></ul>- Drop index and rebuild after load<br /> - Can be done per index partition<br /><ul><li>Parallellization</li></ul>- Dimensions can be loaded concurrently<br /> - Fact tables can be loaded concurrently<br /> - Partitions can be loaded concurrently<br />,_transform,_load<br />
  45. 45. Load <br /><ul><li>Relationships in the data</li></ul> - Referential integrity and data consistency must be ensured before loading (Why?)<br /> --Because they won’t be checked in the DW again<br /> - Can be done by loader<br /><ul><li>Aggregates</li></ul> - Can be built and loaded at the same time as the detail data.<br /><ul><li>Load tuning</li></ul> - Load without log.<br /> -Sort load file first.<br /> -Make only simple transformations in loader.<br /> -Use loader facilities for building aggregates.<br />,_transform,_load<br />
  46. 46. Load in Operational Systems<br /><ul><li>Design Time</li></ul> – Design Warehouse.<br /> – Map Staging Data to fact or dimension table attributes.<br /><ul><li>Run Time</li></ul>– Publish Staging data to Data mart (update dimension tables along with the fact tables.<br />
  47. 47. ETL Tools<br /><ul><li>From big vendors :</li></ul> -Oracle Warehouse Builder<br /> -IBM DB2 Warehouse Manager<br /> -Microsoft Integration Services<br /><ul><li>Offers much functionality at a reasonable price</li></ul> - Data modeling<br /> -ETL code generation<br /> -Scheduling DW jobs<br /><ul><li> The “best” tool does not exist</li></ul> - Choose based on your own needs<br /><br />
  48. 48. ETL Example<br />
  49. 49. Example of how ETL Works!!!!<br />Consider the HR Department database:-<br />
  50. 50. Extract Step for the Use-Case:<br /><ul><li>Take the data from the dbase III file and convert it into a more usable format - XML .
  51. 51. Extracting data can be done using XML convertors .Just select our table and choose dbase III convertor will transfer the data into XML.
  52. 52. The result of this extraction will be an XML file similar to this:
  53. 53. <?xml version="1.0" encoding="UTF-8"?><table date="20060731" rows="5">    <row row="1">        <NAME>Guiles, Makenzie</NAME>        <STREET>145 Meadowview Road</STREET>        <CITY>South Hadley</CITY>        <STATE>MA</STATE>        <ZIP>01075</ZIP>        <DEAR_WHO>Macy</DEAR_WHO>        <TEL_HOME>(413)555-6225</TEL_HOME>        <BIRTH_DATE>19770201</BIRTH_DATE>        <HIRE_DATE>20060703</HIRE_DATE>        <INSIDE>yes</INSIDE>    </row>    ...</table></li></li></ul><li>Extract – Part 2<br />Find out the Target Schema,which can be done by using DB to XML Data Source Module.Currently using Northwind that comes with Standard SQL Server.(save as etl-target.rdbxml)<br />
  54. 54. Transforming Data into the Target Form <br /><ul><li>Use series of XSLT transforms to modify this.</li></ul> In a production ETL operation, likely each step would be more complicated, and/or would use different technologies or methods.<br />1] Convert the dates from CCYYMMDD into CCYY-MM-DD (the "ISO 8601" format) [etl-code-1.xsl]<br /> 2]Split the first and last names [etl-code-2.xsl]<br /> 3]Assign the manager based on inside or external sales [etl-code-3.xsl]<br /> 4]Map the data to the new schema [etl-code-4.xsl]<br /> This mapping can be done by using XSLT mapper.<br />
  55. 55. Output of above steps + etl-target.rdbxml gives:<br />
  56. 56. Loading Our ETL Results into the Data Repository <br />loading is a just matter of writing the output of the last XSLT transform step into the etl-target.rdbxml map we built earlier. <br />
  57. 57. Olap Operations<br />
  58. 58. References:<br />Data Mining: Concepts & Techniques by Jiawei Han and MichelineKamber.<br /><br /><br /><br /><br /><br />
  59. 59. Overview<br />OLAP<br />OLAP Cube & Multidimensional data<br />OLAP Operations:<br /> - Roll up (Drill up)<br /> - Drill down (Rolldown)<br /> - Slice & Dice<br /> - Pivot<br /> - Other operations<br /><ul><li>Examples</li></li></ul><li>OLAP<br />Online analytical processing, or OLAP, is an approach to quickly answer multi-dimensional analytical queries.[]<br />The typical applications of OLAP are in business reporting for sales, marketing, management reporting, business process management (BPM), budgeting and forecasting, financial reporting and similar areas.<br />The term OLAP was created as a slight modification of the traditional database term OLTP(Online Transaction Processing).[]<br />
  60. 60. OLAP Cube<br />Data warehouse & OLAP tools are based on a multidimensional data model which views data in the form of a data cube.<br />An OLAP (Online Analytical Processing) cube is a data structure that allows fast analysis of data.<br />The OLAP cube consists of numeric facts called measures which are categorized by dimensions.<br /> -Dimensions: perspective or entities with respect to which an organization wants to keep records.<br /> -Facts: quantities by which we want to analyze relations between dimensions.<br />The cube metadata may be created from a star schema or snowflake schema of tables in a relational database. Measures are derived from the records in the fact table and dimensions are derived from the dimension tables.<br />Reference:<br />
  61. 61. Concept Hierarchy<br />A concept hierarchy defines a sequence of mappings from a set of low level concepts to higher level, more general concepts.<br />Each of the elements of a dimension could be summarized using a hierarchy. The hierarchy is a series of parent-child relationships, typically where a parent member represents the consolidation of the members which are its children. Parent members can be further aggregated as the children of another parent.<br />Reference:<br />
  62. 62. Example – Star Schema<br />item<br />time<br />item_key<br />item_name<br />brand<br />type<br />supplier_type<br />time_key<br />day<br />day_of_the_week<br />month<br />quarter<br />year<br />location<br />branch<br />location_key<br />street<br />city<br />province_or_street<br />country<br />branch_key<br />branch_name<br />branch_type<br />Sales Fact Table<br /> time_key<br /> item_key<br /> branch_key<br /> location_key<br />units_sold<br />Measures<br />Reference:<br />
  63. 63. Example: <br />Example: <br />Dimensions: Item, Location, Time<br />Hierarchical summarization paths<br />Region<br /> Type Region Year<br /> Brand Country Quarter<br /> Item City Month<br />Street Week<br /> Day<br />Item<br />Month<br />Reference:<br />
  64. 64. Working Example(1)<br />Reference:<br />
  65. 65. Roll up(Drill up)<br />Performs aggregation on a data cube eitherby climbing up the concept hierarchy for a dimension or by dimension reduction.[]<br />Specific grouping on one dimension where we go from a lower level of aggregation to a higher. []<br /><ul><li> e.g. summing-up per whole fiscal year
  66. 66. e.g. summarization over aggregate hierarchy (total sales per region, state)</li></li></ul><li>Drill down (Roll down)<br />Reverse of roll-up .[]<br />Navigates from less detailed data to more detailed data.<br />Can be realized by either stepping down a concept hierarchy for a dimension or introducing additional dimensions.<br /> Finer-grained view on aggregated data, i.e. going from higher to lower aggregation.[]<br /><ul><li>e.g. disaggregate volume of products sales by region/city.</li></li></ul><li>Roll Up & Drill down on Working Example(1)<br />Roll up sales on time from month to quarter<br />Drill down sales on location from city to plant<br />Reference:<br />
  67. 67. Slice and Dice<br />Slice:<br /> - performs a selection on one dimension of the given cube, resulting in a sub cube.<br /><ul><li> e.g. slicing volume of products in product dimension for product_model=‘1996’. </li></ul>Dice:<br /> -performs a selection operation on two or more dimensions.<br /><ul><li> e.g. dicing the central cube based on the following selection criteria: (location=“Montreal” or “Vancouver”)and (time=“Q1”or”Q2”)and(item=“cell phone”or”pager”)</li></li></ul><li>Slice & Dice on Working Example(1)<br />Dicing volume of Products in product & time dimension<br /> Slicing volume of Products in product dimension<br />Reference:<br />
  68. 68. Pivot<br />Visualization operation which rotates the data axes in view in order to provide an alternate presentation of data.<br />Select a different dimension (orientation) for analysis[]<br />E.g. pivot operation where location & item in a 2D slice are rotated.<br />Other examples:<br /> - rotating the axes in a 3D cube.<br /> - transforming 3D cube into series of 2D planes.<br />
  69. 69. Working Example(2)<br />Dimension Tables:<br />Market(Market_ID, City, Region)<br />Product(Product_ID, Name, Category)<br />Time( Time_ID,Week,Month,Quarter)<br />Fact Table:<br />Sales(Market_ID,Product_ID,Time_ID,Amount)<br />Reference:<br />
  70. 70. Roll up & Drill down on Working Example(2)<br />SELECT S.Product_ID,M.City, SUM(S.Amount) INTO City_Sales<br />FROM Sales S, Market M<br />WHEREM.Market_ID = S.Market_ID<br />GROUP BY S.Product_ID, M.City<br />Roll up salesonMarket from city to region<br />SELECTT.Product_ID,M.Region, SUM(T.Amount)<br /> FROM City_Sales T, Market M<br /> WHERE T.City = M.City<br /> GROUP BY T.Product_ID, M.Region<br />Drill down sales on Market from region to city<br />Reference:<br />
  71. 71. Slice & Dice on Working Example(2) <br /> Dicing sales in the time dimension (e.g. total sales for each product in each quarter)<br />SELECT S.Product_ID, T.Quarter, SUM(S.Amount)<br />FROM Sales S, Time T<br />WHERET.Time_ID = S.Time_ID AND T.Week=‘Week12’ AND (S.Product_ID =‘1002’ OR S.Product_ID =‘1003’)<br />GROUP BY T.Quarter, S.Product_ID<br /> Slicing the data cube in the time dimension (e.g. choosing sales only in week 12)<br />SELECT S.*<br />FROM Sales S, Time T<br />WHERET.Time_ID = S.Time_ID AND T.Week = ‘Week12’<br />Reference:<br />
  72. 72. Other Operations<br />drill across:<br />executes queries involving (across) more than one fact table.<br />drill through:<br />makes use of relational SQL facilities to drill through the bottom level of the cube to its back-end relational tables.<br />Reference: []<br />
  73. 73. 10 Challenging Problems in Data Mining Research<br />Xindong Wu<br />Department of Computer Science<br />University of Vermont<br />33 Colchester Avenue, Burlington, Vermont 05405, USA<br /><br />Qiang Yang <br />Department of Computer Science<br />Hong Kong University of Science & Technology<br />Clearwater Bay, Kowloon, Hong Kong, China<br />ong Kong University of Science and Technology<br />Clearwater Bay, Kowloon, Hong Kong, China<br />Presented in : ICDM '05The Fifth IEEE International Conference on Data Mining<br />
  74. 74. Contributors<br />Pedro Domingos<br />Charles Elkan<br />Johannes Gehrke<br />Jiawei Han<br />David Heckerman<br />Daniel Keim<br />Jiming Liu <br /><ul><li>Gregory Piatetsky-Shapiro
  75. 75. Vijay V. Raghavan
  76. 76. RajeevRastogi
  77. 77. Salvatore J. Stolfo
  78. 78. AlexanderTuzhilin
  79. 79. Benjamin W. Wah</li></li></ul><li>A New Feature at ICDM 2005 <br />What are the 10 most challenging problems in data mining, today?<br />Different people have different views, a function of time as well.<br /> What do the experts think?<br /> - Experts we consulted:<br /> Previous organizers of IEEE ICDM and ACM KDD<br />They were asked to list their 10 problems (requests sent out in Oct 05,and replies Obtained in Nov 05)<br /> Replies:<br /> - Edited and presented in this paper<br /> - Hopefully be useful for young researchers<br /> - Not in any particular importance order<br />
  80. 80. 1. Developing a Unifying Theory ofData Mining<br />The current state of the art of data-mining research is too ``ad-hoc“ <br /> - techniques are designed for individual problems<br /> (e.g. classification or clustering) <br /> - no unifying theory<br />A theoretical framework is required that unifies:<br /><ul><li>Data Mining tasks –</li></ul> Clustering <br /> Classification<br /> Association Rules etc.<br /><ul><li>Data Mining approaches -</li></ul> Statistics<br /> Machine Learning<br /> Database systems etc.<br />
  81. 81. 1. Developing a Unifying Theory ofData Mining<br />Long standing problems in statistical research<br /> - How to avoid spurious correlations?<br /> - sometimes related to the problem of mining for “deep knowledge”.<br /><ul><li>Example:</li></ul> Strong correlation found between the timing of TV series by a particular star and the occurrences of small market crashes in Hong Kong. Can we conclude that there is a hidden cause behind the correlation?<br />
  82. 82. 2. Scaling Up for High DimensionalData and High Speed Data Streams<br />Scaling up is needed because of following challenges:<br /><ul><li> - Classifiers with hundreds or billions of features to be built for applications like text mining & drug safety analysis. </li></ul>Challenge – how to design classifiers to handle ultra high dimensional classification problems.<br /><ul><li> - Satellite and Computer Network data comprise extremely large databases (e.g. 100TB). Data mining technology today is still slow.</li></ul>Challenge – how can data mining technology handle data of this scale. <br />
  83. 83. 2. Scaling Up for High DimensionalData and High Speed Data Streams<br /><ul><li>Data Mining should be a continuous online process, rather than an occasional one shot process. </li></ul> E.g. Analysis of high speed network traffic for identifying anomalous events.<br />Challenge: how to compute models over streaming data which accommodate changing environments from which data is drawn. (“Concept drift” or “Environment drift”)<br /><ul><li>Incremental Mining and effective model updating to maintain accurate modeling of the current stream required. </li></li></ul><li>3. Sequential and Time Series Data<br />How to efficiently and accurately cluster, classify and predict the trends in sequential and time series data ?<br /> Time series data used for predictions are<br /> contaminated by noise<br />How to do accurate short-term and long-term predictions?<br />Signal processing techniques introduce lags in the filtered data, which reduces accuracy<br />
  84. 84. 3. Sequential and Time Series Data<br />Real time series data obtained from Wireless sensors in Hong Kong UST CS department hallway<br />
  85. 85. 4. Mining Complex Knowledge fromComplex Data<br />Important type of complex knowledge is in the form of graphs.<br />Challenge: More research required in the field of discovering graphs and structured patterns from large data.<br />Data that are not i.i.d. (independent and identically distributed)<br /> -many objects are not independent of each other, and are not of a single type.<br />Challenge: Data mining systems required that can soundly mine the rich structure of relations among objects.<br /> -E.g.: interlinked Web pages, social networks, metabolic networks in the cell<br />
  86. 86. 4. Mining Complex Knowledge fromComplex Data<br /><ul><li>Most organization’s data is in text form and in complex data formats like Image, Multimedia and Web data.</li></ul> Challenge: How to mine non-relational data.<br />Integration of data mining and knowledge inference required.<br />Challenge ( The biggest gap): unable to relate the results of mining to the real-world decisions they affect - all they can do is hand the results back to the user.<br />More research on interestingness of knowledge<br />
  87. 87. 5. Data Mining in a Network Setting<br />Community and Social Networks:<br /> -Linked data between emails, Web pages, blogs, citations, sequences and people<br />Problems:<br /><ul><li>It is critical to have right characterization of the “community” to be detected.
  88. 88. Entities/ nodes are distributed. Hence, distributed means of identification desired.
  89. 89. Snapshot based dataset may not be able to capture the real picture.</li></ul>Challenge:<br />To understand – <br /><ul><li>Network’s static structures (e.g. topologies & structures)
  90. 90. Dynamic Behavior (e.g. growth factor, robustness, functional efficiency)</li></li></ul><li>5. Data Mining in a Network Setting<br />Mining in and for Computer Networks<br /> - Network links are increasing in speed.(1-10 Gig Ethernet)<br /> - To be able to detect anomalies, fast capture of IP packets at high speed links and analyzing massive amounts of data required.<br />Challenge:<br /> - highly scalable solutions required.<br /> - i.e. Good algorithms required to<br /> (a) detect DoS attacks<br /> (b) trace back to find attackers<br /> (c ) drop packets that belong to attack traffic.<br />
  91. 91. 6. Distributed Data Mining andMining Multi-agent Data<br /><ul><li>Important in Network Problems.
  92. 92. In Distributed Environment(sensor/IP Network),distributed probes are placed at locations within the network.
  93. 93. Problems :</li></ul> 1] Need to correlate & discover data patterns at various probes.<br /> 2] Communication Overhead (amount of data shipped between various sites).<br /> 3] How to mine across multiple heterogeneous data sources.<br /><ul><li>Adversary data mining: deliberately manipulate the data to sabotage them(produce false negatives) e.g. email spam, counter-terrorism, intrusion detection/computer security, click spam, search engine spam, fraud detection, shopbots, file sharing,etc.
  94. 94. Multi-agent Data Mining : Agents are often distributed & have proactive and reactive features.</li></ul>$ejr31cyc<br /><br />
  95. 95. 7. Data Mining for Biological andEnvironmental Problems<br />Mining Biological data – extremely imp problem.<br /> eg.HIV Vaccine design.<br />Molecular biology eg. DNA<br /> chemical properties,<br /> 3D structures,functional <br /> properties.<br />
  96. 96. 7. Data Mining for Ecological & Environmental Problems<br /><ul><li>Utilize our natural environment & resources in proper way..But…</li></ul>How can Data Mining be used to study & find out contributing factors to find :<br />1] Number of hurricane occurrences <br /> 2] Global climate changes and potential “bird flu” epidemics.<br /> 3] human-centered systems (e.g. user-adapted human-computer interaction or P2P transactions).<br /><ul><li>“Killer” Applications (bioinformatics, CRM/personalization & security applications).</li></ul>Reported in Science Magazine<br />
  97. 97. 8. Data-mining-Process RelatedProblems<br />How to automate mining process?<br />Issues:<br /> 1] 90% of cost is in pre-processing.<br /> 2] Systematic documentation of data cleaning.<br /> 3] Combine visual interactive & automatic DM.<br /> 4] In exploratory data analysis,DM goal is undefined.<br /><ul><li>Challenges:</li></ul> - The composition of data mining operations.<br /> - Data cleaning, with logging capabilities.<br /> - Visualization and mining automation.<br />Need a methodology: help users avoid many data mining mistakes.<br /> -What are the approaches for multi-step mining queries?<br /> - What is a canonical set of data mining operations?<br />
  98. 98. 8. Data-mining-Process RelatedProblems<br />Sampling<br />Feature Selection<br />Mining….<br />
  99. 99. 9. Security, Privacy and Data Integrity<br /><ul><li>How to ensure the users privacy while their data are being mined?
  100. 100. How to do data mining for protection of security and privacy?
  101. 101. Knowledge integrity assessment </li></ul> - Data are intentionally modified from their original version, in order to misinform the recipients or for privacy and security<br /> - Development of measures to evaluate the knowledge integrity of a collection of<br /> -- Data<br /> -- Knowledge and patterns<br />
  102. 102. 9. Security, Privacy and Data Integrity<br /><ul><li>Challenges:</li></ul>1] Develop efficient algorithms for comparing the knowledge contents of the two (before and after) versions of the data.<br /> 2] Develop algorithms for estimating the impact that certain modifications of the data have on the statistical significance of individual patterns obtainable by broad classes of data mining algorithms.<br /><ul><li>Headlines (Nov 21 2005) Senate Panel Approves Data Security Bill - The Senate Judiciary Committee on Thursday passed legislation designed to protect consumers against data security failures by, among other things, requiring companies to notify consumers when their personal information has been compromised. While several other committees in both the House and Senate have their own versions of data security legislation, S. 1789 breaks new ground by including provisions permitting consumers to access their personal files …</li></ul><br />
  103. 103. 10. Dealing with Non-static,Unbalanced and Cost-sensitive Data<br />Data is non-static,constantly of collecting data in 2000,then 2001,2002 ……Problem is to correct the bias.<br />Deal with unbalanced & cost-sensitive data:<br />There is much information on costs and benefits, but no overall model of profit and loss.<br />Data may evolve with a bias introduced by sampling<br />ICML 2003 Workshop on Learning from Imbalanced Data Sets<br />
  104. 104. 10. Dealing with Non-static,Unbalanced and Cost-sensitive Data<br />Cardiogram<br /> ?<br />blood test<br /> ?<br />Pressure<br /> ?<br />Temperature 39 degrees<br /> ?<br />biopsy<br /> ?<br /><ul><li> Each test incurs a cost</li></ul>• Data extremely unbalanced<br />• Data change with time<br />
  105. 105. Conclusion<br />There is still a lack of timely exchange of important topics in the community as a whole.<br />These problems are sampled from a small, albeit important, segment of the community.<br />The list should obviously be a function of time for this dynamic field.<br />
  106. 106. THANK YOU!!!<br />