Implementation of Fuzzy C-Means
Algorithm and TF-IDF on English
Journal Summary
Mohamad Irfan1, Jumadi2, Wildan Budiawan Zulfikar3, Erik4
1,2,3,4
Department of Informatics, UIN Sunan Gunung Djati Bandung
Jl. AH Nasution No. 105, Bandung, West Java, Indonesia
1
irfan.bahaf@uinsgd.ac.id, 2jumadi@uinsgd.ac.id, 3wildan.b@uinsgd.ac.id, 4erikfb@gmail.com
Abstract— Text Summary is a process of distilling
important information from various sources to
produce a summary used by personal users or for
certain works. Usually the method of summary is
studied in language lesson, unfortunately the foreign
language proficiency of Indonesian particularly on
English is very low. Hence, to make summary of
English texts will be difficult and automatic
summary tool is needed. The application is able to
summarize a text by input the file text in pdf format.
Furthermore, to make us sure how important
sentences in a document Weighting every single
sentence will be as the best way. Weighting is used by
TF-IDF method. Fuzzy C Means Method is used in
Weighting resulting sentences is divided into two
groups; first, important groups (High Sentence
Weight) and second, unimportant groups ( Low
Sentence Weight).
Keyword—Automatic Text Summary Tool, Term
Frequency– Inverse Document Frequency, Fuzzy C-
means.
I. INTRODUCTION
Archives of file; text, pictures, sounds etc. each has
important information. Text document is usually often
used. Students in universities mostly use it to make a
final assignment as a theory base for their research.
Journals of technology are the most read by them and
mostly it is written in English.
Data showed that English proficiency level of
Indonesian is still low. Tribbunnews.com noted as
follows: EF announced result of global survey English
Proficiency Index (EF EPI) in Jakarta. Indonesia is in
32nd position from 72 surveyed countries with the
score 52.91. It showed that Singapore as asian country
that has the highest score in English proficiency level
followed by Malaysia and Philiphines in the top 15.
Moreover, Indonesia got lower score than some
counties in region such as Vietnam that is in 31st
position 'middle level' [1].
Method of weighting log-tf.idf is used as it is the
best method in information retrieval. Score weight of a
term states about importance of the weight in
representing documents. In weighting of log-tf.idf, the
weight will be increased if frequency of occurrence of
term is higher, but the weight will be decreased if the
frequency of occurrence of the term is higher in another
documents[2].
Fuzzy c-means (FCM) clustering is a group model
of fuzzy to make data as a member of all classes or
cluster shaped by different membership level between
0 and 1. The level of data in a class or cluster is
decided by its membership level[3]. Based on the
background stated, researchers intended to apply the
algorithm to prove whether the algorithm can be
applied and combined with algorithm of TF-IDF in
text mining program which concentrates in a journal
summary issue so the point of the text can be extracted.
The point stated above is about the issue raised in
the text, methods or solutions to solve the issue and
result of solution application to the problem. It is
intended to make readers of the text are able to quickly
understand the gist of the documents.
II. DOCUMENT CLUSTERING
A. Automatic Text Summary
Automatic text summary is a field of research
started in 1958. The main purpose of research is to
summarize the text documents into shorter without
exceeds given limit and maintain vital information and
overall meaning [4].
Automation summary can be applied for a
document (single document summarization) or some
documents (multiple document summarization), a
language (monolingual) or some languages
(translingual/multilingual).
The output of automatic text summarization is
divided into two parts; first, extract is a process to
choose some significant sentences of a document.
Second, abstract is a process to make a summary as a
substitution of the original documents [5]. Fig. 1 is an
illustration from an automatic text summarization
machine.
Fig. 1. Automatic Text Summarization Machine [5]
The machine has several modules to summarize
completely. Fig. 2 shows the structure of existing
modules on the automatic text summarization machine.
several times in the document and matches with the
frequency of occurrence of the word in all documents.
TF-IDF can be formulated as follows [7]
TF- IDF( tk,dj)= TF( tk,dj)*IDF ( tk) (2.1)
Notes:
dj=the j-th document
tk =the k-th term
Term frequency (TF) is previously calculated
which is the frequency of occurrence of a term in each
document. IDF is then claculated which is the weight
value of a term calculated from the frequency of a term
appears in some documents. The more often a term
appears in several documents, the IDF value will be
small. The TF and IDF are calculated as follows [7]
TF( tk,dj)=f( tk,dj) (2.2)
Notes:
TF = term frequency

f = occurrence frequency
dj = the j-th document
tk = the k-term
The IDF value can be calculated by the following
Fig. 2. Summarization Modules [5] formulas [7]:
ଵ
The Soft Clustering algorithm uses membership IDF (tk) = (2.3)
ௗ௙ሺ௧ሻ
values (inspired by fuzzy set theory) to associate the
degree of membership of a document to a particular or
cluster. The membership values lie on the interval
ே
[0,1]. Fuzzy groupings generate clusters but not IDF (tk) = Ž‘‰ (2.4)
ௗ௙ሺ௧ሻ
partitions. The document on fuzzy clustering involves
more than one cluster. The membership degree of the Notes:
document on a particular cluster determines how close
the document is to the cluster. IDF =term weight
Hard groupings can also be obtained from fuzzy
N =number of documents
groupings by taking the threshold of the membership
function values, namely the document may be a part of df =document occurrence
the cluster. The membership value is greater than the
threshold value (say 0.7). Fuzzy C-means is a popular dj =the j-th document
flat clustering. The algorithm is relatively better than
the hard K-means. The sensitivity requirements of this tk =the k-th term
selected initial value tend to meet a local minima [6]. Equation (2.3) can solely be used if there is only one
document, while equation (2.4) is used on multiple
B. Term Frequency-Invers Document Frequency (TF- documents. TF-IDF is a core of preprocessing text and
IDF) an efficient and simple method to implement on several
kind of text [8][9][10]. There are two process in order to
TF-IDF weighting is a statistical measurement to refine the discover pattern in text document as follow:
measure how important a word is in a document. The pattern deploying and pattern evolving [11].
importance level increases when a word appears

C. Fuzzy C-Means (FCM)
The fuzzy c-means method, which was developed
by Dunn in 1973 and enhanced by Bezdek in 1981, is
often used in pattern recognition [12]. The data points
are placed into different groups by considering the
similarity of the data values with the cluster center. The
FCM's job is to minimize objective function. It is an
iterative process that modifies by updating the matrix
of membership degrees and cluster center repeatedly
until it gets the optimal local classification [13].
Fuzzy c-means (FCM) grouping is based on the
fuzzy logic theory. In the fuzzy theory, the membership
of data is not assigned a firm value with a value of 1
(being a member) and 0 (not a member), but with a
membership degree value whose value range is 0 to 1.
The membership value of data in a set is 0 if the data is
not a member and 1 when the data is a full member of
the set. The higher the membership value, the higher
the degree of membership, and vice versa [14].
The number of membership degrees of each data xi
is always 1 which can be calculated by:
σ௞௝ୀଵ uij = 1 (2.5)
Each cj group contains at least one data with a
non-zero membership value, but does not contain one
degree in all data. The formula is
Ͳ ൏ σ௠௜ୀଵ uij <m (2.6)
Similar to the fuzzy set theory where data can be a
member in some sets expressed by the value of degree
of membership in each set, in FCM, each data can also
be a member in each group with degrees of
membership uij.
The value of data membership xi in group vj can be
calculated by
మ frequency of the document to determine the
uij =
ୈሺ௫௜ǡ௖௝ሻೢషభ
(2.7)
మ
σೖ
೗సభ ୈሺ௫௜ǡ௖௟ሻ
ೢషభ
Parameter cj is the centroid of the j-th group and
D() is the distance between the data and the centroid. w
is the weighting exponent parameter introduced in
FCM. There is no value of precision, where the value
of w is usually greater than 1 and generally rated 2.
To calculate the centroid in group cj in features j,
use the following formula:
σಾ ೢ
೗సభሺ୳୧୪ሻ ௫௟௝
c ij= (2.8)
σಾ೗సభሺ୳୧୪ሻ ೢ
Parameter M is the amount of data, w is the weight
of rank, and uil is the membership degree value of data
xi to group ci. Meanwhile, the objective function used is
J = σெ ௞ ௪
௜ୀଵ σ௝ୀଵሺ—‹Œሻ ሺ‫݅ݔ‬ǡ ݆ܿሻ
ଶ
(2.9)
Essentially the FCM algorithm has many
similarities with K-Means. The procedure of fuzzy c-
means grouping is as follows [8]:
1. Determine the number of groups.
2. Select one of the data as a centroid for each
group.
3. Calculate the centroid values of each group.
4. Calculate the degree of membership value of
each data into each group.
5. Return to step 3 if the change in membership
degree value is still above the specified
threshold value, or if the change in centroid
value is still above the specified threshold
value, or if the change in the value of the
objective function is still above the specified
threshold value.
III. EXPERIMENTAL SETUP
When fuzzy c-means is applied to summarize a
document, the first thing to do is the extraction of the
text from the document. After the extraction is done
the next step is preprocessing stage. This stage
includes:
1. Case folding is a process of converting all letters
in the document (sentences) into lowercase. In
addition, characters other than letters are omitted.
2. Tokenizing is a process of cutting each word in
each sentence or parsing by using a space as a
delimiter that will generate a word token.
3. Filtering is a process of filtering out the stopwords
obtained from unimportant tokenizing stage, such
as "what", "who", "the", "when", and "where".
4. Stemming is a process of returning the words
obtained from the filtering into their basic forms
by eliminating prefix and suffix.
5. Analyzing is a process of calculating the term
interconnection between words. This stage is well-
known as the weighting stage.
In the fifth stage, the TF-IDF method is applied.
The application begins with the process of calculating
the appearance of term (word) in each document. When
the TF calculation stage is complete, the next step is to
ே
calculate the IDF with the formula IDF (tk) = Ž‘‰ .
ௗ௙ሺ௧ሻ
After the value of TF and IDF have been found, the
value of TF-IDF is then calculated by using the TF-IDF
equation TF-IDF( tk,dj)=TF( tk,dj)*IDF( tk). The TF-IDF
is calculated by just multiplying the value of TF with
the value of IDF. If the value of TF-IDF of each
document is found, in the column of each document the
value of TF-IDF is accumulated to obtain the value of
sentence weight and is sorted by descending.
This research aims to find and classify the
sentences of a document into two groups, namely
important and unimportant sentence groups. Up to this
 stage, the weight of each sentence has been obtained so ଶ‫כ‬௥௘௖௔௟௟‫כ‬௣௥௘௖௜௦௦௜௢௡
f-measure = ‫ͲͲͳ כ‬Ψ
that grouping process can be done. ௥௘௖௔௟௟ା௣௥௘௖௜௦௦௜௢௡

The process of this sentence grouping is a step

where the fuzzy c-means method is applied. The steps Table 3. Accuracy
in the process of sentence weight grouping are as N Recall Precision (%) f-measure
follows. o (%) =
1. Determine the number of groups. In this case we ଶ‫כ‬௥௘௖௔௟௟‫כ‬௣௥௘௖௜௦௦௜௢௡
‫כ‬
௥௘௖௔௟௟ା௣௥௘௖௜௦௦௜௢௡
determine two groups, namely important and
unimportant sentence groups. ͳͲͲΨ
2. Select one of the data as a centroid for each group. 1 27 % 21 % 23 %
At this stage, the data is selected randomly because 2 46 % 20 % 27,67 %
in each iteration center group will be fixed until the 3 62 % 45 % 52,14 %
center value of the group does not change again. 4 65 % 30 % 41,05 %
3. Calculate the centroid values of each group. 5 39 % 44 % 41,34 %
4. Calculate the degree of membership value of each Notes [16]:
data into each group. At this stage each data will
Recall is the calling document that is relevant to the
move to the center of the group based on the
statement (query) entered by the user into the
degree of membership that has been determined.
system
5. Return to step 3 if the change in membership
degree value is still above the specified threshold Precision is the number of relevant document groups of
value, or if the change in centroid value is still the total number of documents found by the
above the specified threshold value, or if the system
change in the value of the objective function is still
above the specified threshold value. The value of w f-measure : harmonic weight mean from recall and
is 2. precision

IV. RESULT V. CONCLUSION

After comparing the results of manual summaries

Table 2. and Table 3 show the results of the test with system summaries, the average value for recall,
and the accuracy of the summarization system when precision, and f-measure are 47.8%, 32%, and 37.04%
compared to the results of human manual summary. respectively. At the evaluation stage, the highest recall
The table of test results of the application is as follows. value is 65%, while for precision and f-measure are
30% and 41,05%, respectively. Meanwhile the lowest
Table 2. Summarization Result of System with Manual
Summarization Result
recall value is 27% with precision 21% and f-measure
No. Number of Number of Number of the 23%. The values indicate that the resulting summary is
sentences sentences of same not effective enough to produce a summary result that is
of manual sentences/Simil accurate or feasible to use. This can be caused by a
summarizat summarizati arity (A‫ޔ‬B) summary process that relies only on the weight of a
ion system on (B) sentence that is highly dependent on the appearance of
(A) the term in the document. In subsequent work, the
sentence extraction process needs to be optimized to
1 66 51 14
improve accuracy and performance. In addition, the
2 110 49 23
source document needs to be developed so that it can
3 140 101 63
process various types of file extensions as a whole in the
4 134 63 41 sense of not limited by the number of characters. It
5 72 82 32 needs special handling for article content in the form of
After the sentence is matched between the system source code, tables, or URLs.
summary results with man-made summary results to
know the accuracy of the summary. The function of REFERENCE
finding recall, precision and f-measure are calculated
by the following equations [15]: [1] “Kemampuan Bahasa Inggris Masyarakat
௖௢௥௥௘௖௧ Indonesia Masih Rendah,” 2016. .
recall =
௖௢௥௥௘௖௧ା௠௜௦௦௘ௗ
[2] D. Nugraha, P. Putra, and A. Suharsono,
௖௢௥௥௘௖௧
precission = “Peringkas Dokumen Tunggal Berbahasa
௖௢௥௥௘௖௧ା௪௥௢௡௚
Indonesia Menggunakan Metode Sentences
 Clustering dan Frequent Term,” pp. 1–10, 2008. [15] A. Ridok, “Peringkasan Dokumen Bahasa
Indonesia Berbasis Non-Negative Matrix
[3] I. M. B. Adnyana, “Implementasi Algoritma Factorization ( Nmf ),” vol. 1, no. 1, pp. 39–44,
Fuzzy C Means Dan Statistical Region Merging 2014.
Pada Segmentasi Citra,” pp. 9–10, 2015.
[16] M. A. Setiawan, “PENGERTIAN RECALL,
[4] D. Cao and L. Xu, “Analysis of Complex PRECISION, F-MEASURE,” 2013. .
Network Methods for Extractive Automatic Text
Summarization,” pp. 2749–2756, 2016.
[5] Budi Susanto, “Text summarization,” pp. 1–12.
[6] V. K. Singh, “Document Clustering using K-
means , Heuristic K-means and Fuzzy C-
means,” 2011.
[7] J. Ilmiah, I. Asia, B. Dwijawisnu, A. Hetami,
and S. A. Malang, “PERANCANGAN
INFORMATION RETRIEVAL ( IR ) UNTUK
PENCARIAN IDE POKOK TEKS ARTIKEL
BERBAHASA INGGRIS DENGAN
PEMBOBOTAN VECTOR SPACE MODEL,”
vol. 9, no. 1, 2015.
[8] P. Bafna, D. Pramod, and A. Vaidya,
“Document clustering: TF-IDF approach,” in
2016 International Conference on Electrical,
Electronics, and Optimization Techniques
(ICEEOT), 2016, pp. 61–66.
[9] B. A. Kuncoro and B. H. Iswanto, “TF-IDF
method in ranking keywords of Instagram users’
image captions,” in 2015 International
Conference on Information Technology Systems
and Innovation (ICITSI), 2015, pp. 1–5.
[10] Li-Ping Jing, Hou-Kuan Huang, and Hong-Bo
Shi, “Improved feature selection approach
TFIDF in text mining,” in Proceedings.
International Conference on Machine Learning
and Cybernetics, 2002, vol. 2, pp. 944–946.
[11] Ning Zhong, Yuefeng Li, and Sheng-Tang Wu,
“Effective Pattern Discovery for Text Mining,”
IEEE Trans. Knowl. Data Eng., vol. 24, no. 1,
pp. 30–44, Jan. 2012.
[12] R. Bharathi, “A distributed , scalable
parallelization of Fuzzy c-Means Algorithm .,”
2016.
[13] D. Zhu, Y. Li, and C. Zhang, “Automatic Time
Picking for Microseismic Data Based on a
Fuzzy C-Means Clustering Algorithm,” no. 1,
pp. 1–5, 2016.
[14] E. Prasetyo, Data Mining Konsep dan Aplikasi
Menggunakan MATLAB. Yogyakarta: ANDI,
2012.