<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>July</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Exploring Clustering Based Knowledge Discovery towards Improved Medical Diagnosis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rajendra Prasath</string-name>
          <email>R.Prasath@ucc.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Philip O'Reilly</string-name>
          <email>Philip.OReilly@ucc.ie</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Causes and Effects, Medical Diagnosis, Semantically Similar
diseases, Information Geometry, Graph Analysis</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dept. of Business Information</institution>
          ,
          <addr-line>Systems</addr-line>
          ,
          <institution>University College Cork</institution>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dept. of Business Information</institution>
          ,
          <addr-line>Systems</addr-line>
          ,
          <institution>University College</institution>
          ,
          <addr-line>Cork</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <volume>11</volume>
      <issue>2014</issue>
      <fpage>28</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>We propose to develop a framework for an intelligent reasoner with capabilities that support complex decision making processes in medical diagnosis. Identifying the causes, reasoning the effects to explore information geometry and learning the associated factors, from medical forum information extracted, are the core aspects of this work. As part of the proposed framework, we present an approach that identifies semantically similar causes and effects for any specific disease from medical diagnosis literature using implicit semantic interconnections among the medical terms. First we crawled MedHelp1 forum data and considered two types of information: forums data and posts data. Each forum link points to a specific disease and consists of several topics pertaining to that disease. Each topic consists of multiple posts that carry either users' queries/difficulties or doctor's feedback pertaining to the issue(s) of the users. We use graph based exploration on the terms (diseases) and their relations (in terms of causes/effects) and explore the information geometry pertaining to similar diseases. We performed a systematic evaluation to identify the relevance of the contextual information retrieved for a specific disease and similar factors across different diseases. The proposed approach looks promising in capturing similar causes and/or effects that pertain to multiple diseases. This would enable medical practitioners to have a multi-faceted view of a specific disease/condition.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>Understanding the causes and effects pertaining to
a specific disease is key to better prediction in
medical diagnosis and improved patient management.
Diseases/Conditions may have similar or semantically
related causes and effects. Furthermore, gaining insight
on how diseases are diagnosed and managed would enable
1http://www.medhelp.org/forums/list
medical practitioners to make more informed decisions on
disease management. Illustrating the role of machine
learning as an enabler of this for more informed decision
support is a key aspect of this paper. In this paper, we
present an approach to identify causes and effects that
exist across different diseases using a graph clustering based
knowledge discovery approach.</p>
      <p>Understanding causation and correlation between
individual factors is key to decision making in multiple
domains including medicine and business. Traditionally,
such association between elements has been identified
through human interpretation of text. However, this is
a very time consuming, manual, labour intense process
and is limited by human capacity. The ability to mine
textual content, identify association and the nature of
that association between elements using machine learning
techniques provides significant opportunities. Specifically
in the medical domain, where a significant amount of
content is textual in nature (e.g. medical notes), having
the ability to identify causation and correlation between
elements in large medical datasets provides significant
opportunity for advancing medical research and enabling
better decision making pertaining to condition diagnosis and
patient management.</p>
      <p>In this paper, we attempt to identify and create
term clusters using graph clustering approach and then
perform topic classification. This approach improves the
document classification task by putting the terms, that are
semantically related, in the same cluster. Users could search
for a specific disease and explore information pertaining to
its causes and effects by means of semantically related texts.</p>
    </sec>
    <sec id="sec-2">
      <title>BASED</title>
    </sec>
    <sec id="sec-3">
      <title>KNOWLEDGE 2.</title>
    </sec>
    <sec id="sec-4">
      <title>CLUSTERING</title>
    </sec>
    <sec id="sec-5">
      <title>DISCOVERY</title>
      <p>
        To incorporate natural language understanding,
commonsense and domain specific knowledge could be used to
improve the text representation by including more generated
informative features to perform deep understanding of the
document text than the mere Bag-of-Words approach [
        <xref ref-type="bibr" rid="ref2 ref4 ref8">4,
2, 8</xref>
        ]. Mitra et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] proposed an unsupervised
feature selection algorithm suitable for data sets, based on
measuring similarity between features whereby redundancy
therein is removed. Pedersen and Kulkarni [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] presented
a system called SenseClusters to cluster similar contexts
in natural language text and assigns identifying labels
to these clusters based on their content. In addition
to clustering similar contexts, it can be used to identify
synonyms and sets of related words2. To incorporate
this kind of additional common-sense/domain knowledge,
Gabrilovich and Markovitch [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] used world knowledge
from open source knowledge repository like Wikipedia to
generate additional features. Similar intuition is adopted
to form word clusters that generate features enriching the
document content in a better way. Then the documents
are represented in the knowledge-rich space of generated
features. This leads to better organization of semantically
related text representation. In this proposed scheme, given
a knowledge repository, the text documents are examined
and their representation is enriched in a completely
mechanical way. Motivated by the above considerations,
our aim is to empower machine learning techniques for text
representation with a substantially wider body of knowledge
like the one obtained from the superior inference capabilities
of humans.
2.1
      </p>
    </sec>
    <sec id="sec-6">
      <title>Mathematical Formulation</title>
      <p>In this section, we characterize the medical forum data
in a formal way. Each post pertaining to a specific topic
is informally written and we focus on terms and their
cooccurrences. We have n textual descriptions, viz-a-viz,
posts: P = {p1, p2, · · · , pn} and each post can be formally
represented as a sequence of terms, illustrating the scenario
of the underlying disease, as follows: pi = {t1, t2, · · · , tm}
where 1 ≤ i ≤ m and m varies differently for different post.
We convert the entire text data of all posts into a graph, say
G = (V, E) where V represents the set of nodes (each term
in P is considered as a node) and the co-occurrence of any
pair of nodes across the posts is considered to be the edge
representing the strength of association between the pair of
nodes.
2.2</p>
    </sec>
    <sec id="sec-7">
      <title>Graph Clustering</title>
      <p>Clustering deals with identifying a pattern/structure in
the bunch of unlabeled data. In general, clustering organizes
data into groups whose members are related in some way
and two or more data can be grouped into the same cluster
if they are, in some way, falling close to each others’ context.
Clustering has many useful applications like finding a group
of people with similar behavior, processing orders, grouping
plants and animals, grouping web blog data to access similar
patterns.</p>
      <p>While exploring a variety of possibilities to identify the
context of causes and effects of diseases from text fragments,
feature space grows and it is hardly possible to limit the
expansion of the new feature space containing the local
contexts extracted from the informal writing of medical
data. This could possibly be solved by using dimensionality
reduction techniques to limit the size of the document
to be classified. This attempt first makes word cluster
vectors using unsupervised feature generation by identifying
the related contexts. Then using the identified contexts,
supervised learning is performed for categorizing the given
text collection consisting of user posts.</p>
      <p>First, we use the entire collection of medical diagnosis
related posts and filter out the list of the distinguishable
unique terms. Using these terms, we first build the weighted
graph in which nodes represent terms and edges represent
the weight - the number of documents in which the given
pair of terms co-occurs across the collection of posts. For
2word and term are used interchangibly
each unique term, the list of documents in which it occurs is
retrieved. Using this data, we build the weighted graph in
which the edge between two terms would represent their
semantic association implicitly. This process is repeated
for all features and a weighted graph for the overall data
is constructed. Thus the problem is modeled into a graph
clustering problem. This results in a graph G = (V, E, A)
where |V | = n represents the number of unique terms; |E|
represents the number of edges and the adjacency matrix;
and A is |V | × |V | whose nonzero entries correspond to
the edge weight between a pair of terms (adjacency list is
assumed in case of sparse matrix - in this case, number of
rows in the graph represents the total number of terms in
the graph).</p>
      <p>
        We use the kernel-based multilevel clustering algorithm
proposed by Dhillon et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] on the weighted input graph
with the number of desired partitions. This algorithm uses
three steps: coarsening, base-clustering, and refinement. In
coarsening, the given graph is repeatedly transformed into
smaller subgraphs. This process is repeated until a few
nodes remain in the graph. Then during base clustering,
regional growing approach [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] could be used with these few
nodes. The quality of the resulting clusters depends on the
choice of the initial nodes. The refinement process is applied
as follows: If a node in Gi is in cluster c, then all nodes
in Gi−1 formed from that node are in cluster c. For more
details, please refer to [
        <xref ref-type="bibr" rid="ref1 ref5">1, 5</xref>
        ].
      </p>
      <p>In this work, we generate term clusters from extracted
word graphs, using co-occurrence information of terms. The
task is to partition the graph into clusters so that terms
could be grouped into a few subsets and dimensionality of
the new term space is reduced. Now based on the generated
term clusters, we perform classification to identify similar
causes and effects across various diseases.
2.3</p>
    </sec>
    <sec id="sec-8">
      <title>Proposed Approach</title>
      <p>The proposed approach works as follows: From the posts
of each topic, textual descriptions are extracted. Unique
terms (after removing stop words) are considered as nodes
in the graph and the number of times a pair of terms
cooccurs in the entire corpus is considered as the weight of the
edge connecting the pair of terms. At first, we build word
cluster vectors using graph clustering algorithm.
Algorithm 1 Building Word Clusters
Input: A set of n textual descriptions (posts)</p>
      <p>P = {p1, p2, · · · , pn}
A set of predefined category labels C = {c1, c2, · · · , cl}
Build Word Cluster Vectors:
1: Extract text from posts and build the unique word list
2: for each unique term ti in the word list do
3: Identify the existence of edges from ti to all other
terms with nonzero positive weight.
4: Store the co-occurring term with its corresponding
edge weight in the adjacency list
5: end for
6: Use kernel-based multilevel graph clustering algorithm
on the adjacency list and perform clustering to generate
cluster IDs
7: For every cluster ID, construct word clusters
8: Store these word cluster vectors</p>
      <p>Secondly, we use these word cluster vectors to re-represent
text documents that discuss the causes and effects of a
specific disease. Then we perform classification of the
re-represented text documents. The proposed algorithm
inherently applies clustering semantically related terms and
performs classification of them. Based on the word clusters
found in the first step, we perform the classification on
the clustered space of label pertaining to the terms in the
original documents.</p>
      <p>Algorithm 2 Classification using Word Clusters
1: Preprocess the text documents by removing numbers,
punctuations and stop-words (using SMART3 word list)
2: for each processed text (post) data pi in P do
3: for each unique term in pi do
4: Identify its cluster id
5: Map the given feature in terms of its cluster ID
6: Augment text fragments with cluster ID mappings
7: end for
8: end for
9: Build classifier on these mapped/expanded text data
(containing only cluster IDs) and use it to predict the
class of the text having similar causes and effects
10: Compute the classification accuracy
Output: The category label(s) for texts (post) that have
similar causes and effects across diseases.</p>
    </sec>
    <sec id="sec-9">
      <title>Corpus</title>
    </sec>
    <sec id="sec-10">
      <title>EXPERIMENTAL RESULTS</title>
      <p>We crawled a subset of MedHelp4 forum data from the
world wide web. The MedHelp forum is organized as a set
of topics, each representing a specific disease and under each
topic, there are several subtopics. Each subtopic consists
of several posts from both users (may be patients or their
dependents) and doctors as well.</p>
      <p>For our experiments, we have selected 15 categories
covering the most widely discussed topics in the MedHelp
forum. The details of this experimental corpus is given in
Table. 1</p>
      <p>We have used 3 different types of classifiers, namely
Naive Bayes, k−Nearest Neighbours (k−NN), and Support
Vector Machines (SVM), to test the effect of the proposed
approach. We have used rainbow5 to build the classification
models and during classification, we have used 60% of the
data for training and 40% for testing.
3.1.1</p>
      <p>Evaluation Methodology</p>
      <p>We have used Precision, Recall, F-Measure and the
classification Accuracy to evaluate the quality of the
identified diseases having similar causes and effects. We use
the two-way confusion matrix given in Table. 2 to derive the
evaluation measures:</p>
      <p>Precision is defined as follows:</p>
      <p>Class
Asthma
Breast-Cancer
COPD
Cosmetic
Dental
Embarazo
Genetic-Disorder
Hepatitis
Kidney
Liver-Transplant
Oral
Pathology
Respiratory
Thyroid-Cancer
Varicose-Veins
#Diseases (Posts)
35 (43)
35 (37)
41 (47)
57 (64)
97 (100)
41 (52)
59 (68)
110 (147)
69 (89)
64 (62)
35 (47)
31 (36)
48 (54)
58 (63)
36 (52)
80.00
cya
ru60.00
cc
A
40.00
20.00
0.00</p>
      <p>We have observed the classification accuracy of k−NN
classifier for various values of k (=10, 20, 30, 50) and found
that for k =30, the system performs very well. In this
classification task, we have observed that the maximum
number of instances from the class “Liver-Transplant” is
misclassified under “Hetatitis” class as the causes of these
common diseases coincide by and large. At the same time,
none of the instances is classified correctly for the class
“Pathology” as these causes and effects are very similarly
described as that of “Hepatitis” and “Thyroid-cancer”. While
using the SVM classifier, we noticed that some instances
are misclassified across the classes: “Breast-cancer” and
“Cosmetic”. In this case, user raised cross reference
related queries with post surgical treatment of the
Breastcancer disease. Similar misclassification is found across the
classes: “Chronic Obstructive Pulmonary Disease” (COPD)
and “Resporatory”. Subsequently, we would like to apply
this approach for effective retrieval of causes and effects
pertaining to a specific disease. Also we will draw the
information geometry of prominent diseases that share the
common causes/effects in our subsequent experiments.</p>
    </sec>
    <sec id="sec-11">
      <title>CONCLUSION</title>
      <p>We proposed a method to enable greater understanding
of various conditions, their symptoms, treatment and
management by identifying similar scenarios, reasoning
the effects to explore information geometry and learning
the associated contextual factors, from medical forum
information extracted from health services data. This
approach identifies semantically similar causes and effects
for any specific disease/condition, using implicit semantic
interconnections among the medical terms. We use
graph based exploration on the terms and their relations
(causes/effects) across the collection of posts and explore
the information geometry pertaining to the similar diseases.
We evaluated the relevance of the contextual information
retrieved for a specific disease and/or similar factors
across different diseases. The proposed approach looks
promising in capturing similar scenarios pertaining to
multiple diseases. This would enable medical practitioners
to have a multi-faceted view about any specific disease,
towards better decision making.
70.86
62.54
54.13
NaiveBayes
krNN (k=30)
Acknowledgments: This research is co-funded by the
Irish Government (Enterprise Ireland) and European Union
(European Regional Development Fund). Dr. Philip
O’Reilly is the Principal Investigator responsible for this
research and can be contacted at Philip.Oreilly@ucc.ie.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Dhillon</surname>
            ,
            <given-names>I. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guan</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Kulis</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <article-title>Weighted graph cuts without eigenvectors a multilevel approach</article-title>
          .
          <source>IEEE Trans. Pattern Anal. Mach. Intell</source>
          .
          <volume>29</volume>
          ,
          <issue>11</issue>
          (
          <year>2007</year>
          ),
          <fpage>1944</fpage>
          -
          <lpage>1957</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Gabrilovich</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <article-title>Feature Generation for Textual Information Retrieval Using World Knowledge</article-title>
          .
          <source>PhD thesis</source>
          , Technion - Israel Institute of Technology, Haifa, Israel,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Gabrilovich</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Markovitch</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Feature generation for text categorization using world knowledge</article-title>
          .
          <source>In Proceedings of the 19th International Joint Conference on Artificial Intelligence</source>
          (San Francisco, CA, USA,
          <year>2005</year>
          ), IJCAI'
          <fpage>05</fpage>
          , Morgan Kaufmann Publishers Inc., pp.
          <fpage>1048</fpage>
          -
          <lpage>1053</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Internet encyclopaedias go head to head</article-title>
          .
          <source>Nature</source>
          <volume>438</volume>
          ,
          <issue>1</issue>
          (
          <year>2005</year>
          ),
          <fpage>900</fpage>
          -
          <lpage>901</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Karypis</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>A fast and high quality multilevel scheme for partitioning irregular graphs</article-title>
          .
          <source>SIAM J. Sci. Comput</source>
          .
          <volume>20</volume>
          ,
          <issue>1</issue>
          (
          <year>1998</year>
          ),
          <fpage>359</fpage>
          -
          <lpage>392</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Mitra</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murthy</surname>
            ,
            <given-names>C. A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Pal</surname>
            ,
            <given-names>S. K.</given-names>
          </string-name>
          <article-title>Unsupervised feature selection using feature similarity</article-title>
          .
          <source>IEEE Trans. Pattern Anal. Mach. Intell</source>
          .
          <volume>24</volume>
          ,
          <issue>3</issue>
          (
          <year>2002</year>
          ),
          <fpage>301</fpage>
          -
          <lpage>312</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Pedersen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Kulkarni</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Identifying similar words and contexts in natural language with senseclusters</article-title>
          .
          <source>In Proc. of the 20th national conf. on Artificial intelligence</source>
          (
          <year>2005</year>
          ), AAAI'
          <fpage>05</fpage>
          , AAAI Press, pp.
          <fpage>1694</fpage>
          -
          <lpage>1695</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Prasath</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Sarkar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Unsupervised feature generation using knowledge repositories for effective text categorization</article-title>
          .
          <source>In Proceedings of the 2010 Conference on ECAI 2010: 19th European Conference on Artificial Intelligence (Amsterdam</source>
          , The Netherlands, The Netherlands,
          <year>2010</year>
          ), IOS Press, pp.
          <fpage>1101</fpage>
          -
          <lpage>1102</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>