<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Data mining techniques for predicting the survival of passangers on the Titanic</title>
  </titleInfo>
  <name type="personal">
    <namePart>Bakiev, Sabit Kenjebaevich</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Guha, Sumanta</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Vatcharaporn Esichaikul</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Huynh, Trung Luong</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Asian Development Bank - Japan Scholarship Program (ADB-JSP)</namePart>
    <role>
      <roleTerm type="text">Scholarship donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">series</genre>
  <genre authority="marc">technical report</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Pathum Thani, Thailand</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>2016</dateIssued>
    <issuance>continuing</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>30 p. : ill.</extent>
  </physicalDescription>
  <abstract>Mining techniques have proven to be effective in exploring data. In this report, the efficiency  of several data-mining methods is explored. In particular, we apply these methods to the  predictive modelling competition Titanic: Machine Learning from Disaster currently active  at kaggle.com, a website for such competitions. This particular competition is a classification  challenge to build a model to predict which passengers on the Titanic survived. The focus of  our approach is comparing different data-mining techniques such as K-neighbourhood,  Logistic Regression, Support Vector Machine, XGBoost, Linear Regression, Stochastic  Gradient Decent, Decision Tree, Naive Bayes and Random Forest algorithms. Results indicate  that the predictors' gender, ticket price, embarked port, age, title, and passenger class are the  most important variables to predict survival of the passengers. According to the results,  Random Forest classifier has gained the highest accuracy of nine classifiers with a score:  "0.80861" (322 out of 3667) top 10% on the Titanic: Machine Learning from Disaster  Competition.  </abstract>
  <note>A researchsubmitted in partial fulfillment of the requirements for thed egree of Masterof Science in Information Management, School of Engineering and Technology</note>
  <note>Research studies project report (M. Sc.) - Asian Institute of Technology, 2016</note>
  <subject authority="lcsh">
    <topic>Data mining</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Machine learning</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Research studies project report  ; no. IM-16-05</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B05037</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B05037</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">200710</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818085750.0</recordChangeDate>
  </recordInfo>
</mods>
