標(biāo)題: Titlebook: Agents and Data Mining Interaction; 9th International Wo Longbing Cao,Yifeng Zeng,Philip S. Yu Conference proceedings 2014 Springer-Verlag [打印本頁] 作者: 胃口 時間: 2025-3-21 19:58
書目名稱Agents and Data Mining Interaction影響因子(影響力)
書目名稱Agents and Data Mining Interaction影響因子(影響力)學(xué)科排名
書目名稱Agents and Data Mining Interaction網(wǎng)絡(luò)公開度
書目名稱Agents and Data Mining Interaction網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Agents and Data Mining Interaction被引頻次
書目名稱Agents and Data Mining Interaction被引頻次學(xué)科排名
書目名稱Agents and Data Mining Interaction年度引用
書目名稱Agents and Data Mining Interaction年度引用學(xué)科排名
書目名稱Agents and Data Mining Interaction讀者反饋
書目名稱Agents and Data Mining Interaction讀者反饋學(xué)科排名
作者: aesthetician 時間: 2025-3-21 20:48 作者: Diverticulitis 時間: 2025-3-22 04:18
Towards Mining Norms in Open Source Software Repositoriested. Open source communities offer exciting new application opportunities for extracting norms since such communities involve developers from different geographical regions, background and cultures. Investigating the types of norms that exist in open source projects and their efficacy (i.e. .) in en作者: MAIZE 時間: 2025-3-22 06:42 作者: obligation 時間: 2025-3-22 10:05
Redundant Feature Selection for Telemetry Dataity of agents that use the data [.]. Supervised feature selection aims to overcome this problem by selecting features that are highly related to the class labels, yet unrelated to each other. One proposed technique to select good features with few inter-dependencies is minimal Redundancy Maximal Rel作者: 讓步 時間: 2025-3-22 14:50 作者: 疼死我了 時間: 2025-3-22 20:33
Learning Heterogeneous Coupling Relationships Between Non-IID Termsthe text data has increased its importance, a variety of text mining and process algorithms have been created in the recent years such as classification, clustering, similarity comparison. Most previous research uses a vector-space model for text representation and analysis. However, the vector-spac作者: 失望未來 時間: 2025-3-22 22:20 作者: COWER 時間: 2025-3-23 02:44
A Spectral Clustering Algorithm Based on Hierarchical Methodomplex structures. In the past few years, several spectral clustering algorithms were proposed to cluster arbitrarily shaped data in various real applications including image processing and web analysis. However, most of these algorithms were based on k-means, which is a randomized algorithm and mak作者: 茁壯成長 時間: 2025-3-23 08:51
Transitive Identity Mapping Using Force-Based Clusteringtantiates each record as an agent that actively self-organizes with other agents (including queries). Imitating the movement of bodies under physical forces, we describe a distributed algorithm (“force-based clustering,” or FBC) for dynamically clustering and querying large, heterogeneous, dynamic c作者: Circumscribe 時間: 2025-3-23 10:05 作者: Albumin 時間: 2025-3-23 16:24 作者: 寬容 時間: 2025-3-23 20:24
Gulsan Karbani,Susie Godsil,Robert MuellerX models based on the outcome variables that are of interest in terms of explanation or prediction. At the same time, there is potential for (partial) re-using UX models across products and generalisation of models. As a case study, an experience model is developed for a particular consumer product,作者: interrupt 時間: 2025-3-24 01:52
Josephine Green,Merry France-Dawson each other to improve their learning ability. This paper focuses on association rule, and presents MALA, a model for argumentation based multi-agent joint learning which integrates ideas from machine learning, data mining and argumentation. We introduce the argumentation model Arena as a communicat作者: 新星 時間: 2025-3-24 05:03 作者: 形上升才刺激 時間: 2025-3-24 09:51
Jennifer Kromberg,Trefor Jenkinspammer detection and other fields. We focus on the features of authors behavior on the dynamic data. This paper applies multi-agent system to the authors information mining fields and proposes a recognition model based on multi-agent system: MVIA-MAS. We cluster the author information in each time s作者: 熱情的我 時間: 2025-3-24 14:24 作者: Bone-Scan 時間: 2025-3-24 16:44
https://doi.org/10.1007/978-3-031-37530-9ices) such as Facebook, more and more people are attracted to Internet. Internet provides many benefits to people, but yields a consequent disturbing phenomenon of obsession with Internet, which is called PIU (Pathological Internet Use) or IAD (Internet Addiction Disorder) in academia. PIU or IAD ha作者: 抵消 時間: 2025-3-24 22:36 作者: 頭腦冷靜 時間: 2025-3-25 01:05
https://doi.org/10.1007/978-3-031-37530-9idemiology and recommendation systems. In particular, information cascades can be useful for not only inferring the underlying structure of the network, but also providing insights on the properties of information itself. In this paper, we address the problem of jointly modeling the influence struct作者: anatomical 時間: 2025-3-25 05:20 作者: 鄙視 時間: 2025-3-25 11:05 作者: arterioles 時間: 2025-3-25 13:06
https://doi.org/10.1007/978-3-642-55192-5agent mining; artificial intelligence; clustering; data mining; distributed systems; intelligent agents; m作者: 受傷 時間: 2025-3-25 17:51 作者: 松果 時間: 2025-3-25 23:37
Longbing Cao,Yifeng Zeng,Philip S. YuIncludes supplementary material: 作者: 泛濫 時間: 2025-3-26 00:23 作者: Favorable 時間: 2025-3-26 06:54
Agents and Data Mining Interaction978-3-642-55192-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 拔出 時間: 2025-3-26 09:20
Redundant Feature Selection for Telemetry Datage of these different types of redundancy, considering intra-signal and inter-signal redundancies separately. We illustrate the process on vehicle telemetry signal data collected in a driver distraction monitoring project. We evaluate it using several machine learning algorithms: Random Forest; Na?v作者: Estrogen 時間: 2025-3-26 16:38
Learning Heterogeneous Coupling Relationships Between Non-IID Termsd relations from term to term. This coupled representation provides much richer information that enables us to create a coupled similarity metric for measuring document similarity, and a coupled document similarity based K-Nearest centroid classifier will be applied to the classification task. Exper作者: NOCT 時間: 2025-3-26 17:49 作者: 遺傳 時間: 2025-3-26 23:34
A Spectral Clustering Algorithm Based on Hierarchical Methodriments on both synthetic data sets and real data sets show that . outperforms other six popular clustering algorithms. The method is simple but is shown to be efficient in clustering both convex shaped data and arbitrarily shaped data.作者: overshadow 時間: 2025-3-27 03:51
https://doi.org/10.1007/978-3-031-37530-9ge of these different types of redundancy, considering intra-signal and inter-signal redundancies separately. We illustrate the process on vehicle telemetry signal data collected in a driver distraction monitoring project. We evaluate it using several machine learning algorithms: Random Forest; Na?v作者: Incorporate 時間: 2025-3-27 08:20 作者: 滔滔不絕地說 時間: 2025-3-27 11:19
https://doi.org/10.1007/978-3-031-37530-9anner, which enables them to reinforce each other and thus enhances the estimation of both. Experiments on both real and synthetic data show that our algorithm typically outperforms several existing methods and accurately estimates the hotness of information from the observed data.作者: 名詞 時間: 2025-3-27 14:21
Conclusions: Transrational Hoperiments on both synthetic data sets and real data sets show that . outperforms other six popular clustering algorithms. The method is simple but is shown to be efficient in clustering both convex shaped data and arbitrarily shaped data.作者: Insatiable 時間: 2025-3-27 19:52 作者: 講個故事逗他 時間: 2025-3-27 23:40 作者: enchant 時間: 2025-3-28 02:29 作者: 大喘氣 時間: 2025-3-28 06:14
https://doi.org/10.1007/978-3-031-37530-9terest, but no record in the collection directly matches this information. Application of FBC identifies a small subset of records that are good candidates for describing the person of interest, for further manual investigation and verification.作者: 浪費(fèi)時間 時間: 2025-3-28 14:21
Towards Mining Norms in Open Source Software Repositoriess an architecture for . norms from open source projects. It also discusses the opportunities presented by the domain of software repositories for the study of norms. In particular, it points towards how norms can be mined by leveraging and extending prior work in the areas of Normative Multi-Agent Systems (NorMAS) and mining software repositories.作者: debunk 時間: 2025-3-28 17:56
Mining Emerging Patterns of PIU from Computer-Mediated Interaction Eventstern mining method based on interactive event generators, called PIU-Miner, is proposed in this paper. Experimental results show that PIU-Miner is an efficient and effective approach to discovering PIU.作者: 鍵琴 時間: 2025-3-28 21:32
Transitive Identity Mapping Using Force-Based Clusteringterest, but no record in the collection directly matches this information. Application of FBC identifies a small subset of records that are good candidates for describing the person of interest, for further manual investigation and verification.作者: AND 時間: 2025-3-29 01:44 作者: monochromatic 時間: 2025-3-29 04:12 作者: Armada 時間: 2025-3-29 07:44
Jennifer Kromberg,Trefor Jenkinslice in parallel and then use association rule mining to find the target author groups, in which the multiple virtual identities are considered associated. Experiments show that the model has a better overall performance.作者: ventilate 時間: 2025-3-29 12:42 作者: Congestion 時間: 2025-3-29 16:25 作者: 態(tài)度暖昧 時間: 2025-3-29 23:43
