最終更新日:2022/12/24
For co-clustering the web documents data, existing algorithms have three challenges, they are: meta-information that are available is usually precise so that the extracted tags or the categories cannot be adequatively weighted by conventional data mining routine such as term frequencyinverse document frequency (tf-idf). Next the feature vectors weight in the function depends on various experimental settings lead to unsounded conclusion. Finally, there is high computational overhead for ensuring the concurrence which requires a repeating process.
音声機能が動作しない場合はこちらをご確認ください
編集履歴(0)
元となった例文
For
co-clustering
the
web
documents
data,
existing
algorithms
have
three
challenges,
they
are:
meta-information
that
are
available
is
usually
precise
so
that
the
extracted
tags
or
the
categories
cannot
be
adequatively
weighted
by
conventional
data
mining
routine
such
as
term
frequencyinverse
document
frequency
(tf-idf).
Next
the
feature
vectors
weight
in
the
function
depends
on
various
experimental
settings
lead
to
unsounded
conclusion.
Finally,
there
is
high
computational
overhead
for
ensuring
the
concurrence
which
requires
a
repeating
process.