<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T08:49:55Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/61199" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/61199</identifier><datestamp>2022-01-13T07:54:48Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Natasha Markuzon and Roy Welsch.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Snyder, Ashley M. (Ashley Marie)</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Operations Research Center</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Sloan School of Management</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2011-02-23T14:28:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2011-02-23T14:28:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2010</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/61199</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">701084313</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2010.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 163-166).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Data mining is a versatile and expanding field of study. We show the applications and uses of a variety of techniques in two very different realms: Emergency department (ED) length of stay prediction and visual analytics. For the ED, we investigate three data mining techniques to predict a patient's length of stay based solely on the information available at the patient's arrival. We achieve good predictive power using Decision Tree Analysis. Our results show that by using main characteristics about the patient, such as chief complaint, age, time of day of the arrival, and the condition of the ED, we can predict overall patient length of stay to specific hourly ranges with an accuracy of 80%. For visual analytics, we demonstrate how to mathematically determine the optimal number of clusters for a geospatial dataset containing both numeric and categorical data and then how to compare each cluster to the entire dataset as well as consider pairwise differences. We then incorporate our analytical methodology in visual display. Our results show that we can quickly and effectively measure differences between clusters and we can accurately find the optimal number of clusters in non-noisy datasets.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Ashley M. Snyder.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">166 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by 
copyright. They may be viewed from this source for any purpose, but 
reproduction or distribution in any format is prohibited without written 
permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Operations Research Center.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Data mining and visualization : real time predictions and pattern discovery in hospital emergency rooms and immigration data</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Real time predictions and pattern discovery in hospital emergency rooms and immigration data</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="46ca8075-0937-4ada-b06e-4cd2c35c643a">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Data mining and visualization : real time predictions and pattern discovery in hospital emergency rooms and immigration data&lt;/Title>
   	&lt;Subtitle>Real time predictions and pattern discovery in hospital emergency rooms and immigration data&lt;/Subtitle>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2010&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Snyder, Ashley M. (Ashley Marie)&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Operations Research Center.&lt;/Keyword>
   	&lt;Abstract>Data mining is a versatile and expanding field of study. We show the applications and uses of a variety of techniques in two very different realms: Emergency department (ED) length of stay prediction and visual analytics. For the ED, we investigate three data mining techniques to predict a patient&amp;apos;s length of stay based solely on the information available at the patient&amp;apos;s arrival. We achieve good predictive power using Decision Tree Analysis. Our results show that by using main characteristics about the patient, such as chief complaint, age, time of day of the arrival, and the condition of the ED, we can predict overall patient length of stay to specific hourly ranges with an accuracy of 80%. For visual analytics, we demonstrate how to mathematically determine the optimal number of clusters for a geospatial dataset containing both numeric and categorical data and then how to compare each cluster to the entire dataset as well as consider pairwise differences. We then incorporate our analytical methodology in visual display. Our results show that we can quickly and effectively measure differences between clusters and we can accurately find the optimal number of clusters in non-noisy datasets.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>