Knowledge Discovery in Services

被引：8

作者：

Blake, M. Brian ^{[1
]}

机构：

[1] Univ Notre Dame, Dept Comp Sci & Engn, Notre Dame, IN 46556 USA

来源：

IEEE INTERNET COMPUTING | 2009年 / 13卷 / 02期

关键词：

Cleaning; Data mining; KDS; Knowledge discovery and databases; Mashups; Presses; Probability density function; Service mashup; Service-oriented computing; Software; Web services; Web-scale workflow;

D O I：

10.1109/MIC.2009.39

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Service mashups can be useful in understanding Web-scale workflows. Although creating a service mashup shares similar challenges with data integration, a more exciting aspect of this area is the ability to predict which services are viable candidates for a mashup. Such "service mashup recommendations" can enable knowledge discovery, an approach the author calls knowledge discovery in services (KDS).

引用

页码：88 / 91

页数：4

共 9 条

[1] Service-oriented computing
Bichler, M
Lin, KJ
[J]. COMPUTER, 2006, 39 (03) : 99 - 101
[2] Predicting Service Mashup Candidates Using Enhanced Syntactical Message Management
Blake, M. Brian
Nowlan, Michael F.
[J]. 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING, PROCEEDINGS, VOL 1, 2008, : 229 - 236
[3] Halevy A.Y., 2005, P 2005 ACM SIGMOD IN, V2005, P778, DOI DOI 10.1145/1066157.1066246
[4] Han J., 2012, Data Mining, P393, DOI [DOI 10.1016/B978-0-12-381479-1.00009-5, 10.1016/B978-0-12-381479-1.00009-5]
[5] Jhingran Anant., 2006, VLDB, P3
[6] Sabbouh M., 2007, International World Wide Web Conference, P1305
[7] Wang YQ, 2003, FOURTH INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS ENGINEERING, PROCEEDINGS, P147
[8] Fast complex valued matrix inversion for multi-user STBC-MIMO decoding
Wu, Di
Eilert, Johan
Liu, Dake
Wang, Dandan
Al-Dhahir, Naofal
Minn, Hlaing
[J]. IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI, PROCEEDINGS: EMERGING VLSI TECHNOLOGIES AND ARCHITECTURES, 2007, : 325 - +
[9] Zaremski A., 1995, ACM Transactions on Software Engineering, V6, P333, DOI DOI 10.1145/261640.261641

← 1 →