corrode
发表于 2025-3-21 19:16:14
书目名称Intelligent Information and Database Systems影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0469756<br><br> <br><br>书目名称Intelligent Information and Database Systems读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0469756<br><br> <br><br>
set598
发表于 2025-3-21 23:29:24
http://reply.papertrans.cn/47/4698/469756/469756_2.png
Nonflammable
发表于 2025-3-22 00:48:04
Exact Discovery of Length-Range Motifssolve this problem with no a-priori knowledge of the timeseries or motif characteristics. MK algorithm is the de facto standard exact motif discovery algorithm but it can discover a single motif of a known length. In this paper, we argue that it is not trivial to extend this algorithm to handle mult
生存环境
发表于 2025-3-22 04:43:17
Feature Reduction Using Standard Deviation with Different Subsets Selection in Sentiment Analysisompiling many features in document-level. Consequently, we will have a high-dimensional feature space. In this paper, we propose an algorithm based on standard deviation method to solve the high-dimensional feature space. The algorithm constructs feature subsets based on dispersion of features. In o
maverick
发表于 2025-3-22 09:10:50
http://reply.papertrans.cn/47/4698/469756/469756_5.png
惊惶
发表于 2025-3-22 14:54:48
http://reply.papertrans.cn/47/4698/469756/469756_6.png
信任
发表于 2025-3-22 20:45:06
http://reply.papertrans.cn/47/4698/469756/469756_7.png
CLAP
发表于 2025-3-22 21:12:02
Mining Class Association Rules with the Difference of Obidsetsring Obidsets of itemsets and time in computing the intersection between two Obidsets. In this paper, we propose an improved algorithm for mining class association rules by using the difference between two Obidsets (d2O). Firstly, the d2O concept is developed. After that, a strategy for reducing the
Locale
发表于 2025-3-23 02:10:04
http://reply.papertrans.cn/47/4698/469756/469756_9.png
uncertain
发表于 2025-3-23 09:23:19
http://reply.papertrans.cn/47/4698/469756/469756_10.png