<transcript><audio_37>representative line for the points the standard algorithm or the standard idea for finding the best line is as follows so we will find the line y equals mx plus c okay so by that i mean you have</transcript><transcript><audio_38>to find m and c okay such that the distance of the points to the line is minimized and this minimization happens in a least in section 5.7 of the book we discuss</transcript><transcript><audio_39>how to calculate m and c that calculation is simple enough but that is really not relevant to the point at hand the point at hand being how do we do graphical input so we are not going to discuss that but we are just going to assume that m and c there</transcript><transcript><audio_40>is some way to calculate m and c and we can write a program to do that given the coordinates of the points now here is the main observation the main point of this exercise as you can see it is more natural to give the points by</transcript> representative line for the points the standard algorithm or the standard idea for finding the best line is as follows so we will find the line y equals mx plus c okay so by that i mean you have to find m and c okay such that the distance of the points to the line is minimized and this minimization happens in a least in section 5.7 of the book we discuss how to calculate m and c that calculation is simple enough but that is really not relevant to the point at hand the point at hand being how do we do graphical input so we are not going to discuss that but we are just going to assume that m and c there is some way to calculate m and c and we can write a program to do that given the coordinates of the points now here is the main observation the main point of this exercise as you can see it is more natural to give the points by
{"source": "grass-yt-cc-by.1DvID8KMXUY|shard_10059_69|create_multimodal_data.extract_yt_and_generate_transcripts.58|shard_10059|create_multimodal_data.generate_captions.59|shard_10059|create_multimodal_data.generate_captions.60", "params": {"id": "1DvID8KMXUY", "channel_id": "UC3lp1Pk33sziERUwvmiNBqQ", "duration": 1646, "view_count": 46, "age_limit": 0, "chapters": [{"start_time": 0.0, "title": "Introduction", "end_time": 28.0}, {"start_time": 28.0, "title": "What is graphical input", "end_time": 79.0}, {"start_time": 79.0, "title": "Advantages of graphical input", "end_time": 269.0}, {"start_time": 269.0, "title": "GetClick", "end_time": 478.0}, {"start_time": 478.0, "title": "Graphical Input", "end_time": 644.0}, {"start_time": 644.0, "title": "Program", "end_time": 1121.0}, {"start_time": 1121.0, "title": "Coding", "end_time": 1548.0}, {"start_time": 1548.0, "title": "Conclusion", "end_time": 1646}], "like_count": 1, "channel_follower_count": 34800, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@StudioIITBombay", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10059/1DvID8KMXUY.tar.gz"}}