This paper presents a result of cases of Innovators Marketplace on Data Jackets (IMDJ), a market-like creativity support system for providers, users, and analysts of data. In the cases dealt here, a method for visualization was created as a result of IMDJ, responding to the presented requirements for data analysis. This created method called Tangled String (TS) visualizes given data including a sequence of items. TS separates the sequence into tangled ``pills'' that are sub-sequences corresponding to parts where the topic is uncertain or various topics are involved, and ``wires'' corresponding to transitions from/to pills. Based on this separation, the importance of items are computed based on their positions in the overall string. This design of visualization of a sequence fits the requirement presented in IMDJ. Furthermore, the performance of TS is shown by experimental cases, one for the text of discourse log and the other for the sensor-based log of human's movement in office. These cases show TS meets requirements in IMDJ, that reflects the social demands for reusing data via analysis.
Windows azure marketplace. https://datamarket.azure.com/.
2.
KDnuggets: Datasets for data mining and data science, http:// www.kdnuggets.com/datasets/index.html.
3.
CKAN, The open source data portal software. http://ckan. org/.
4.
The home of the U.S. Government's open data https://www. data.gov/.
5.
Linked data glossary, 2013. http://wwww3.org/TR/ld-glossa- ry/#linked-data.
6.
DeloitteL.L.P., Open growth: Stimulating demand for open data in the UK, 2012. https://www2deloitte.com/content/. dam/Deloitte/uk/Documents/deloitte-analytics/open-growth. pdf.
7.
OhsawaY., KidoH., HayashiT. and LiuC., Data jackets for synthesizing values in the market of data, Procedia Computer Science22 (2013), 709-716.
8.
GentnerD., Structure-mapping: A theoretical framework for analogy, Cognitive Science7 (1983), 155-170.
9.
PanS.J. and YangQ., A survey on transfer learning, technical report HKUST-CS08-08, Dept of Computer Science and Engineering, Hong Kong Univ of Science and Technology, (2008).
10.
OhsawaY., NelsE.B. and YachidaM., KeyGraph: Automatic indexing by co-occurrence graph based on building construction metaphor, Proc Advanced Digital Library Conference (IEEE ADL'98), (1998), 12-18.
11.
OhsawaY. and McBurneyP., Chance discovery, Springer Verlag, 2003.
12.
OhsawaY. and FukudaH., Chance discovery by stimulated group of people - An application to understanding rare consumption of food, Journal of Contingencies and Crisis Management10(3) (2002), 129-138.
13.
FruchterR. et al., Knowledge reuse through chance discovery from an enterprise design-build enterprise data store, New Mathematics and Natural Computation3 (2005), 393-406.
14.
LlorX. et al., Innovation and creativity support via chance discovery, genetic algorithms, New Mathematics and Natural Computation2(1) (2006), 85-100.
15.
KimK.J., JungmM.C. and ChoS.B., KeyGraph-based chance discovery for mobile contents management system, International Journal of Knowledge-based and Intelligent Engineering Systems11(5) (2007), 313-320.
MannilaH., ToivonenH. and VerkanmoA.I., Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery1 (1997), 259-289.
18.
WeissG.M. and HirshH., Learning to predict rare events in event sequences, in: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), AAAI Press, Menlo Park, CA, (1998), 359-363.
19.
DehaspeL. and ToivonenH., Discovery of frequent datalog patterns, Data Mining and Knowledge Discovery3(1) (1999), 7-36.
20.
PrasunD. and SubhasisC., Prediction of retail sales of footwear using feed-forward and recurrent neural networks, Neural Computing and Applications16(4-5) (2007), 491-502.
21.
WarrenT., Clustering of time series data - A survey, Pattern Recognition38(11) (2005), 1857-1874.
22.
HiranoS. and TsumotoS., Cluster analysis of trajectory data on hospital laboratory examinations, American Medical Informatics Association Annu Symp Proc (2007), 324-328.
23.
FriedmanN., MurphyK. and RusselS., Learning the structure of dynamic probabilistic networks, 14th Conf on Uncertainty in Artificial Intelligence (UAI), (1998).
24.
ChiuB., KeoghE. and LonardiS., Probabilistic discovery of time series motifs, Proc ACM KDD (2003).
25.
HayashiY. and YamanishiK., Sequential network change detection with its application to ad impact relation analysis, Proc IEEE Int'l Conf Data Mining (2012).
26.
HiraiS. and YamanishiL., Detecting changes of clustering structures using normalized maximum likelihood coding, Proc ACM Knowledge Discovery and Data Mining (2012), 343-351.
27.
BleiD.M., NgA.Y. and JordanM.I., Latent dirichlet allocation, Journal of Machine Learning Research3(4-5) (2003), 993-1022. doi:101162/jmlr.2003.3.4-5.993.
28.
MatsuoY. et al., POLYPHONET: An ddvanced social network extraction system, Journal of Web Semantics5(4) (2007).
29.
WangH. and OhsawaY., Idea discovery: A scenario-based systematic approach for decision making in market innovation, Expert Systems with Applications40(2) (2013), 429-438.
30.
PickardK.T., Exploring markets of data for personal health information, in: Proc the 2nd Workshop on Designing the Market of Data, in Conjunction with ICDM2014, Shenzhen, China, (2014).
31.
MohammedS. and RingseisE., Cognitive diversity and consensus in group decision making, Organizational Behavior and Human Decision Processes85(2) (2001), 310-335.
32.
GottesdienerE., Requirements by Collaboration: Workshops for Defining Needs, Addison-Wesley Professional (2002).
33.
OhsawaY. and HayashiT., Visualizing History for Qualitative Explanation of valuable events using tangled string, proceedings of Knowledge-Based and Intelligent Information & Engineering systems 19th Annual conference, Procedia Computer Science60 (2015), 1178-1185.
